./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/loops/invert_string_true-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -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 /storage/repos/svcomp/c/loops/invert_string_true-unreach-call_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 60adf12976c621166b8ffd5e872004e7d6c30802 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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.24-91b1670 [2018-11-28 23:41:21,005 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:41:21,008 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:41:21,026 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:41:21,026 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:41:21,028 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:41:21,029 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:41:21,031 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:41:21,033 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:41:21,034 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:41:21,034 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:41:21,035 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:41:21,036 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:41:21,036 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:41:21,038 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:41:21,038 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:41:21,039 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:41:21,041 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:41:21,043 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:41:21,045 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:41:21,046 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:41:21,047 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:41:21,049 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:41:21,050 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:41:21,050 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:41:21,051 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:41:21,052 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:41:21,053 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:41:21,053 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:41:21,054 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:41:21,055 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:41:21,055 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:41:21,056 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:41:21,056 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:41:21,057 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:41:21,058 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:41:21,058 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-28 23:41:21,082 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:41:21,084 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:41:21,085 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:41:21,085 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:41:21,085 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:41:21,086 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 23:41:21,087 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 23:41:21,088 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 23:41:21,088 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 23:41:21,088 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 23:41:21,088 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 23:41:21,089 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:41:21,089 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 23:41:21,089 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:41:21,089 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:41:21,090 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 23:41:21,090 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:41:21,090 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 23:41:21,090 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 23:41:21,091 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 23:41:21,091 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 23:41:21,091 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 23:41:21,091 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 23:41:21,091 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:41:21,091 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 23:41:21,092 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:41:21,094 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:41:21,095 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 23:41:21,095 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:41:21,095 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:41:21,095 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 23:41:21,096 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 23:41:21,096 INFO L133 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 -> 60adf12976c621166b8ffd5e872004e7d6c30802 [2018-11-28 23:41:21,152 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:41:21,166 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:41:21,169 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:41:21,171 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:41:21,171 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:41:21,172 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/loops/invert_string_true-unreach-call_true-termination.i [2018-11-28 23:41:21,232 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99d40fa14/3a3ab58851674b509b14223d414e952b/FLAG358ea2c5b [2018-11-28 23:41:21,667 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:41:21,669 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/loops/invert_string_true-unreach-call_true-termination.i [2018-11-28 23:41:21,675 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99d40fa14/3a3ab58851674b509b14223d414e952b/FLAG358ea2c5b [2018-11-28 23:41:22,037 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99d40fa14/3a3ab58851674b509b14223d414e952b [2018-11-28 23:41:22,040 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:41:22,042 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 23:41:22,043 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:41:22,044 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:41:22,048 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:41:22,049 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:41:22" (1/1) ... [2018-11-28 23:41:22,053 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c117e29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:41:22, skipping insertion in model container [2018-11-28 23:41:22,053 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:41:22" (1/1) ... [2018-11-28 23:41:22,062 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:41:22,084 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:41:22,348 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:41:22,360 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:41:22,397 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:41:22,432 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:41:22,433 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:41:22 WrapperNode [2018-11-28 23:41:22,433 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:41:22,434 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 23:41:22,434 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 23:41:22,434 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 23:41:22,445 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:41:22" (1/1) ... [2018-11-28 23:41:22,459 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:41:22" (1/1) ... [2018-11-28 23:41:22,494 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 23:41:22,494 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:41:22,494 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:41:22,494 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:41:22,507 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:41:22" (1/1) ... [2018-11-28 23:41:22,507 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:41:22" (1/1) ... [2018-11-28 23:41:22,517 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:41:22" (1/1) ... [2018-11-28 23:41:22,519 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:41:22" (1/1) ... [2018-11-28 23:41:22,525 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:41:22" (1/1) ... [2018-11-28 23:41:22,531 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:41:22" (1/1) ... [2018-11-28 23:41:22,533 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:41:22" (1/1) ... [2018-11-28 23:41:22,535 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:41:22,536 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:41:22,536 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:41:22,536 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:41:22,537 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:41:22" (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 [2018-11-28 23:41:22,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 23:41:22,683 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 23:41:22,684 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:41:22,684 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:41:22,684 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 23:41:22,684 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 23:41:23,123 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:41:23,123 INFO L280 CfgBuilder]: Removed 9 assue(true) statements. [2018-11-28 23:41:23,124 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:41:23 BoogieIcfgContainer [2018-11-28 23:41:23,124 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:41:23,125 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 23:41:23,125 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 23:41:23,132 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 23:41:23,133 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:41:23,135 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:41:22" (1/3) ... [2018-11-28 23:41:23,136 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@77444459 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:41:23, skipping insertion in model container [2018-11-28 23:41:23,137 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:41:23,137 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:41:22" (2/3) ... [2018-11-28 23:41:23,138 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@77444459 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:41:23, skipping insertion in model container [2018-11-28 23:41:23,139 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:41:23,139 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:41:23" (3/3) ... [2018-11-28 23:41:23,142 INFO L375 chiAutomizerObserver]: Analyzing ICFG invert_string_true-unreach-call_true-termination.i [2018-11-28 23:41:23,243 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:41:23,244 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 23:41:23,244 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 23:41:23,244 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 23:41:23,245 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:41:23,245 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:41:23,245 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 23:41:23,245 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:41:23,245 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 23:41:23,264 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2018-11-28 23:41:23,286 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-11-28 23:41:23,287 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:41:23,287 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:41:23,295 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 23:41:23,295 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:41:23,295 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 23:41:23,295 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2018-11-28 23:41:23,297 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-11-28 23:41:23,297 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:41:23,297 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:41:23,298 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 23:41:23,298 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:41:23,307 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem3, main_#t~post4, main_#t~post2, main_#t~mem6, main_#t~mem7, main_#t~post8, main_#t~post5, 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.alloc((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.alloc((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; 16#L16-3true [2018-11-28 23:41:23,307 INFO L796 eck$LassoCheckResult]: Loop: 16#L16-3true assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 18#L16-2true main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 16#L16-3true [2018-11-28 23:41:23,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:23,314 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-28 23:41:23,316 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:23,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:23,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:23,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:41:23,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:23,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:23,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:23,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:23,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2018-11-28 23:41:23,457 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:23,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:23,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:23,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:41:23,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:23,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:23,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:23,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:23,484 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2018-11-28 23:41:23,484 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:23,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:23,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:23,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:41:23,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:23,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:23,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:23,822 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-11-28 23:41:24,269 WARN L180 SmtUtils]: Spent 437.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 39 [2018-11-28 23:41:24,292 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:41:24,293 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:41:24,293 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:41:24,294 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:41:24,294 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:41:24,294 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:41:24,294 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:41:24,294 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:41:24,295 INFO L131 ssoRankerPreferences]: Filename of dumped script: invert_string_true-unreach-call_true-termination.i_Iteration1_Lasso [2018-11-28 23:41:24,295 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:41:24,295 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:41:24,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:24,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:24,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:24,581 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-11-28 23:41:24,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:24,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:24,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:24,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:24,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:24,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:24,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:24,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:24,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:24,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:24,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:25,210 WARN L180 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2018-11-28 23:41:25,443 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:41:25,449 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:41:25,452 INFO L122 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 [2018-11-28 23:41:25,453 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:25,454 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:25,455 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:25,455 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:25,455 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:25,457 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:25,457 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:25,460 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:25,460 INFO L122 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 [2018-11-28 23:41:25,461 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:25,461 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:25,461 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:25,461 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:25,464 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:41:25,465 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:41:25,470 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:25,470 INFO L122 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 [2018-11-28 23:41:25,471 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:25,471 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:25,471 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:25,472 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:25,472 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:25,472 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:25,473 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:25,474 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:25,474 INFO L122 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 [2018-11-28 23:41:25,475 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:25,475 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:25,476 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:25,476 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:25,478 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:41:25,479 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:41:25,493 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:25,493 INFO L122 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 [2018-11-28 23:41:25,494 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:25,494 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:41:25,495 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:25,495 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:25,497 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:41:25,497 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:41:25,505 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:25,505 INFO L122 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 [2018-11-28 23:41:25,506 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:25,506 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:25,506 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:25,506 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:25,509 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:41:25,509 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:41:25,513 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:25,513 INFO L122 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 [2018-11-28 23:41:25,514 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:25,514 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:25,514 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:25,515 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:25,515 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:25,515 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:25,516 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:25,517 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:25,517 INFO L122 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 [2018-11-28 23:41:25,518 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:25,518 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:25,518 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:25,519 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:25,527 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:41:25,527 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:41:25,634 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:41:25,708 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-28 23:41:25,709 INFO L444 ModelExtractionUtils]: 13 out of 19 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-28 23:41:25,712 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:41:25,720 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:41:25,720 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:41:25,723 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, v_rep(select #length ULTIMATE.start_main_~#str1~0.base)_1, ULTIMATE.start_main_~#str1~0.offset) = -1*ULTIMATE.start_main_~i~0 + 1*v_rep(select #length ULTIMATE.start_main_~#str1~0.base)_1 - 1*ULTIMATE.start_main_~#str1~0.offset Supporting invariants [] [2018-11-28 23:41:25,807 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-28 23:41:25,828 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 23:41:25,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:25,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:41:25,923 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:41:25,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:41:25,948 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:41:25,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:41:25,994 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 [2018-11-28 23:41:25,995 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states. Second operand 3 states. [2018-11-28 23:41:26,055 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states.. Second operand 3 states. Result 33 states and 47 transitions. Complement of second has 8 states. [2018-11-28 23:41:26,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 23:41:26,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:41:26,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2018-11-28 23:41:26,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 2 letters. Loop has 2 letters. [2018-11-28 23:41:26,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:41:26,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 4 letters. Loop has 2 letters. [2018-11-28 23:41:26,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:41:26,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 2 letters. Loop has 4 letters. [2018-11-28 23:41:26,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:41:26,065 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 47 transitions. [2018-11-28 23:41:26,069 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-28 23:41:26,075 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 14 states and 19 transitions. [2018-11-28 23:41:26,076 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-28 23:41:26,076 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-28 23:41:26,079 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2018-11-28 23:41:26,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:41:26,081 INFO L705 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2018-11-28 23:41:26,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2018-11-28 23:41:26,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-28 23:41:26,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-28 23:41:26,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2018-11-28 23:41:26,114 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2018-11-28 23:41:26,114 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2018-11-28 23:41:26,115 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 23:41:26,115 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2018-11-28 23:41:26,116 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-28 23:41:26,116 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:41:26,116 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:41:26,116 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-28 23:41:26,116 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:41:26,119 INFO L794 eck$LassoCheckResult]: Stem: 112#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 108#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem3, main_#t~post4, main_#t~post2, main_#t~mem6, main_#t~mem7, main_#t~post8, main_#t~post5, 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.alloc((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.alloc((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; 109#L16-3 assume !(main_~i~0 % 4294967296 < main_~max~0 % 4294967296); 113#L16-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); 110#L24-3 [2018-11-28 23:41:26,119 INFO L796 eck$LassoCheckResult]: Loop: 110#L24-3 assume !!(main_~i~0 >= 0);call main_#t~mem3 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem3, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem3;main_#t~post4 := main_~j~0;main_~j~0 := 1 + main_#t~post4;havoc main_#t~post4; 111#L24-2 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 110#L24-3 [2018-11-28 23:41:26,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:26,119 INFO L82 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2018-11-28 23:41:26,119 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:26,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:26,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:26,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:41:26,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:26,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:41:26,410 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 14 [2018-11-28 23:41:26,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:41:26,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:41:26,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 23:41:26,419 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:41:26,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:26,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 1 times [2018-11-28 23:41:26,420 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:26,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:26,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:26,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:41:26,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:26,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:26,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:26,544 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-11-28 23:41:26,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 23:41:26,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:41:26,605 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 8 Second operand 3 states. [2018-11-28 23:41:26,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:41:26,638 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2018-11-28 23:41:26,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 23:41:26,641 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 17 transitions. [2018-11-28 23:41:26,642 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-28 23:41:26,643 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 14 states and 16 transitions. [2018-11-28 23:41:26,643 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-28 23:41:26,643 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-28 23:41:26,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 16 transitions. [2018-11-28 23:41:26,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:41:26,644 INFO L705 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2018-11-28 23:41:26,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 16 transitions. [2018-11-28 23:41:26,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2018-11-28 23:41:26,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-28 23:41:26,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2018-11-28 23:41:26,646 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2018-11-28 23:41:26,646 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2018-11-28 23:41:26,646 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 23:41:26,646 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 15 transitions. [2018-11-28 23:41:26,647 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-28 23:41:26,647 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:41:26,647 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:41:26,650 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-28 23:41:26,650 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:41:26,651 INFO L794 eck$LassoCheckResult]: Stem: 142#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 137#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem3, main_#t~post4, main_#t~post2, main_#t~mem6, main_#t~mem7, main_#t~post8, main_#t~post5, 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.alloc((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.alloc((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; 138#L16-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 148#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 149#L16-3 assume !(main_~i~0 % 4294967296 < main_~max~0 % 4294967296); 146#L16-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); 139#L24-3 [2018-11-28 23:41:26,651 INFO L796 eck$LassoCheckResult]: Loop: 139#L24-3 assume !!(main_~i~0 >= 0);call main_#t~mem3 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem3, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem3;main_#t~post4 := main_~j~0;main_~j~0 := 1 + main_#t~post4;havoc main_#t~post4; 141#L24-2 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 139#L24-3 [2018-11-28 23:41:26,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:26,651 INFO L82 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2018-11-28 23:41:26,651 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:26,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:26,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:26,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:41:26,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:26,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:41:26,836 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 18 [2018-11-28 23:41:27,053 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 32 [2018-11-28 23:41:27,128 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:41:27,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:41:27,129 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:41:27,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:41:27,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:41:27,172 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:41:27,355 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 23 [2018-11-28 23:41:27,373 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2018-11-28 23:41:27,383 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-11-28 23:41:27,384 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:41:27,396 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:41:27,420 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-28 23:41:27,421 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 23:41:27,475 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 23:41:27,475 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:78, output treesize:28 [2018-11-28 23:41:27,563 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:41:27,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:41:27,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 8 [2018-11-28 23:41:27,583 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:41:27,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:27,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 2 times [2018-11-28 23:41:27,584 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:27,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:27,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:27,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:41:27,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:27,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:27,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:27,853 WARN L180 SmtUtils]: Spent 255.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-11-28 23:41:28,017 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-11-28 23:41:28,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 23:41:28,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-28 23:41:28,019 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. cyclomatic complexity: 5 Second operand 8 states. [2018-11-28 23:41:28,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:41:28,346 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2018-11-28 23:41:28,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 23:41:28,346 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 18 transitions. [2018-11-28 23:41:28,348 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-28 23:41:28,348 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 18 transitions. [2018-11-28 23:41:28,348 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-28 23:41:28,348 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-28 23:41:28,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 18 transitions. [2018-11-28 23:41:28,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:41:28,349 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2018-11-28 23:41:28,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 18 transitions. [2018-11-28 23:41:28,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-11-28 23:41:28,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-28 23:41:28,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2018-11-28 23:41:28,351 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2018-11-28 23:41:28,352 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2018-11-28 23:41:28,352 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 23:41:28,352 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 17 transitions. [2018-11-28 23:41:28,353 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-28 23:41:28,353 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:41:28,353 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:41:28,353 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2018-11-28 23:41:28,354 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:41:28,354 INFO L794 eck$LassoCheckResult]: Stem: 197#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 192#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem3, main_#t~post4, main_#t~post2, main_#t~mem6, main_#t~mem7, main_#t~post8, main_#t~post5, 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.alloc((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.alloc((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; 193#L16-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 203#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 204#L16-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 205#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 206#L16-3 assume !(main_~i~0 % 4294967296 < main_~max~0 % 4294967296); 200#L16-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); 194#L24-3 [2018-11-28 23:41:28,354 INFO L796 eck$LassoCheckResult]: Loop: 194#L24-3 assume !!(main_~i~0 >= 0);call main_#t~mem3 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem3, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem3;main_#t~post4 := main_~j~0;main_~j~0 := 1 + main_#t~post4;havoc main_#t~post4; 196#L24-2 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 194#L24-3 [2018-11-28 23:41:28,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:28,354 INFO L82 PathProgramCache]: Analyzing trace with hash 265236367, now seen corresponding path program 2 times [2018-11-28 23:41:28,354 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:28,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:28,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:28,356 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:41:28,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:28,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:41:28,596 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 18 [2018-11-28 23:41:28,911 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:41:28,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:41:28,911 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:41:28,921 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 23:41:28,936 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 23:41:28,936 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:41:28,937 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:41:29,103 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:41:29,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:41:29,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 10 [2018-11-28 23:41:29,125 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:41:29,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:29,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 3 times [2018-11-28 23:41:29,125 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:29,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:29,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:29,126 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:41:29,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:29,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:29,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:29,242 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-11-28 23:41:29,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 23:41:29,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-28 23:41:29,327 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. cyclomatic complexity: 5 Second operand 10 states. [2018-11-28 23:41:29,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:41:29,489 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2018-11-28 23:41:29,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 23:41:29,491 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 20 transitions. [2018-11-28 23:41:29,493 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-28 23:41:29,494 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 20 transitions. [2018-11-28 23:41:29,494 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-28 23:41:29,494 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-28 23:41:29,494 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 20 transitions. [2018-11-28 23:41:29,494 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:41:29,494 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2018-11-28 23:41:29,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 20 transitions. [2018-11-28 23:41:29,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-11-28 23:41:29,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-28 23:41:29,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2018-11-28 23:41:29,497 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-11-28 23:41:29,497 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-11-28 23:41:29,497 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 23:41:29,497 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 19 transitions. [2018-11-28 23:41:29,498 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-28 23:41:29,498 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:41:29,498 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:41:29,499 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1] [2018-11-28 23:41:29,499 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:41:29,499 INFO L794 eck$LassoCheckResult]: Stem: 266#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 261#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem3, main_#t~post4, main_#t~post2, main_#t~mem6, main_#t~mem7, main_#t~post8, main_#t~post5, 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.alloc((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.alloc((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; 262#L16-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 272#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 277#L16-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 275#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 273#L16-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 274#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 276#L16-3 assume !(main_~i~0 % 4294967296 < main_~max~0 % 4294967296); 270#L16-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); 263#L24-3 [2018-11-28 23:41:29,499 INFO L796 eck$LassoCheckResult]: Loop: 263#L24-3 assume !!(main_~i~0 >= 0);call main_#t~mem3 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem3, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem3;main_#t~post4 := main_~j~0;main_~j~0 := 1 + main_#t~post4;havoc main_#t~post4; 265#L24-2 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 263#L24-3 [2018-11-28 23:41:29,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:29,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1489134225, now seen corresponding path program 3 times [2018-11-28 23:41:29,499 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:29,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:29,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:29,500 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:41:29,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:29,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:41:29,739 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 18 [2018-11-28 23:41:30,237 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 32 [2018-11-28 23:41:30,323 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:41:30,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:41:30,323 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:41:30,336 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 23:41:30,368 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-28 23:41:30,368 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:41:30,370 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:41:30,436 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2018-11-28 23:41:30,440 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-11-28 23:41:30,441 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:41:30,490 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:41:30,517 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-28 23:41:30,518 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 23:41:30,530 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 23:41:30,531 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:78, output treesize:28 [2018-11-28 23:41:30,664 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:41:30,685 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:41:30,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 12 [2018-11-28 23:41:30,685 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:41:30,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:30,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 4 times [2018-11-28 23:41:30,686 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:30,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:30,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:30,687 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:41:30,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:30,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:30,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:30,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 23:41:30,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-11-28 23:41:30,822 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. cyclomatic complexity: 5 Second operand 12 states. [2018-11-28 23:41:31,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:41:31,105 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2018-11-28 23:41:31,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 23:41:31,106 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 22 transitions. [2018-11-28 23:41:31,108 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-28 23:41:31,109 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 22 transitions. [2018-11-28 23:41:31,109 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-28 23:41:31,109 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-28 23:41:31,109 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 22 transitions. [2018-11-28 23:41:31,109 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:41:31,110 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2018-11-28 23:41:31,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 22 transitions. [2018-11-28 23:41:31,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2018-11-28 23:41:31,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-28 23:41:31,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2018-11-28 23:41:31,114 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2018-11-28 23:41:31,114 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2018-11-28 23:41:31,114 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 23:41:31,114 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 21 transitions. [2018-11-28 23:41:31,115 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-28 23:41:31,115 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:41:31,115 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:41:31,115 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2018-11-28 23:41:31,117 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:41:31,117 INFO L794 eck$LassoCheckResult]: Stem: 345#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 340#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem3, main_#t~post4, main_#t~post2, main_#t~mem6, main_#t~mem7, main_#t~post8, main_#t~post5, 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.alloc((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.alloc((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; 341#L16-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 351#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 352#L16-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 353#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 354#L16-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 358#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 357#L16-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 356#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 355#L16-3 assume !(main_~i~0 % 4294967296 < main_~max~0 % 4294967296); 348#L16-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); 342#L24-3 [2018-11-28 23:41:31,117 INFO L796 eck$LassoCheckResult]: Loop: 342#L24-3 assume !!(main_~i~0 >= 0);call main_#t~mem3 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem3, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem3;main_#t~post4 := main_~j~0;main_~j~0 := 1 + main_#t~post4;havoc main_#t~post4; 344#L24-2 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 342#L24-3 [2018-11-28 23:41:31,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:31,117 INFO L82 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 4 times [2018-11-28 23:41:31,117 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:31,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:31,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:31,118 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:41:31,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:31,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:41:31,296 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:41:31,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:41:31,297 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:41:31,307 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-28 23:41:31,330 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-28 23:41:31,330 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:41:31,332 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:41:31,438 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2018-11-28 23:41:31,456 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-11-28 23:41:31,456 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:41:31,464 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:41:31,481 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-28 23:41:31,482 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 23:41:31,530 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 23:41:31,531 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:78, output treesize:28 [2018-11-28 23:41:31,851 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:41:31,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:41:31,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2018-11-28 23:41:31,870 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:41:31,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:31,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 5 times [2018-11-28 23:41:31,871 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:31,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:31,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:31,872 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:41:31,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:31,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:31,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:31,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-28 23:41:31,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-11-28 23:41:31,972 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. cyclomatic complexity: 5 Second operand 13 states. [2018-11-28 23:41:32,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:41:32,199 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2018-11-28 23:41:32,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 23:41:32,200 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 24 transitions. [2018-11-28 23:41:32,201 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-28 23:41:32,202 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 24 transitions. [2018-11-28 23:41:32,203 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-28 23:41:32,203 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-28 23:41:32,203 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 24 transitions. [2018-11-28 23:41:32,203 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:41:32,204 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2018-11-28 23:41:32,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 24 transitions. [2018-11-28 23:41:32,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-11-28 23:41:32,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-28 23:41:32,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2018-11-28 23:41:32,208 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 23 transitions. [2018-11-28 23:41:32,208 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 23 transitions. [2018-11-28 23:41:32,208 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-28 23:41:32,208 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 23 transitions. [2018-11-28 23:41:32,209 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-28 23:41:32,209 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:41:32,209 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:41:32,212 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1] [2018-11-28 23:41:32,212 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:41:32,212 INFO L794 eck$LassoCheckResult]: Stem: 435#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 430#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem3, main_#t~post4, main_#t~post2, main_#t~mem6, main_#t~mem7, main_#t~post8, main_#t~post5, 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.alloc((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.alloc((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; 431#L16-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 441#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 442#L16-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 443#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 444#L16-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 450#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 449#L16-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 448#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 447#L16-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 446#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 445#L16-3 assume !(main_~i~0 % 4294967296 < main_~max~0 % 4294967296); 438#L16-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); 432#L24-3 [2018-11-28 23:41:32,212 INFO L796 eck$LassoCheckResult]: Loop: 432#L24-3 assume !!(main_~i~0 >= 0);call main_#t~mem3 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem3, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem3;main_#t~post4 := main_~j~0;main_~j~0 := 1 + main_#t~post4;havoc main_#t~post4; 434#L24-2 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 432#L24-3 [2018-11-28 23:41:32,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:32,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1745699051, now seen corresponding path program 5 times [2018-11-28 23:41:32,213 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:32,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:32,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:32,214 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:41:32,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:32,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:32,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:32,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:32,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 6 times [2018-11-28 23:41:32,245 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:32,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:32,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:32,246 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:41:32,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:32,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:32,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:32,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:32,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1715425495, now seen corresponding path program 1 times [2018-11-28 23:41:32,255 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:32,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:32,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:32,256 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:41:32,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:32,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:32,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:32,553 WARN L180 SmtUtils]: Spent 255.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-11-28 23:41:32,806 WARN L180 SmtUtils]: Spent 253.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-11-28 23:41:34,081 WARN L180 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 147 DAG size of output: 118 [2018-11-28 23:41:34,399 WARN L180 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 75 [2018-11-28 23:41:34,402 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:41:34,403 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:41:34,403 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:41:34,403 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:41:34,403 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:41:34,403 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:41:34,403 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:41:34,403 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:41:34,404 INFO L131 ssoRankerPreferences]: Filename of dumped script: invert_string_true-unreach-call_true-termination.i_Iteration7_Lasso [2018-11-28 23:41:34,404 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:41:34,404 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:41:34,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:34,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:34,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:34,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:34,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:34,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:34,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:34,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:34,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:34,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:34,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:34,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:34,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:34,848 WARN L180 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2018-11-28 23:41:35,117 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-11-28 23:41:35,210 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:41:35,210 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:41:35,211 INFO L122 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 [2018-11-28 23:41:35,213 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:35,214 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:35,214 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:35,214 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:35,214 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:35,215 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:35,215 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:35,215 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:35,216 INFO L122 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 [2018-11-28 23:41:35,218 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:35,218 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:35,219 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:35,219 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:35,219 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:35,219 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:35,219 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:35,220 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:35,221 INFO L122 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 [2018-11-28 23:41:35,221 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:35,221 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:35,221 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:35,221 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:35,223 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:41:35,223 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:41:35,226 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:35,227 INFO L122 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 [2018-11-28 23:41:35,227 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:35,227 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:35,228 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:35,228 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:35,231 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:41:35,232 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:41:35,247 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:41:35,269 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-28 23:41:35,269 INFO L444 ModelExtractionUtils]: 18 out of 25 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:41:35,269 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:41:35,270 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-11-28 23:41:35,271 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:41:35,271 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~#str2~0.offset, ULTIMATE.start_main_~j~0) = -2*ULTIMATE.start_main_~#str2~0.offset - 2*ULTIMATE.start_main_~j~0 + 8589934589 Supporting invariants [-1*v_rep(select #length ULTIMATE.start_main_~#str2~0.base)_2 + 4294967295 >= 0] [2018-11-28 23:41:35,357 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2018-11-28 23:41:35,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:35,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:41:35,414 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:41:35,418 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2018-11-28 23:41:35,435 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-11-28 23:41:35,435 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:41:35,537 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:41:35,610 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2018-11-28 23:41:35,615 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-11-28 23:41:35,615 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 23:41:35,624 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:41:35,649 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-11-28 23:41:35,649 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:46, output treesize:48 [2018-11-28 23:41:40,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:41:40,109 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:41:40,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:41:40,151 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-28 23:41:40,151 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 23 transitions. cyclomatic complexity: 5 Second operand 4 states. [2018-11-28 23:41:40,238 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 23 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 25 states and 29 transitions. Complement of second has 6 states. [2018-11-28 23:41:40,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:41:40,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:41:40,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2018-11-28 23:41:40,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 14 letters. Loop has 2 letters. [2018-11-28 23:41:40,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:41:40,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 16 letters. Loop has 2 letters. [2018-11-28 23:41:40,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:41:40,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 14 letters. Loop has 4 letters. [2018-11-28 23:41:40,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:41:40,245 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 29 transitions. [2018-11-28 23:41:40,246 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:41:40,246 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 24 states and 27 transitions. [2018-11-28 23:41:40,246 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-28 23:41:40,247 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-28 23:41:40,247 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 27 transitions. [2018-11-28 23:41:40,247 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:41:40,247 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2018-11-28 23:41:40,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 27 transitions. [2018-11-28 23:41:40,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2018-11-28 23:41:40,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-28 23:41:40,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2018-11-28 23:41:40,250 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 26 transitions. [2018-11-28 23:41:40,250 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 26 transitions. [2018-11-28 23:41:40,250 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-28 23:41:40,250 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 26 transitions. [2018-11-28 23:41:40,251 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:41:40,251 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:41:40,251 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:41:40,251 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1] [2018-11-28 23:41:40,251 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 23:41:40,252 INFO L794 eck$LassoCheckResult]: Stem: 575#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 569#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem3, main_#t~post4, main_#t~post2, main_#t~mem6, main_#t~mem7, main_#t~post8, main_#t~post5, 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.alloc((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.alloc((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; 570#L16-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 582#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 583#L16-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 584#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 585#L16-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 591#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 590#L16-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 589#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 588#L16-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 587#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 586#L16-3 assume !(main_~i~0 % 4294967296 < main_~max~0 % 4294967296); 578#L16-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); 579#L24-3 assume !(main_~i~0 >= 0); 572#L24-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; 576#L30-3 [2018-11-28 23:41:40,252 INFO L796 eck$LassoCheckResult]: Loop: 576#L30-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call main_#t~mem6 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call main_#t~mem7 := read~int(main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);__VERIFIER_assert_#in~cond := (if main_#t~mem6 == main_#t~mem7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 577#L4 assume !(0 == __VERIFIER_assert_~cond); 581#L4-2 havoc main_#t~mem6;havoc main_#t~mem7;main_#t~post8 := main_~j~0;main_~j~0 := main_#t~post8 - 1;havoc main_#t~post8; 580#L30-2 main_#t~post5 := main_~i~0;main_~i~0 := 1 + main_#t~post5;havoc main_#t~post5; 576#L30-3 [2018-11-28 23:41:40,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:40,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1715425437, now seen corresponding path program 1 times [2018-11-28 23:41:40,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:40,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:40,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:40,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:41:40,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:40,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:41:40,394 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-28 23:41:40,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:41:40,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 23:41:40,395 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:41:40,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:40,395 INFO L82 PathProgramCache]: Analyzing trace with hash 2100362, now seen corresponding path program 1 times [2018-11-28 23:41:40,395 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:40,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:40,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:40,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:41:40,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:40,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:40,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:40,766 WARN L180 SmtUtils]: Spent 356.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2018-11-28 23:41:41,436 WARN L180 SmtUtils]: Spent 669.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2018-11-28 23:41:41,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 23:41:41,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 23:41:41,438 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. cyclomatic complexity: 6 Second operand 4 states. [2018-11-28 23:41:41,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:41:41,471 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2018-11-28 23:41:41,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 23:41:41,472 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 25 transitions. [2018-11-28 23:41:41,473 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:41:41,473 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 25 transitions. [2018-11-28 23:41:41,474 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-28 23:41:41,474 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-28 23:41:41,474 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 25 transitions. [2018-11-28 23:41:41,474 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:41:41,474 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 25 transitions. [2018-11-28 23:41:41,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 25 transitions. [2018-11-28 23:41:41,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-28 23:41:41,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-28 23:41:41,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2018-11-28 23:41:41,478 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 25 transitions. [2018-11-28 23:41:41,478 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 25 transitions. [2018-11-28 23:41:41,478 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-28 23:41:41,478 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 25 transitions. [2018-11-28 23:41:41,479 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:41:41,479 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:41:41,479 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:41:41,479 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:41:41,480 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 23:41:41,480 INFO L794 eck$LassoCheckResult]: Stem: 629#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 624#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem3, main_#t~post4, main_#t~post2, main_#t~mem6, main_#t~mem7, main_#t~post8, main_#t~post5, 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.alloc((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.alloc((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; 625#L16-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 636#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 637#L16-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 638#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 639#L16-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 646#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 645#L16-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 644#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 643#L16-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 642#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 641#L16-3 assume !(main_~i~0 % 4294967296 < main_~max~0 % 4294967296); 633#L16-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); 626#L24-3 assume !!(main_~i~0 >= 0);call main_#t~mem3 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem3, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem3;main_#t~post4 := main_~j~0;main_~j~0 := 1 + main_#t~post4;havoc main_#t~post4; 627#L24-2 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 632#L24-3 assume !(main_~i~0 >= 0); 640#L24-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; 630#L30-3 [2018-11-28 23:41:41,481 INFO L796 eck$LassoCheckResult]: Loop: 630#L30-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call main_#t~mem6 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call main_#t~mem7 := read~int(main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);__VERIFIER_assert_#in~cond := (if main_#t~mem6 == main_#t~mem7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 631#L4 assume !(0 == __VERIFIER_assert_~cond); 635#L4-2 havoc main_#t~mem6;havoc main_#t~mem7;main_#t~post8 := main_~j~0;main_~j~0 := main_#t~post8 - 1;havoc main_#t~post8; 634#L30-2 main_#t~post5 := main_~i~0;main_~i~0 := 1 + main_#t~post5;havoc main_#t~post5; 630#L30-3 [2018-11-28 23:41:41,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:41,481 INFO L82 PathProgramCache]: Analyzing trace with hash -743540257, now seen corresponding path program 1 times [2018-11-28 23:41:41,481 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:41,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:41,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:41,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:41:41,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:41,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:41:41,902 WARN L180 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 13 [2018-11-28 23:41:41,912 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-28 23:41:41,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:41:41,913 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:41:41,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:41:41,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:41:41,961 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:41:42,162 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-28 23:41:42,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:41:42,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-28 23:41:42,184 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:41:42,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:42,185 INFO L82 PathProgramCache]: Analyzing trace with hash 2100362, now seen corresponding path program 2 times [2018-11-28 23:41:42,185 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:42,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:42,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:42,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:41:42,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:42,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:42,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:42,523 WARN L180 SmtUtils]: Spent 315.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2018-11-28 23:41:42,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 23:41:42,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-28 23:41:42,618 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. cyclomatic complexity: 5 Second operand 8 states. [2018-11-28 23:41:42,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:41:42,764 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2018-11-28 23:41:42,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 23:41:42,765 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 30 transitions. [2018-11-28 23:41:42,766 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:41:42,767 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 26 states and 29 transitions. [2018-11-28 23:41:42,767 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-28 23:41:42,767 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-28 23:41:42,767 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 29 transitions. [2018-11-28 23:41:42,767 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:41:42,767 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 29 transitions. [2018-11-28 23:41:42,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 29 transitions. [2018-11-28 23:41:42,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2018-11-28 23:41:42,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-28 23:41:42,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2018-11-28 23:41:42,772 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2018-11-28 23:41:42,772 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2018-11-28 23:41:42,772 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-28 23:41:42,773 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 26 transitions. [2018-11-28 23:41:42,773 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:41:42,773 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:41:42,773 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:41:42,776 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1] [2018-11-28 23:41:42,777 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 23:41:42,777 INFO L794 eck$LassoCheckResult]: Stem: 746#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 740#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem3, main_#t~post4, main_#t~post2, main_#t~mem6, main_#t~mem7, main_#t~post8, main_#t~post5, 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.alloc((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.alloc((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; 741#L16-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 752#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 753#L16-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 754#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 755#L16-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 763#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 762#L16-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 761#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 760#L16-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 758#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 757#L16-3 assume !(main_~i~0 % 4294967296 < main_~max~0 % 4294967296); 749#L16-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); 742#L24-3 assume !!(main_~i~0 >= 0);call main_#t~mem3 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem3, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem3;main_#t~post4 := main_~j~0;main_~j~0 := 1 + main_#t~post4;havoc main_#t~post4; 743#L24-2 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 744#L24-3 assume !!(main_~i~0 >= 0);call main_#t~mem3 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem3, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem3;main_#t~post4 := main_~j~0;main_~j~0 := 1 + main_#t~post4;havoc main_#t~post4; 745#L24-2 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 759#L24-3 assume !(main_~i~0 >= 0); 756#L24-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; 747#L30-3 [2018-11-28 23:41:42,777 INFO L796 eck$LassoCheckResult]: Loop: 747#L30-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call main_#t~mem6 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call main_#t~mem7 := read~int(main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);__VERIFIER_assert_#in~cond := (if main_#t~mem6 == main_#t~mem7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 748#L4 assume !(0 == __VERIFIER_assert_~cond); 751#L4-2 havoc main_#t~mem6;havoc main_#t~mem7;main_#t~post8 := main_~j~0;main_~j~0 := main_#t~post8 - 1;havoc main_#t~post8; 750#L30-2 main_#t~post5 := main_~i~0;main_~i~0 := 1 + main_#t~post5;havoc main_#t~post5; 747#L30-3 [2018-11-28 23:41:42,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:42,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1577559391, now seen corresponding path program 2 times [2018-11-28 23:41:42,778 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:42,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:42,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:42,778 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:41:42,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:42,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:41:43,053 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-28 23:41:43,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:41:43,053 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:41:43,068 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 23:41:43,091 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 23:41:43,092 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:41:43,094 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:41:43,233 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-28 23:41:43,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:41:43,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2018-11-28 23:41:43,254 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:41:43,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:43,254 INFO L82 PathProgramCache]: Analyzing trace with hash 2100362, now seen corresponding path program 3 times [2018-11-28 23:41:43,254 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:43,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:43,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:43,255 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:41:43,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:43,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:43,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:43,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 23:41:43,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-11-28 23:41:43,422 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. cyclomatic complexity: 5 Second operand 11 states. [2018-11-28 23:41:43,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:41:43,569 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2018-11-28 23:41:43,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 23:41:43,571 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 32 transitions. [2018-11-28 23:41:43,572 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:41:43,572 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 28 states and 31 transitions. [2018-11-28 23:41:43,572 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-28 23:41:43,572 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-28 23:41:43,572 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 31 transitions. [2018-11-28 23:41:43,573 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:41:43,573 INFO L705 BuchiCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-11-28 23:41:43,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 31 transitions. [2018-11-28 23:41:43,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2018-11-28 23:41:43,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-28 23:41:43,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-11-28 23:41:43,577 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-11-28 23:41:43,577 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-11-28 23:41:43,577 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-28 23:41:43,577 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 28 transitions. [2018-11-28 23:41:43,579 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:41:43,579 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:41:43,580 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:41:43,580 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 3, 3, 1, 1, 1, 1, 1, 1] [2018-11-28 23:41:43,580 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 23:41:43,581 INFO L794 eck$LassoCheckResult]: Stem: 878#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 872#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem3, main_#t~post4, main_#t~post2, main_#t~mem6, main_#t~mem7, main_#t~post8, main_#t~post5, 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.alloc((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.alloc((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; 873#L16-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 885#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 886#L16-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 887#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 897#L16-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 896#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 895#L16-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 894#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 893#L16-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 890#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 889#L16-3 assume !(main_~i~0 % 4294967296 < main_~max~0 % 4294967296); 882#L16-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); 874#L24-3 assume !!(main_~i~0 >= 0);call main_#t~mem3 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem3, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem3;main_#t~post4 := main_~j~0;main_~j~0 := 1 + main_#t~post4;havoc main_#t~post4; 875#L24-2 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 876#L24-3 assume !!(main_~i~0 >= 0);call main_#t~mem3 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem3, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem3;main_#t~post4 := main_~j~0;main_~j~0 := 1 + main_#t~post4;havoc main_#t~post4; 877#L24-2 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 881#L24-3 assume !!(main_~i~0 >= 0);call main_#t~mem3 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem3, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem3;main_#t~post4 := main_~j~0;main_~j~0 := 1 + main_#t~post4;havoc main_#t~post4; 892#L24-2 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 891#L24-3 assume !(main_~i~0 >= 0); 888#L24-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; 879#L30-3 [2018-11-28 23:41:43,581 INFO L796 eck$LassoCheckResult]: Loop: 879#L30-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call main_#t~mem6 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call main_#t~mem7 := read~int(main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);__VERIFIER_assert_#in~cond := (if main_#t~mem6 == main_#t~mem7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 880#L4 assume !(0 == __VERIFIER_assert_~cond); 884#L4-2 havoc main_#t~mem6;havoc main_#t~mem7;main_#t~post8 := main_~j~0;main_~j~0 := main_#t~post8 - 1;havoc main_#t~post8; 883#L30-2 main_#t~post5 := main_~i~0;main_~i~0 := 1 + main_#t~post5;havoc main_#t~post5; 879#L30-3 [2018-11-28 23:41:43,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:43,582 INFO L82 PathProgramCache]: Analyzing trace with hash 88937187, now seen corresponding path program 3 times [2018-11-28 23:41:43,582 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:43,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:43,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:43,582 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:41:43,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:43,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:41:43,865 WARN L180 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2018-11-28 23:41:44,065 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 17 [2018-11-28 23:41:44,239 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-28 23:41:44,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:41:44,240 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:41:44,250 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 23:41:44,279 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-28 23:41:44,279 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:41:44,283 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:41:44,371 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-28 23:41:44,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:41:44,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2018-11-28 23:41:44,391 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:41:44,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:44,391 INFO L82 PathProgramCache]: Analyzing trace with hash 2100362, now seen corresponding path program 4 times [2018-11-28 23:41:44,391 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:44,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:44,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:44,392 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:41:44,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:44,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:44,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:44,677 WARN L180 SmtUtils]: Spent 274.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2018-11-28 23:41:44,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-28 23:41:44,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-11-28 23:41:44,768 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. cyclomatic complexity: 5 Second operand 13 states. [2018-11-28 23:41:45,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:41:45,153 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2018-11-28 23:41:45,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 23:41:45,156 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 34 transitions. [2018-11-28 23:41:45,157 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:41:45,158 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 30 states and 33 transitions. [2018-11-28 23:41:45,158 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-28 23:41:45,160 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-28 23:41:45,160 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 33 transitions. [2018-11-28 23:41:45,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:41:45,160 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 33 transitions. [2018-11-28 23:41:45,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 33 transitions. [2018-11-28 23:41:45,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2018-11-28 23:41:45,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-28 23:41:45,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2018-11-28 23:41:45,165 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 30 transitions. [2018-11-28 23:41:45,165 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 30 transitions. [2018-11-28 23:41:45,165 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-28 23:41:45,165 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 30 transitions. [2018-11-28 23:41:45,168 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:41:45,168 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:41:45,168 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:41:45,169 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 1, 1, 1, 1, 1, 1] [2018-11-28 23:41:45,169 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 23:41:45,169 INFO L794 eck$LassoCheckResult]: Stem: 1024#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1018#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem3, main_#t~post4, main_#t~post2, main_#t~mem6, main_#t~mem7, main_#t~post8, main_#t~post5, 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.alloc((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.alloc((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; 1019#L16-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1032#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1033#L16-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1034#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1044#L16-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1043#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1042#L16-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1041#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1040#L16-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1037#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1036#L16-3 assume !(main_~i~0 % 4294967296 < main_~max~0 % 4294967296); 1029#L16-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); 1020#L24-3 assume !!(main_~i~0 >= 0);call main_#t~mem3 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem3, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem3;main_#t~post4 := main_~j~0;main_~j~0 := 1 + main_#t~post4;havoc main_#t~post4; 1021#L24-2 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 1022#L24-3 assume !!(main_~i~0 >= 0);call main_#t~mem3 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem3, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem3;main_#t~post4 := main_~j~0;main_~j~0 := 1 + main_#t~post4;havoc main_#t~post4; 1023#L24-2 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 1045#L24-3 assume !!(main_~i~0 >= 0);call main_#t~mem3 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem3, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem3;main_#t~post4 := main_~j~0;main_~j~0 := 1 + main_#t~post4;havoc main_#t~post4; 1027#L24-2 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 1028#L24-3 assume !!(main_~i~0 >= 0);call main_#t~mem3 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem3, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem3;main_#t~post4 := main_~j~0;main_~j~0 := 1 + main_#t~post4;havoc main_#t~post4; 1039#L24-2 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 1038#L24-3 assume !(main_~i~0 >= 0); 1035#L24-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; 1025#L30-3 [2018-11-28 23:41:45,171 INFO L796 eck$LassoCheckResult]: Loop: 1025#L30-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call main_#t~mem6 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call main_#t~mem7 := read~int(main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);__VERIFIER_assert_#in~cond := (if main_#t~mem6 == main_#t~mem7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1026#L4 assume !(0 == __VERIFIER_assert_~cond); 1031#L4-2 havoc main_#t~mem6;havoc main_#t~mem7;main_#t~post8 := main_~j~0;main_~j~0 := main_#t~post8 - 1;havoc main_#t~post8; 1030#L30-2 main_#t~post5 := main_~i~0;main_~i~0 := 1 + main_#t~post5;havoc main_#t~post5; 1025#L30-3 [2018-11-28 23:41:45,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:45,172 INFO L82 PathProgramCache]: Analyzing trace with hash -430652763, now seen corresponding path program 4 times [2018-11-28 23:41:45,172 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:45,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:45,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:45,173 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:41:45,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:45,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:41:45,392 WARN L180 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2018-11-28 23:41:45,639 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-28 23:41:45,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:41:45,639 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:41:45,649 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-28 23:41:45,699 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-28 23:41:45,699 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:41:45,703 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:41:45,815 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-28 23:41:45,836 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:41:45,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-11-28 23:41:45,837 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:41:45,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:45,838 INFO L82 PathProgramCache]: Analyzing trace with hash 2100362, now seen corresponding path program 5 times [2018-11-28 23:41:45,838 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:45,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:45,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:45,839 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:41:45,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:45,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:45,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:46,008 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2018-11-28 23:41:46,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-28 23:41:46,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2018-11-28 23:41:46,009 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. cyclomatic complexity: 5 Second operand 16 states. [2018-11-28 23:41:46,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:41:46,731 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2018-11-28 23:41:46,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 23:41:46,733 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 50 transitions. [2018-11-28 23:41:46,735 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:41:46,736 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 47 states and 49 transitions. [2018-11-28 23:41:46,737 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-11-28 23:41:46,737 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2018-11-28 23:41:46,737 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 49 transitions. [2018-11-28 23:41:46,737 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:41:46,737 INFO L705 BuchiCegarLoop]: Abstraction has 47 states and 49 transitions. [2018-11-28 23:41:46,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 49 transitions. [2018-11-28 23:41:46,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 30. [2018-11-28 23:41:46,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-28 23:41:46,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2018-11-28 23:41:46,740 INFO L728 BuchiCegarLoop]: Abstraction has 30 states and 32 transitions. [2018-11-28 23:41:46,740 INFO L608 BuchiCegarLoop]: Abstraction has 30 states and 32 transitions. [2018-11-28 23:41:46,740 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-28 23:41:46,740 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 32 transitions. [2018-11-28 23:41:46,742 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:41:46,742 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:41:46,742 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:41:46,743 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2018-11-28 23:41:46,743 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 23:41:46,743 INFO L794 eck$LassoCheckResult]: Stem: 1210#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1204#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem3, main_#t~post4, main_#t~post2, main_#t~mem6, main_#t~mem7, main_#t~post8, main_#t~post5, 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.alloc((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.alloc((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#L16-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1216#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1217#L16-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1218#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1229#L16-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1228#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1227#L16-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1226#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1225#L16-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1221#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1220#L16-3 assume !(main_~i~0 % 4294967296 < main_~max~0 % 4294967296); 1213#L16-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); 1206#L24-3 assume !!(main_~i~0 >= 0);call main_#t~mem3 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem3, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem3;main_#t~post4 := main_~j~0;main_~j~0 := 1 + main_#t~post4;havoc main_#t~post4; 1207#L24-2 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 1208#L24-3 assume !!(main_~i~0 >= 0);call main_#t~mem3 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem3, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem3;main_#t~post4 := main_~j~0;main_~j~0 := 1 + main_#t~post4;havoc main_#t~post4; 1209#L24-2 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 1233#L24-3 assume !!(main_~i~0 >= 0);call main_#t~mem3 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem3, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem3;main_#t~post4 := main_~j~0;main_~j~0 := 1 + main_#t~post4;havoc main_#t~post4; 1232#L24-2 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 1231#L24-3 assume !!(main_~i~0 >= 0);call main_#t~mem3 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem3, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem3;main_#t~post4 := main_~j~0;main_~j~0 := 1 + main_#t~post4;havoc main_#t~post4; 1230#L24-2 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 1224#L24-3 assume !!(main_~i~0 >= 0);call main_#t~mem3 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem3, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem3;main_#t~post4 := main_~j~0;main_~j~0 := 1 + main_#t~post4;havoc main_#t~post4; 1223#L24-2 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 1222#L24-3 assume !(main_~i~0 >= 0); 1219#L24-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#L30-3 [2018-11-28 23:41:46,743 INFO L796 eck$LassoCheckResult]: Loop: 1211#L30-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call main_#t~mem6 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call main_#t~mem7 := read~int(main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);__VERIFIER_assert_#in~cond := (if main_#t~mem6 == main_#t~mem7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1212#L4 assume !(0 == __VERIFIER_assert_~cond); 1215#L4-2 havoc main_#t~mem6;havoc main_#t~mem7;main_#t~post8 := main_~j~0;main_~j~0 := main_#t~post8 - 1;havoc main_#t~post8; 1214#L30-2 main_#t~post5 := main_~i~0;main_~i~0 := 1 + main_#t~post5;havoc main_#t~post5; 1211#L30-3 [2018-11-28 23:41:46,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:46,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1540388377, now seen corresponding path program 5 times [2018-11-28 23:41:46,744 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:46,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:46,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:46,745 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:41:46,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:46,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:46,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:46,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:46,798 INFO L82 PathProgramCache]: Analyzing trace with hash 2100362, now seen corresponding path program 6 times [2018-11-28 23:41:46,798 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:46,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:46,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:46,799 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:41:46,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:46,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:46,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:46,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:46,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1945357456, now seen corresponding path program 1 times [2018-11-28 23:41:46,809 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:46,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:46,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:46,810 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:41:46,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:46,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:46,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:47,228 WARN L180 SmtUtils]: Spent 364.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2018-11-28 23:41:47,412 WARN L180 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2018-11-28 23:42:03,098 WARN L180 SmtUtils]: Spent 15.68 s on a formula simplification. DAG size of input: 266 DAG size of output: 205 [2018-11-28 23:42:05,953 WARN L180 SmtUtils]: Spent 2.82 s on a formula simplification. DAG size of input: 167 DAG size of output: 122 [2018-11-28 23:42:05,962 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:42:05,962 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:42:05,962 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:42:05,962 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:42:05,962 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:42:05,962 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:42:05,962 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:42:05,962 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:42:05,962 INFO L131 ssoRankerPreferences]: Filename of dumped script: invert_string_true-unreach-call_true-termination.i_Iteration13_Lasso [2018-11-28 23:42:05,963 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:42:05,963 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:42:05,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:05,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:05,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:05,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:05,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:05,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:05,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:05,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:05,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:05,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:05,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:06,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:06,422 FATAL L292 ToolchainWalker]: 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.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.replaceSelectStoreTerm(MapEliminator.java:592) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.replaceStoreTerms(MapEliminator.java:542) at de.uni_freiburg.informatik.ultimate.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:286) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:235) 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:958) 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:476) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:384) 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:316) 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) [2018-11-28 23:42:06,425 INFO L168 Benchmark]: Toolchain (without parser) took 44384.45 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 297.8 MB). Free memory was 951.3 MB in the beginning and 1.0 GB in the end (delta: -56.9 MB). Peak memory consumption was 240.9 MB. Max. memory is 11.5 GB. [2018-11-28 23:42:06,426 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:42:06,427 INFO L168 Benchmark]: CACSL2BoogieTranslator took 390.12 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-28 23:42:06,428 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.87 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:42:06,428 INFO L168 Benchmark]: Boogie Preprocessor took 41.24 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-28 23:42:06,429 INFO L168 Benchmark]: RCFGBuilder took 588.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.7 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -159.4 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2018-11-28 23:42:06,430 INFO L168 Benchmark]: BuchiAutomizer took 43299.37 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 174.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 86.3 MB). Peak memory consumption was 260.4 MB. Max. memory is 11.5 GB. [2018-11-28 23:42:06,434 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 390.12 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 59.87 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.24 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 588.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.7 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -159.4 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 43299.37 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 174.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 86.3 MB). Peak memory consumption was 260.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * 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.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...