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-1c58c86 [2019-05-15 10:56:00,364 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-05-15 10:56:00,366 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-05-15 10:56:00,378 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-05-15 10:56:00,379 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-05-15 10:56:00,380 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-05-15 10:56:00,381 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-05-15 10:56:00,383 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-05-15 10:56:00,385 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-05-15 10:56:00,386 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-05-15 10:56:00,387 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-05-15 10:56:00,387 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-05-15 10:56:00,388 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-05-15 10:56:00,389 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-05-15 10:56:00,391 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-05-15 10:56:00,391 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-05-15 10:56:00,392 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-05-15 10:56:00,395 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-05-15 10:56:00,397 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-05-15 10:56:00,399 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-05-15 10:56:00,400 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-05-15 10:56:00,401 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-05-15 10:56:00,404 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-05-15 10:56:00,404 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-05-15 10:56:00,405 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-05-15 10:56:00,406 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-05-15 10:56:00,406 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-05-15 10:56:00,407 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-05-15 10:56:00,407 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-05-15 10:56:00,408 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-05-15 10:56:00,409 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-05-15 10:56:00,410 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-05-15 10:56:00,411 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-05-15 10:56:00,412 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-05-15 10:56:00,412 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-05-15 10:56:00,412 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-05-15 10:56:00,413 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-05-15 10:56:00,414 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-05-15 10:56:00,414 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-05-15 10:56:00,455 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-05-15 10:56:00,466 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-05-15 10:56:00,470 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-05-15 10:56:00,472 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-05-15 10:56:00,472 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-05-15 10:56:00,473 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-05-15 10:56:00,473 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array.i_3.bpl' [2019-05-15 10:56:00,530 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-05-15 10:56:00,533 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-05-15 10:56:00,533 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-05-15 10:56:00,534 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-05-15 10:56:00,534 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-05-15 10:56:00,554 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 15.05 10:56:00" (1/1) ... [2019-05-15 10:56:00,569 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 15.05 10:56:00" (1/1) ... [2019-05-15 10:56:00,581 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-05-15 10:56:00,582 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-05-15 10:56:00,582 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-05-15 10:56:00,582 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-05-15 10:56:00,593 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:00" (1/1) ... [2019-05-15 10:56:00,594 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:00" (1/1) ... [2019-05-15 10:56:00,595 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:00" (1/1) ... [2019-05-15 10:56:00,595 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:00" (1/1) ... [2019-05-15 10:56:00,602 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:00" (1/1) ... [2019-05-15 10:56:00,606 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:00" (1/1) ... [2019-05-15 10:56:00,607 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:00" (1/1) ... [2019-05-15 10:56:00,609 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-05-15 10:56:00,610 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-05-15 10:56:00,611 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-05-15 10:56:00,611 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-05-15 10:56:00,612 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:00" (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-05-15 10:56:00,686 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-05-15 10:56:00,686 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-05-15 10:56:01,092 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-05-15 10:56:01,092 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-05-15 10:56:01,093 INFO L202 PluginConnector]: Adding new model array.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.05 10:56:01 BoogieIcfgContainer [2019-05-15 10:56:01,093 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-05-15 10:56:01,094 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2019-05-15 10:56:01,094 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2019-05-15 10:56:01,095 INFO L275 PluginConnector]: IcfgTransformer initialized [2019-05-15 10:56:01,098 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "array.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.05 10:56:01" (1/1) ... [2019-05-15 10:56:01,160 INFO L632 onniauxMapEliminator]: L50 [2019-05-15 10:56:01,160 INFO L633 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-05-15 10:56:01,161 INFO L634 onniauxMapEliminator]: Out Formula: (and (= 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)) v_ULTIMATE.start_main_~array~5_idx_0_term_assigned_1 (or (= 0 v_ULTIMATE.start_main_~array~5_idx_0_term_1) (not v_ULTIMATE.start_main_~array~5_idx_0_term_assigned_1))) InVars {ULTIMATE.start_main_~array~5_idx_0_bool=v_ULTIMATE.start_main_~array~5_idx_0_term_assigned_1, ULTIMATE.start_main_~array~5_val_0=v_ULTIMATE.start_main_~array~5_val_0_in_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_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_idx_0_bool=v_ULTIMATE.start_main_~array~5_idx_0_term_assigned_1, 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___VERIFIER_assert_#in~cond] [2019-05-15 10:56:01,161 INFO L635 onniauxMapEliminator]: L39 [2019-05-15 10:56:01,192 INFO L632 onniauxMapEliminator]: L50 [2019-05-15 10:56:01,193 INFO L633 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-05-15 10:56:01,193 INFO L634 onniauxMapEliminator]: Out Formula: (and (= v_ULTIMATE.start_main_~array~5_val_0_out_1 v_ULTIMATE.start_main_~array~5_val_0_in_2) (<= 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) (or (not v_ULTIMATE.start_main_~array~5_idx_0_term_assigned_1) (= v_ULTIMATE.start_main_~array~5_idx_0_term_2 (mod v_ULTIMATE.start_main_~j~5_7 4294967296))) (= 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|)) (< (mod v_ULTIMATE.start_main_~j~5_7 4294967296) (mod v_ULTIMATE.start_main_~SIZE~5_5 4294967296)) v_ULTIMATE.start_main_~array~5_idx_0_term_assigned_1 (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_idx_0_bool=v_ULTIMATE.start_main_~array~5_idx_0_term_assigned_1, 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_2, 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_idx_0_bool=v_ULTIMATE.start_main_~array~5_idx_0_term_assigned_1, 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_#t~nondet2, ULTIMATE.start_main_#t~post1, ULTIMATE.start_main_~menor~5, ULTIMATE.start_main_~j~5] [2019-05-15 10:56:01,193 INFO L635 onniauxMapEliminator]: L50 [2019-05-15 10:56:01,227 INFO L202 PluginConnector]: Adding new model array.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.05 10:56:01 BasicIcfg [2019-05-15 10:56:01,228 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2019-05-15 10:56:01,229 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-05-15 10:56:01,229 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-05-15 10:56:01,237 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-05-15 10:56:01,237 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:00" (1/3) ... [2019-05-15 10:56:01,238 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d9da394 and model type array.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.05 10:56:01, skipping insertion in model container [2019-05-15 10:56:01,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.05 10:56:01" (2/3) ... [2019-05-15 10:56:01,239 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d9da394 and model type array.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.05 10:56:01, skipping insertion in model container [2019-05-15 10:56:01,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.05 10:56:01" (3/3) ... [2019-05-15 10:56:01,241 INFO L109 eAbstractionObserver]: Analyzing ICFG array.i_3.bplME [2019-05-15 10:56:01,250 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-05-15 10:56:01,258 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-05-15 10:56:01,275 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-05-15 10:56:01,303 INFO L127 ementStrategyFactory]: Using default assertion order modulation [2019-05-15 10:56:01,304 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-05-15 10:56:01,304 INFO L378 AbstractCegarLoop]: Hoare is false [2019-05-15 10:56:01,304 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-05-15 10:56:01,304 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-05-15 10:56:01,304 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-05-15 10:56:01,305 INFO L382 AbstractCegarLoop]: Difference is false [2019-05-15 10:56:01,305 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-05-15 10:56:01,305 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-05-15 10:56:01,319 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-05-15 10:56:01,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-05-15 10:56:01,327 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:56:01,329 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-05-15 10:56:01,331 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:56:01,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:56:01,337 INFO L82 PathProgramCache]: Analyzing trace with hash 42734, now seen corresponding path program 1 times [2019-05-15 10:56:01,384 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:56:01,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:56:01,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 5 conjunts are in the unsatisfiable core [2019-05-15 10:56:01,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:56:01,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:56:01,626 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-05-15 10:56:01,631 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 (= 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)) v_ULTIMATE.start_main_~array~5_idx_0_term_assigned_1 (or .cse0 (not v_ULTIMATE.start_main_~array~5_idx_0_term_assigned_1)))) InVars {ULTIMATE.start_main_~array~5_idx_0_bool=v_ULTIMATE.start_main_~array~5_idx_0_term_assigned_1, ULTIMATE.start_main_~array~5_val_0=v_ULTIMATE.start_main_~array~5_val_0_in_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_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_idx_0_bool=v_ULTIMATE.start_main_~array~5_idx_0_term_assigned_1, 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___VERIFIER_assert_#in~cond] {9#false} is VALID [2019-05-15 10:56:01,632 INFO L273 TraceCheckUtils]: 2: Hoare triple {9#false} [16] L39-->ULTIMATE.startErr0ASSERT_VIOLATIONASSERT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9#false} is VALID [2019-05-15 10:56:01,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:56:01,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-05-15 10:56:01,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-05-15 10:56:01,642 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-05-15 10:56:01,643 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:56:01,646 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-05-15 10:56:01,669 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:56:01,669 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-05-15 10:56:01,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-05-15 10:56:01,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-05-15 10:56:01,680 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-05-15 10:56:01,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:56:01,778 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-05-15 10:56:01,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-05-15 10:56:01,778 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-05-15 10:56:01,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:56:01,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-05-15 10:56:01,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-05-15 10:56:01,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-05-15 10:56:01,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-05-15 10:56:01,786 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 7 transitions. [2019-05-15 10:56:01,854 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:56:01,864 INFO L225 Difference]: With dead ends: 5 [2019-05-15 10:56:01,864 INFO L226 Difference]: Without dead ends: 5 [2019-05-15 10:56:01,866 INFO L628 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-05-15 10:56:01,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-05-15 10:56:01,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-05-15 10:56:01,893 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:56:01,894 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5 states. Second operand 5 states. [2019-05-15 10:56:01,894 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states. [2019-05-15 10:56:01,894 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states. [2019-05-15 10:56:01,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:56:01,896 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-05-15 10:56:01,896 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-05-15 10:56:01,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:56:01,897 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:56:01,897 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states. [2019-05-15 10:56:01,897 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states. [2019-05-15 10:56:01,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:56:01,898 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-05-15 10:56:01,899 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-05-15 10:56:01,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:56:01,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:56:01,899 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:56:01,900 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:56:01,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-05-15 10:56:01,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-05-15 10:56:01,902 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-05-15 10:56:01,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:56:01,903 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-05-15 10:56:01,903 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-05-15 10:56:01,903 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-05-15 10:56:01,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-05-15 10:56:01,904 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:56:01,904 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-05-15 10:56:01,904 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:56:01,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:56:01,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1325669, now seen corresponding path program 1 times [2019-05-15 10:56:01,906 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:56:01,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:56:01,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 10 conjunts are in the unsatisfiable core [2019-05-15 10:56:01,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:56:01,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:56:02,206 INFO L273 TraceCheckUtils]: 0: Hoare triple {39#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] {39#true} is VALID [2019-05-15 10:56:02,209 INFO L273 TraceCheckUtils]: 1: Hoare triple {39#true} [15] L50-->L50: Formula: (let ((.cse2 (mod v_ULTIMATE.start_main_~j~5_7 4294967296))) (let ((.cse0 (= v_ULTIMATE.start_main_~array~5_idx_0_term_2 .cse2))) (let ((.cse1 (not .cse0))) (and (= v_ULTIMATE.start_main_~array~5_val_0_out_1 v_ULTIMATE.start_main_~array~5_val_0_in_2) (<= 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) (or (not v_ULTIMATE.start_main_~array~5_idx_0_term_assigned_1) .cse0) (= 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 .cse1 (= v_ULTIMATE.start_main_~array~5_val_0_in_2 |v_ULTIMATE.start_main_#t~nondet2_3|)) (< .cse2 (mod v_ULTIMATE.start_main_~SIZE~5_5 4294967296)) v_ULTIMATE.start_main_~array~5_idx_0_term_assigned_1 (or .cse1 (= 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_idx_0_bool=v_ULTIMATE.start_main_~array~5_idx_0_term_assigned_1, 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_2, 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_idx_0_bool=v_ULTIMATE.start_main_~array~5_idx_0_term_assigned_1, 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_#t~nondet2, ULTIMATE.start_main_#t~post1, ULTIMATE.start_main_~menor~5, ULTIMATE.start_main_~j~5] {47#(and ULTIMATE.start_main_~array~5_idx_0_bool (exists ((v_prenex_1 Int)) (= ULTIMATE.start_main_~array~5_idx_0 (mod v_prenex_1 4294967296))) (<= ULTIMATE.start_main_~menor~5 ULTIMATE.start_main_~array~5_val_0))} is VALID [2019-05-15 10:56:02,223 INFO L273 TraceCheckUtils]: 2: Hoare triple {47#(and ULTIMATE.start_main_~array~5_idx_0_bool (exists ((v_prenex_1 Int)) (= ULTIMATE.start_main_~array~5_idx_0 (mod v_prenex_1 4294967296))) (<= ULTIMATE.start_main_~menor~5 ULTIMATE.start_main_~array~5_val_0))} [14] L50-->L39: Formula: (let ((.cse0 (= 0 v_ULTIMATE.start_main_~array~5_idx_0_term_1))) (and (= 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)) v_ULTIMATE.start_main_~array~5_idx_0_term_assigned_1 (or .cse0 (not v_ULTIMATE.start_main_~array~5_idx_0_term_assigned_1)))) InVars {ULTIMATE.start_main_~array~5_idx_0_bool=v_ULTIMATE.start_main_~array~5_idx_0_term_assigned_1, ULTIMATE.start_main_~array~5_val_0=v_ULTIMATE.start_main_~array~5_val_0_in_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_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_idx_0_bool=v_ULTIMATE.start_main_~array~5_idx_0_term_assigned_1, 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___VERIFIER_assert_#in~cond] {40#false} is VALID [2019-05-15 10:56:02,224 INFO L273 TraceCheckUtils]: 3: Hoare triple {40#false} [16] L39-->ULTIMATE.startErr0ASSERT_VIOLATIONASSERT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40#false} is VALID [2019-05-15 10:56:02,225 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:56:02,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-05-15 10:56:02,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-05-15 10:56:02,227 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-05-15 10:56:02,227 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:56:02,228 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-05-15 10:56:02,259 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:56:02,259 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-05-15 10:56:02,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-05-15 10:56:02,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-05-15 10:56:02,260 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 3 states. [2019-05-15 10:56:02,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:56:02,310 INFO L93 Difference]: Finished difference Result 3 states and 3 transitions. [2019-05-15 10:56:02,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-05-15 10:56:02,310 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-05-15 10:56:02,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:56:02,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-05-15 10:56:02,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-05-15 10:56:02,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-05-15 10:56:02,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-05-15 10:56:02,312 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 4 transitions. [2019-05-15 10:56:02,350 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:56:02,350 INFO L225 Difference]: With dead ends: 3 [2019-05-15 10:56:02,350 INFO L226 Difference]: Without dead ends: 0 [2019-05-15 10:56:02,351 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-05-15 10:56:02,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-05-15 10:56:02,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-05-15 10:56:02,352 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:56:02,352 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2019-05-15 10:56:02,352 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-05-15 10:56:02,353 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-05-15 10:56:02,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:56:02,353 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-05-15 10:56:02,353 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-05-15 10:56:02,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:56:02,354 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:56:02,354 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-05-15 10:56:02,355 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-05-15 10:56:02,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:56:02,355 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-05-15 10:56:02,355 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-05-15 10:56:02,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:56:02,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:56:02,355 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:56:02,356 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:56:02,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-05-15 10:56:02,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-05-15 10:56:02,356 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 4 [2019-05-15 10:56:02,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:56:02,356 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-05-15 10:56:02,357 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-05-15 10:56:02,357 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-05-15 10:56:02,357 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:56:02,360 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-05-15 10:56:02,362 INFO L202 PluginConnector]: Adding new model array.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.05 10:56:02 BasicIcfg [2019-05-15 10:56:02,362 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-05-15 10:56:02,363 INFO L168 Benchmark]: Toolchain (without parser) took 1832.28 ms. Allocated memory was 140.0 MB in the beginning and 176.7 MB in the end (delta: 36.7 MB). Free memory was 108.3 MB in the beginning and 130.6 MB in the end (delta: -22.3 MB). Peak memory consumption was 14.4 MB. Max. memory is 7.1 GB. [2019-05-15 10:56:02,366 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 140.0 MB. Free memory is still 109.8 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-05-15 10:56:02,366 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.28 ms. Allocated memory is still 140.0 MB. Free memory was 108.3 MB in the beginning and 106.6 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-05-15 10:56:02,368 INFO L168 Benchmark]: Boogie Preprocessor took 27.32 ms. Allocated memory is still 140.0 MB. Free memory was 106.6 MB in the beginning and 105.5 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-05-15 10:56:02,369 INFO L168 Benchmark]: RCFGBuilder took 483.13 ms. Allocated memory is still 140.0 MB. Free memory was 105.5 MB in the beginning and 93.9 MB in the end (delta: 11.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 7.1 GB. [2019-05-15 10:56:02,370 INFO L168 Benchmark]: IcfgTransformer took 133.78 ms. Allocated memory is still 140.0 MB. Free memory was 93.7 MB in the beginning and 89.7 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 7.1 GB. [2019-05-15 10:56:02,370 INFO L168 Benchmark]: TraceAbstraction took 1132.87 ms. Allocated memory was 140.0 MB in the beginning and 176.7 MB in the end (delta: 36.7 MB). Free memory was 89.5 MB in the beginning and 130.6 MB in the end (delta: -41.1 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-05-15 10:56:02,378 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.20 ms. Allocated memory is still 140.0 MB. Free memory is still 109.8 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 48.28 ms. Allocated memory is still 140.0 MB. Free memory was 108.3 MB in the beginning and 106.6 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 27.32 ms. Allocated memory is still 140.0 MB. Free memory was 106.6 MB in the beginning and 105.5 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 483.13 ms. Allocated memory is still 140.0 MB. Free memory was 105.5 MB in the beginning and 93.9 MB in the end (delta: 11.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 7.1 GB. * IcfgTransformer took 133.78 ms. Allocated memory is still 140.0 MB. Free memory was 93.7 MB in the beginning and 89.7 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1132.87 ms. Allocated memory was 140.0 MB in the beginning and 176.7 MB in the end (delta: 36.7 MB). Free memory was 89.5 MB in the beginning and 130.6 MB in the end (delta: -41.1 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 52]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. SAFE Result, 1.0s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3 SDtfs, 0 SDslu, 3 SDs, 0 SdLazy, 7 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s 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, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 7 NumberOfCodeBlocks, 7 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 5 ConstructedInterpolants, 1 QuantifiedInterpolants, 55 SizeOfPredicates, 8 NumberOfNonLiveVariables, 56 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 1/1 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...