java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInlineTransformed.xml --icfgtransformation.transformationtype MAP_ELIMINATION_MONNIAUX -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/array.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-48de6b2 [2019-04-26 16:09:53,598 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-04-26 16:09:53,600 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-04-26 16:09:53,615 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-04-26 16:09:53,615 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-04-26 16:09:53,618 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-04-26 16:09:53,620 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-04-26 16:09:53,623 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-04-26 16:09:53,626 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-04-26 16:09:53,628 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-04-26 16:09:53,629 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-04-26 16:09:53,629 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-04-26 16:09:53,632 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-04-26 16:09:53,633 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-04-26 16:09:53,634 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-04-26 16:09:53,635 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-04-26 16:09:53,636 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-04-26 16:09:53,645 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-04-26 16:09:53,649 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-04-26 16:09:53,653 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-04-26 16:09:53,654 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-04-26 16:09:53,657 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-04-26 16:09:53,661 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-04-26 16:09:53,662 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-04-26 16:09:53,662 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-04-26 16:09:53,663 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-04-26 16:09:53,663 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-04-26 16:09:53,667 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-04-26 16:09:53,667 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-04-26 16:09:53,668 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-04-26 16:09:53,668 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-04-26 16:09:53,669 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-04-26 16:09:53,670 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-04-26 16:09:53,671 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-04-26 16:09:53,671 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-04-26 16:09:53,671 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-04-26 16:09:53,673 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-04-26 16:09:53,674 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-04-26 16:09:53,674 INFO L181 SettingsManager]: Finished resetting all preferences to default values... Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation: TransformationType -> MAP_ELIMINATION_MONNIAUX [2019-04-26 16:09:53,711 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-04-26 16:09:53,724 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-04-26 16:09:53,728 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-04-26 16:09:53,730 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-04-26 16:09:53,730 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-04-26 16:09:53,731 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array.i_3.bpl [2019-04-26 16:09:53,731 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array.i_3.bpl' [2019-04-26 16:09:53,776 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-04-26 16:09:53,778 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-04-26 16:09:53,779 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-04-26 16:09:53,779 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-04-26 16:09:53,779 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-04-26 16:09:53,797 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "array.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:09:53" (1/1) ... [2019-04-26 16:09:53,809 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "array.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:09:53" (1/1) ... [2019-04-26 16:09:53,818 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-04-26 16:09:53,819 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-04-26 16:09:53,819 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-04-26 16:09:53,819 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-04-26 16:09:53,830 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:09:53" (1/1) ... [2019-04-26 16:09:53,831 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:09:53" (1/1) ... [2019-04-26 16:09:53,832 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:09:53" (1/1) ... [2019-04-26 16:09:53,832 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:09:53" (1/1) ... [2019-04-26 16:09:53,836 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:09:53" (1/1) ... [2019-04-26 16:09:53,838 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:09:53" (1/1) ... [2019-04-26 16:09:53,839 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:09:53" (1/1) ... [2019-04-26 16:09:53,840 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-04-26 16:09:53,841 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-04-26 16:09:53,841 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-04-26 16:09:53,841 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-04-26 16:09:53,842 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:09:53" (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 [2019-04-26 16:09:53,915 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-04-26 16:09:53,916 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-04-26 16:09:54,315 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-04-26 16:09:54,316 INFO L286 CfgBuilder]: Removed 1 assue(true) statements. [2019-04-26 16:09:54,317 INFO L202 PluginConnector]: Adding new model array.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:09:54 BoogieIcfgContainer [2019-04-26 16:09:54,317 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-04-26 16:09:54,317 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2019-04-26 16:09:54,318 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2019-04-26 16:09:54,319 INFO L276 PluginConnector]: IcfgTransformer initialized [2019-04-26 16:09:54,322 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "array.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:09:54" (1/1) ... [2019-04-26 16:09:54,364 INFO L359 onniauxMapEliminator]: L50 [2019-04-26 16:09:54,365 INFO L360 onniauxMapEliminator]: In Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~cond_1 |v_ULTIMATE.start___VERIFIER_assert_#in~cond_1|) (= 0 v_ULTIMATE.start___VERIFIER_assert_~cond_1) (not (< (mod v_ULTIMATE.start_main_~j~5_5 4294967296) (mod v_ULTIMATE.start_main_~SIZE~5_4 4294967296))) (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond_1| (ite (<= v_ULTIMATE.start_main_~menor~5_5 (select v_ULTIMATE.start_main_~array~5_4 0)) 1 0))) InVars {ULTIMATE.start_main_~SIZE~5=v_ULTIMATE.start_main_~SIZE~5_4, ULTIMATE.start_main_~array~5=v_ULTIMATE.start_main_~array~5_4, ULTIMATE.start_main_~menor~5=v_ULTIMATE.start_main_~menor~5_5, ULTIMATE.start_main_~j~5=v_ULTIMATE.start_main_~j~5_5} OutVars{ULTIMATE.start___VERIFIER_assert_~cond=v_ULTIMATE.start___VERIFIER_assert_~cond_1, ULTIMATE.start_main_~SIZE~5=v_ULTIMATE.start_main_~SIZE~5_4, ULTIMATE.start_main_~array~5=v_ULTIMATE.start_main_~array~5_4, ULTIMATE.start___VERIFIER_assert_#in~cond=|v_ULTIMATE.start___VERIFIER_assert_#in~cond_1|, ULTIMATE.start_main_~menor~5=v_ULTIMATE.start_main_~menor~5_5, ULTIMATE.start_main_~j~5=v_ULTIMATE.start_main_~j~5_5} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start___VERIFIER_assert_#in~cond] [2019-04-26 16:09:54,365 INFO L361 onniauxMapEliminator]: Out Formula: (and (= 0 v_ULTIMATE.start_main_~array~5_idx_0_term_1) (= v_ULTIMATE.start___VERIFIER_assert_~cond_1 |v_ULTIMATE.start___VERIFIER_assert_#in~cond_1|) (or (= v_ULTIMATE.start_main_~array~5_val_0_in_1 v_v_ULTIMATE.start_main_~array~5_4_aux_1) (not (= 0 v_ULTIMATE.start_main_~array~5_idx_0_term_1))) (= 0 v_ULTIMATE.start___VERIFIER_assert_~cond_1) (not (< (mod v_ULTIMATE.start_main_~j~5_5 4294967296) (mod v_ULTIMATE.start_main_~SIZE~5_4 4294967296))) (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond_1| (ite (<= v_ULTIMATE.start_main_~menor~5_5 v_v_ULTIMATE.start_main_~array~5_4_aux_1) 1 0))) InVars {ULTIMATE.start_main_~SIZE~5=v_ULTIMATE.start_main_~SIZE~5_4, ULTIMATE.start_main_~array~5_val_0=v_ULTIMATE.start_main_~array~5_val_0_in_1, ULTIMATE.start_main_~menor~5=v_ULTIMATE.start_main_~menor~5_5, ULTIMATE.start_main_~j~5=v_ULTIMATE.start_main_~j~5_5} OutVars{ULTIMATE.start_main_~array~5_val_0=v_ULTIMATE.start_main_~array~5_val_0_in_1, ULTIMATE.start___VERIFIER_assert_~cond=v_ULTIMATE.start___VERIFIER_assert_~cond_1, ULTIMATE.start_main_~array~5_idx_0=v_ULTIMATE.start_main_~array~5_idx_0_term_1, ULTIMATE.start_main_~SIZE~5=v_ULTIMATE.start_main_~SIZE~5_4, ULTIMATE.start___VERIFIER_assert_#in~cond=|v_ULTIMATE.start___VERIFIER_assert_#in~cond_1|, ULTIMATE.start_main_~menor~5=v_ULTIMATE.start_main_~menor~5_5, ULTIMATE.start_main_~j~5=v_ULTIMATE.start_main_~j~5_5} AuxVars[v_v_ULTIMATE.start_main_~array~5_4_aux_1] AssignedVars[ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_~array~5_idx_0, ULTIMATE.start___VERIFIER_assert_#in~cond] [2019-04-26 16:09:54,366 INFO L362 onniauxMapEliminator]: L39 [2019-04-26 16:09:54,382 INFO L359 onniauxMapEliminator]: L50 [2019-04-26 16:09:54,383 INFO L360 onniauxMapEliminator]: In Formula: (and (<= (select v_ULTIMATE.start_main_~array~5_5 (mod v_ULTIMATE.start_main_~j~5_7 4294967296)) v_ULTIMATE.start_main_~menor~5_7) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet2_3| 2147483648)) (<= |v_ULTIMATE.start_main_#t~nondet2_3| 2147483647) (= (+ v_ULTIMATE.start_main_~j~5_7 1) v_ULTIMATE.start_main_~j~5_6) (= v_ULTIMATE.start_main_~array~5_5 (store v_ULTIMATE.start_main_~array~5_6 (mod v_ULTIMATE.start_main_~j~5_7 4294967296) |v_ULTIMATE.start_main_#t~nondet2_3|)) (= v_ULTIMATE.start_main_~menor~5_6 (select v_ULTIMATE.start_main_~array~5_5 (mod v_ULTIMATE.start_main_~j~5_7 4294967296))) (< (mod v_ULTIMATE.start_main_~j~5_7 4294967296) (mod v_ULTIMATE.start_main_~SIZE~5_5 4294967296))) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|, ULTIMATE.start_main_~SIZE~5=v_ULTIMATE.start_main_~SIZE~5_5, ULTIMATE.start_main_~array~5=v_ULTIMATE.start_main_~array~5_6, ULTIMATE.start_main_~menor~5=v_ULTIMATE.start_main_~menor~5_7, ULTIMATE.start_main_~j~5=v_ULTIMATE.start_main_~j~5_7} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_2|, ULTIMATE.start_main_~SIZE~5=v_ULTIMATE.start_main_~SIZE~5_5, ULTIMATE.start_main_#t~post1=|v_ULTIMATE.start_main_#t~post1_2|, ULTIMATE.start_main_~array~5=v_ULTIMATE.start_main_~array~5_5, ULTIMATE.start_main_~menor~5=v_ULTIMATE.start_main_~menor~5_6, ULTIMATE.start_main_~j~5=v_ULTIMATE.start_main_~j~5_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~post1, ULTIMATE.start_main_~array~5, ULTIMATE.start_main_~menor~5, ULTIMATE.start_main_~j~5] [2019-04-26 16:09:54,383 INFO L361 onniauxMapEliminator]: Out Formula: (and (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet2_3| 2147483648)) (<= |v_ULTIMATE.start_main_#t~nondet2_3| 2147483647) (= (+ v_ULTIMATE.start_main_~j~5_7 1) v_ULTIMATE.start_main_~j~5_6) (= v_ULTIMATE.start_main_~menor~5_6 v_v_ULTIMATE.start_main_~array~5_5_aux_1) (<= v_v_ULTIMATE.start_main_~array~5_5_aux_1 v_ULTIMATE.start_main_~menor~5_7) (or (not (= v_ULTIMATE.start_main_~array~5_idx_0_term_2 (mod v_ULTIMATE.start_main_~j~5_7 4294967296))) (= v_ULTIMATE.start_main_~array~5_val_0_in_2 |v_ULTIMATE.start_main_#t~nondet2_3|)) (or (= v_ULTIMATE.start_main_~array~5_idx_0_term_2 (mod v_ULTIMATE.start_main_~j~5_7 4294967296)) (= v_ULTIMATE.start_main_~array~5_idx_0_term_2 v_ULTIMATE.start_main_~array~5_idx_0_term_1)) (< (mod v_ULTIMATE.start_main_~j~5_7 4294967296) (mod v_ULTIMATE.start_main_~SIZE~5_5 4294967296)) (or (not (= v_ULTIMATE.start_main_~array~5_idx_0_term_2 (mod v_ULTIMATE.start_main_~j~5_7 4294967296))) (= v_ULTIMATE.start_main_~array~5_val_0_out_1 v_v_ULTIMATE.start_main_~array~5_5_aux_1))) InVars {ULTIMATE.start_main_~array~5_val_0=v_ULTIMATE.start_main_~array~5_val_0_in_2, ULTIMATE.start_main_~array~5_idx_0=v_ULTIMATE.start_main_~array~5_idx_0_term_1, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|, ULTIMATE.start_main_~SIZE~5=v_ULTIMATE.start_main_~SIZE~5_5, ULTIMATE.start_main_~menor~5=v_ULTIMATE.start_main_~menor~5_7, ULTIMATE.start_main_~j~5=v_ULTIMATE.start_main_~j~5_7} OutVars{ULTIMATE.start_main_~array~5_val_0=v_ULTIMATE.start_main_~array~5_val_0_out_1, ULTIMATE.start_main_~array~5_idx_0=v_ULTIMATE.start_main_~array~5_idx_0_term_2, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_2|, ULTIMATE.start_main_~SIZE~5=v_ULTIMATE.start_main_~SIZE~5_5, ULTIMATE.start_main_#t~post1=|v_ULTIMATE.start_main_#t~post1_2|, ULTIMATE.start_main_~menor~5=v_ULTIMATE.start_main_~menor~5_6, ULTIMATE.start_main_~j~5=v_ULTIMATE.start_main_~j~5_6} AuxVars[v_v_ULTIMATE.start_main_~array~5_5_aux_1] AssignedVars[ULTIMATE.start_main_~array~5_val_0, ULTIMATE.start_main_~array~5_idx_0, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~post1, ULTIMATE.start_main_~menor~5, ULTIMATE.start_main_~j~5] [2019-04-26 16:09:54,383 INFO L362 onniauxMapEliminator]: L50 [2019-04-26 16:09:54,406 INFO L202 PluginConnector]: Adding new model array.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 26.04 04:09:54 BasicIcfg [2019-04-26 16:09:54,406 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2019-04-26 16:09:54,408 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-04-26 16:09:54,408 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-04-26 16:09:54,411 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-04-26 16:09:54,412 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:09:53" (1/3) ... [2019-04-26 16:09:54,413 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57a097ae and model type array.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.04 04:09:54, skipping insertion in model container [2019-04-26 16:09:54,414 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:09:54" (2/3) ... [2019-04-26 16:09:54,414 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57a097ae and model type array.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.04 04:09:54, skipping insertion in model container [2019-04-26 16:09:54,414 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 26.04 04:09:54" (3/3) ... [2019-04-26 16:09:54,416 INFO L112 eAbstractionObserver]: Analyzing ICFG array.i_3.bplME [2019-04-26 16:09:54,429 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-04-26 16:09:54,439 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-04-26 16:09:54,469 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-26 16:09:54,503 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-04-26 16:09:54,504 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-26 16:09:54,504 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-26 16:09:54,504 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-26 16:09:54,504 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-26 16:09:54,505 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-26 16:09:54,505 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-26 16:09:54,505 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-26 16:09:54,505 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-04-26 16:09:54,525 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-04-26 16:09:54,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-04-26 16:09:54,538 INFO L394 BasicCegarLoop]: Found error trace [2019-04-26 16:09:54,539 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-04-26 16:09:54,541 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-04-26 16:09:54,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-26 16:09:54,548 INFO L82 PathProgramCache]: Analyzing trace with hash 42734, now seen corresponding path program 1 times [2019-04-26 16:09:54,610 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-04-26 16:09:54,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-26 16:09:54,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 5 conjunts are in the unsatisfiable core [2019-04-26 16:09:54,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-26 16:09:54,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-04-26 16:09:54,859 INFO L273 TraceCheckUtils]: 0: Hoare triple {8#true} [13] ULTIMATE.startENTRY-->L50: Formula: (and (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet0_3| 2147483648)) (= v_ULTIMATE.start_main_~SIZE~5_1 1) (<= |v_ULTIMATE.start_main_#t~nondet0_3| 2147483647) (= v_ULTIMATE.start_main_~j~5_1 0) (= v_ULTIMATE.start_main_~menor~5_1 |v_ULTIMATE.start_main_#t~nondet0_3|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~SIZE~5=v_ULTIMATE.start_main_~SIZE~5_1, ULTIMATE.start_main_~array~5=v_ULTIMATE.start_main_~array~5_1, ULTIMATE.start_main_#t~post1=|v_ULTIMATE.start_main_#t~post1_1|, ULTIMATE.start_main_~menor~5=v_ULTIMATE.start_main_~menor~5_1, ULTIMATE.start_main_~k~5=v_ULTIMATE.start_main_~k~5_1, ULTIMATE.start_main_~j~5=v_ULTIMATE.start_main_~j~5_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_3|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~SIZE~5, ULTIMATE.start_main_~array~5, ULTIMATE.start_main_#t~post1, ULTIMATE.start_main_~menor~5, ULTIMATE.start_main_~k~5, ULTIMATE.start_main_~j~5] {13#(and (= ULTIMATE.start_main_~j~5 0) (= ULTIMATE.start_main_~SIZE~5 1))} is VALID [2019-04-26 16:09:54,870 INFO L273 TraceCheckUtils]: 1: Hoare triple {13#(and (= ULTIMATE.start_main_~j~5 0) (= ULTIMATE.start_main_~SIZE~5 1))} [14] L50-->L39: Formula: (let ((.cse0 (= 0 v_ULTIMATE.start_main_~array~5_idx_0_term_1))) (and .cse0 (= v_ULTIMATE.start___VERIFIER_assert_~cond_1 |v_ULTIMATE.start___VERIFIER_assert_#in~cond_1|) (or (= v_ULTIMATE.start_main_~array~5_val_0_in_1 v_v_ULTIMATE.start_main_~array~5_4_aux_1) (not .cse0)) (= 0 v_ULTIMATE.start___VERIFIER_assert_~cond_1) (not (< (mod v_ULTIMATE.start_main_~j~5_5 4294967296) (mod v_ULTIMATE.start_main_~SIZE~5_4 4294967296))) (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond_1| (ite (<= v_ULTIMATE.start_main_~menor~5_5 v_v_ULTIMATE.start_main_~array~5_4_aux_1) 1 0)))) InVars {ULTIMATE.start_main_~SIZE~5=v_ULTIMATE.start_main_~SIZE~5_4, ULTIMATE.start_main_~array~5_val_0=v_ULTIMATE.start_main_~array~5_val_0_in_1, ULTIMATE.start_main_~menor~5=v_ULTIMATE.start_main_~menor~5_5, ULTIMATE.start_main_~j~5=v_ULTIMATE.start_main_~j~5_5} OutVars{ULTIMATE.start_main_~array~5_val_0=v_ULTIMATE.start_main_~array~5_val_0_in_1, ULTIMATE.start___VERIFIER_assert_~cond=v_ULTIMATE.start___VERIFIER_assert_~cond_1, ULTIMATE.start_main_~array~5_idx_0=v_ULTIMATE.start_main_~array~5_idx_0_term_1, ULTIMATE.start_main_~SIZE~5=v_ULTIMATE.start_main_~SIZE~5_4, ULTIMATE.start___VERIFIER_assert_#in~cond=|v_ULTIMATE.start___VERIFIER_assert_#in~cond_1|, ULTIMATE.start_main_~menor~5=v_ULTIMATE.start_main_~menor~5_5, ULTIMATE.start_main_~j~5=v_ULTIMATE.start_main_~j~5_5} AuxVars[v_v_ULTIMATE.start_main_~array~5_4_aux_1] AssignedVars[ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_~array~5_idx_0, ULTIMATE.start___VERIFIER_assert_#in~cond] {9#false} is VALID [2019-04-26 16:09:54,871 INFO L273 TraceCheckUtils]: 2: Hoare triple {9#false} [16] L39-->ULTIMATE.startErr0ASSERT_VIOLATIONASSERT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9#false} is VALID [2019-04-26 16:09:54,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-26 16:09:54,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-26 16:09:54,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-04-26 16:09:54,882 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-04-26 16:09:54,884 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-04-26 16:09:54,888 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-04-26 16:09:54,933 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-04-26 16:09:54,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-04-26 16:09:54,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-04-26 16:09:54,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-04-26 16:09:54,946 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-04-26 16:09:55,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-26 16:09:55,050 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-04-26 16:09:55,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-04-26 16:09:55,050 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-04-26 16:09:55,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-26 16:09:55,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-04-26 16:09:55,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-04-26 16:09:55,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-04-26 16:09:55,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-04-26 16:09:55,058 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 7 transitions. [2019-04-26 16:09:55,124 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-04-26 16:09:55,142 INFO L225 Difference]: With dead ends: 5 [2019-04-26 16:09:55,142 INFO L226 Difference]: Without dead ends: 5 [2019-04-26 16:09:55,144 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-04-26 16:09:55,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-04-26 16:09:55,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-04-26 16:09:55,165 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-04-26 16:09:55,165 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5 states. Second operand 5 states. [2019-04-26 16:09:55,165 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states. [2019-04-26 16:09:55,166 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states. [2019-04-26 16:09:55,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-26 16:09:55,167 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-04-26 16:09:55,168 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-04-26 16:09:55,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-26 16:09:55,168 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-04-26 16:09:55,169 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states. [2019-04-26 16:09:55,169 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states. [2019-04-26 16:09:55,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-26 16:09:55,170 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-04-26 16:09:55,171 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-04-26 16:09:55,171 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-26 16:09:55,171 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-04-26 16:09:55,171 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-04-26 16:09:55,172 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-04-26 16:09:55,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-04-26 16:09:55,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-04-26 16:09:55,174 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-04-26 16:09:55,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-26 16:09:55,175 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-04-26 16:09:55,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-04-26 16:09:55,175 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-04-26 16:09:55,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-04-26 16:09:55,176 INFO L394 BasicCegarLoop]: Found error trace [2019-04-26 16:09:55,176 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-04-26 16:09:55,176 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-04-26 16:09:55,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-26 16:09:55,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1325669, now seen corresponding path program 1 times [2019-04-26 16:09:55,178 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-04-26 16:09:55,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-26 16:09:55,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-26 16:09:55,267 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-26 16:09:55,273 INFO L85 mationBacktranslator]: Skipped ATE [13] [13] ULTIMATE.startENTRY-->L50: Formula: (and (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet0_3| 2147483648)) (= v_ULTIMATE.start_main_~SIZE~5_1 1) (<= |v_ULTIMATE.start_main_#t~nondet0_3| 2147483647) (= v_ULTIMATE.start_main_~j~5_1 0) (= v_ULTIMATE.start_main_~menor~5_1 |v_ULTIMATE.start_main_#t~nondet0_3|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~SIZE~5=v_ULTIMATE.start_main_~SIZE~5_1, ULTIMATE.start_main_~array~5=v_ULTIMATE.start_main_~array~5_1, ULTIMATE.start_main_#t~post1=|v_ULTIMATE.start_main_#t~post1_1|, ULTIMATE.start_main_~menor~5=v_ULTIMATE.start_main_~menor~5_1, ULTIMATE.start_main_~k~5=v_ULTIMATE.start_main_~k~5_1, ULTIMATE.start_main_~j~5=v_ULTIMATE.start_main_~j~5_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_3|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~SIZE~5, ULTIMATE.start_main_~array~5, ULTIMATE.start_main_#t~post1, ULTIMATE.start_main_~menor~5, ULTIMATE.start_main_~k~5, ULTIMATE.start_main_~j~5] [2019-04-26 16:09:55,274 INFO L85 mationBacktranslator]: Skipped ATE [16] [16] L39-->ULTIMATE.startErr0ASSERT_VIOLATIONASSERT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2019-04-26 16:09:55,280 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier2,QUANTIFIED] [2019-04-26 16:09:55,294 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier1,QUANTIFIED] [2019-04-26 16:09:55,303 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-04-26 16:09:55,311 INFO L202 PluginConnector]: Adding new model array.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.04 04:09:55 BasicIcfg [2019-04-26 16:09:55,311 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-04-26 16:09:55,311 INFO L168 Benchmark]: Toolchain (without parser) took 1534.68 ms. Allocated memory was 140.5 MB in the beginning and 176.2 MB in the end (delta: 35.7 MB). Free memory was 110.1 MB in the beginning and 146.7 MB in the end (delta: -36.6 MB). Peak memory consumption was 59.8 MB. Max. memory is 7.1 GB. [2019-04-26 16:09:55,316 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.24 ms. Allocated memory is still 140.5 MB. Free memory is still 111.5 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-04-26 16:09:55,318 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.25 ms. Allocated memory is still 140.5 MB. Free memory was 110.1 MB in the beginning and 108.3 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-04-26 16:09:55,320 INFO L168 Benchmark]: Boogie Preprocessor took 21.86 ms. Allocated memory is still 140.5 MB. Free memory was 108.3 MB in the beginning and 107.2 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-04-26 16:09:55,321 INFO L168 Benchmark]: RCFGBuilder took 476.30 ms. Allocated memory is still 140.5 MB. Free memory was 107.2 MB in the beginning and 95.7 MB in the end (delta: 11.5 MB). Peak memory consumption was 11.5 MB. Max. memory is 7.1 GB. [2019-04-26 16:09:55,322 INFO L168 Benchmark]: IcfgTransformer took 89.06 ms. Allocated memory is still 140.5 MB. Free memory was 95.5 MB in the beginning and 92.5 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2019-04-26 16:09:55,324 INFO L168 Benchmark]: TraceAbstraction took 902.96 ms. Allocated memory was 140.5 MB in the beginning and 176.2 MB in the end (delta: 35.7 MB). Free memory was 92.3 MB in the beginning and 146.7 MB in the end (delta: -54.5 MB). Peak memory consumption was 41.9 MB. Max. memory is 7.1 GB. [2019-04-26 16:09:55,337 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.24 ms. Allocated memory is still 140.5 MB. Free memory is still 111.5 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 39.25 ms. Allocated memory is still 140.5 MB. Free memory was 110.1 MB in the beginning and 108.3 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 21.86 ms. Allocated memory is still 140.5 MB. Free memory was 108.3 MB in the beginning and 107.2 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 476.30 ms. Allocated memory is still 140.5 MB. Free memory was 107.2 MB in the beginning and 95.7 MB in the end (delta: 11.5 MB). Peak memory consumption was 11.5 MB. Max. memory is 7.1 GB. * IcfgTransformer took 89.06 ms. Allocated memory is still 140.5 MB. Free memory was 95.5 MB in the beginning and 92.5 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 902.96 ms. Allocated memory was 140.5 MB in the beginning and 176.2 MB in the end (delta: 35.7 MB). Free memory was 92.3 MB in the beginning and 146.7 MB in the end (delta: -54.5 MB). Peak memory consumption was 41.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier1,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 52]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: overapproximation of IdentityTransformer. Possible FailurePath: [L41] assume !!(main_~j~5 % 4294967296 < main_~SIZE~5 % 4294967296); [L42] assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647; [L43] main_~array~5 := main_~array~5[main_~j~5 % 4294967296 := main_#t~nondet2]; [L44] havoc main_#t~nondet2; [L45] assume main_~array~5[main_~j~5 % 4294967296] <= main_~menor~5; [L46] main_~menor~5 := main_~array~5[main_~j~5 % 4294967296]; [L47] main_#t~post1 := main_~j~5; [L48] main_~j~5 := main_#t~post1 + 1; [L49] havoc main_#t~post1; [L33] assume !(main_~j~5 % 4294967296 < main_~SIZE~5 % 4294967296); [L34] __VERIFIER_assert_#in~cond := (if main_~array~5[0] >= main_~menor~5 then 1 else 0); [L35] havoc __VERIFIER_assert_~cond; [L36] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; [L37] assume __VERIFIER_assert_~cond == 0; [L38] assume !false; VAL [freshIdentifier1=-2, freshIdentifier2=-1, main_~j~5=1, main_~menor~5=-1, main_~SIZE~5=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. UNSAFE Result, 0.8s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2 SDtfs, 0 SDslu, 2 SDs, 0 SdLazy, 4 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 7 NumberOfCodeBlocks, 7 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 2 ConstructedInterpolants, 0 QuantifiedInterpolants, 16 SizeOfPredicates, 2 NumberOfNonLiveVariables, 21 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...