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 --rcfgbuilder.size.of.a.code.block SingleStatement -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/array.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1c58c86 [2019-05-15 10:43:01,765 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-05-15 10:43:01,768 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-05-15 10:43:01,779 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-05-15 10:43:01,780 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-05-15 10:43:01,781 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-05-15 10:43:01,782 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-05-15 10:43:01,784 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-05-15 10:43:01,786 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-05-15 10:43:01,787 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-05-15 10:43:01,788 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-05-15 10:43:01,788 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-05-15 10:43:01,789 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-05-15 10:43:01,790 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-05-15 10:43:01,791 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-05-15 10:43:01,792 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-05-15 10:43:01,793 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-05-15 10:43:01,795 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-05-15 10:43:01,797 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-05-15 10:43:01,798 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-05-15 10:43:01,800 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-05-15 10:43:01,801 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-05-15 10:43:01,803 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-05-15 10:43:01,804 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-05-15 10:43:01,804 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-05-15 10:43:01,805 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-05-15 10:43:01,806 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-05-15 10:43:01,807 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-05-15 10:43:01,807 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-05-15 10:43:01,808 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-05-15 10:43:01,809 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-05-15 10:43:01,810 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-05-15 10:43:01,811 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-05-15 10:43:01,811 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-05-15 10:43:01,812 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-05-15 10:43:01,812 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-05-15 10:43:01,812 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-05-15 10:43:01,813 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-05-15 10:43:01,814 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> SingleStatement [2019-05-15 10:43:01,852 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-05-15 10:43:01,862 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-05-15 10:43:01,865 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-05-15 10:43:01,866 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-05-15 10:43:01,867 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-05-15 10:43:01,867 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:43:01,868 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array.i_3.bpl' [2019-05-15 10:43:01,907 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-05-15 10:43:01,909 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-05-15 10:43:01,910 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-05-15 10:43:01,910 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-05-15 10:43:01,910 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-05-15 10:43:01,926 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:43:01" (1/1) ... [2019-05-15 10:43:01,938 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:43:01" (1/1) ... [2019-05-15 10:43:01,949 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-05-15 10:43:01,950 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-05-15 10:43:01,950 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-05-15 10:43:01,950 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-05-15 10:43:01,963 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:43:01" (1/1) ... [2019-05-15 10:43:01,963 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:43:01" (1/1) ... [2019-05-15 10:43:01,965 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:43:01" (1/1) ... [2019-05-15 10:43:01,965 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:43:01" (1/1) ... [2019-05-15 10:43:01,970 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:43:01" (1/1) ... [2019-05-15 10:43:01,974 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:43:01" (1/1) ... [2019-05-15 10:43:01,975 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:43:01" (1/1) ... [2019-05-15 10:43:01,977 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-05-15 10:43:01,978 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-05-15 10:43:01,978 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-05-15 10:43:01,978 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-05-15 10:43:01,980 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:43:01" (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:43:02,049 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-05-15 10:43:02,050 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-05-15 10:43:02,661 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-05-15 10:43:02,661 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-05-15 10:43:02,662 INFO L202 PluginConnector]: Adding new model array.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.05 10:43:02 BoogieIcfgContainer [2019-05-15 10:43:02,662 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-05-15 10:43:02,663 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2019-05-15 10:43:02,663 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2019-05-15 10:43:02,664 INFO L275 PluginConnector]: IcfgTransformer initialized [2019-05-15 10:43:02,667 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:43:02" (1/1) ... [2019-05-15 10:43:02,782 INFO L632 onniauxMapEliminator]: L34 [2019-05-15 10:43:02,783 INFO L633 onniauxMapEliminator]: In Formula: (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond_1| (ite (<= v_ULTIMATE.start_main_~menor~5_4 (select v_ULTIMATE.start_main_~array~5_3 0)) 1 0)) InVars {ULTIMATE.start_main_~array~5=v_ULTIMATE.start_main_~array~5_3, ULTIMATE.start_main_~menor~5=v_ULTIMATE.start_main_~menor~5_4} OutVars{ULTIMATE.start_main_~array~5=v_ULTIMATE.start_main_~array~5_3, 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_4} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_#in~cond] [2019-05-15 10:43:02,783 INFO L634 onniauxMapEliminator]: Out Formula: (and (or (= v_ULTIMATE.start_main_~array~5_val_0_in_1 v_v_ULTIMATE.start_main_~array~5_3_aux_1) (not (= 0 v_ULTIMATE.start_main_~array~5_idx_0_term_1))) 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)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond_1| (ite (<= v_ULTIMATE.start_main_~menor~5_4 v_v_ULTIMATE.start_main_~array~5_3_aux_1) 1 0))) 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_~menor~5=v_ULTIMATE.start_main_~menor~5_4, ULTIMATE.start_main_~array~5_idx_0=v_ULTIMATE.start_main_~array~5_idx_0_term_1} 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_#in~cond=|v_ULTIMATE.start___VERIFIER_assert_#in~cond_1|, ULTIMATE.start_main_~menor~5=v_ULTIMATE.start_main_~menor~5_4, ULTIMATE.start_main_~array~5_idx_0=v_ULTIMATE.start_main_~array~5_idx_0_term_1} AuxVars[v_v_ULTIMATE.start_main_~array~5_3_aux_1] AssignedVars[ULTIMATE.start___VERIFIER_assert_#in~cond] [2019-05-15 10:43:02,783 INFO L635 onniauxMapEliminator]: L35 [2019-05-15 10:43:02,809 INFO L632 onniauxMapEliminator]: L43 [2019-05-15 10:43:02,810 INFO L633 onniauxMapEliminator]: In Formula: (= v_ULTIMATE.start_main_~array~5_4 (store v_ULTIMATE.start_main_~array~5_5 (mod v_ULTIMATE.start_main_~j~5_6 4294967296) |v_ULTIMATE.start_main_#t~nondet2_3|)) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|, ULTIMATE.start_main_~array~5=v_ULTIMATE.start_main_~array~5_5, ULTIMATE.start_main_~j~5=v_ULTIMATE.start_main_~j~5_6} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|, ULTIMATE.start_main_~array~5=v_ULTIMATE.start_main_~array~5_4, ULTIMATE.start_main_~j~5=v_ULTIMATE.start_main_~j~5_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~array~5] [2019-05-15 10:43:02,810 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) v_ULTIMATE.start_main_~array~5_idx_0_term_assigned_1 (or (not (= (mod v_ULTIMATE.start_main_~j~5_6 4294967296) v_ULTIMATE.start_main_~array~5_idx_0_term_2)) (= v_ULTIMATE.start_main_~array~5_val_0_in_2 |v_ULTIMATE.start_main_#t~nondet2_3|)) (or (= (mod v_ULTIMATE.start_main_~j~5_6 4294967296) v_ULTIMATE.start_main_~array~5_idx_0_term_2) (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_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_~j~5=v_ULTIMATE.start_main_~j~5_6} 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_3|, ULTIMATE.start_main_~j~5=v_ULTIMATE.start_main_~j~5_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~array~5_val_0] [2019-05-15 10:43:02,810 INFO L635 onniauxMapEliminator]: L44 [2019-05-15 10:43:02,820 INFO L632 onniauxMapEliminator]: L45 [2019-05-15 10:43:02,820 INFO L633 onniauxMapEliminator]: In Formula: (<= (select v_ULTIMATE.start_main_~array~5_6 (mod v_ULTIMATE.start_main_~j~5_7 4294967296)) v_ULTIMATE.start_main_~menor~5_5) InVars {ULTIMATE.start_main_~array~5=v_ULTIMATE.start_main_~array~5_6, ULTIMATE.start_main_~menor~5=v_ULTIMATE.start_main_~menor~5_5, ULTIMATE.start_main_~j~5=v_ULTIMATE.start_main_~j~5_7} OutVars{ULTIMATE.start_main_~array~5=v_ULTIMATE.start_main_~array~5_6, ULTIMATE.start_main_~menor~5=v_ULTIMATE.start_main_~menor~5_5, ULTIMATE.start_main_~j~5=v_ULTIMATE.start_main_~j~5_7} AuxVars[] AssignedVars[] [2019-05-15 10:43:02,820 INFO L634 onniauxMapEliminator]: Out Formula: (and (or (= v_ULTIMATE.start_main_~array~5_idx_0_term_3 (mod v_ULTIMATE.start_main_~j~5_7 4294967296)) (not v_ULTIMATE.start_main_~array~5_idx_0_term_assigned_1)) (<= v_v_ULTIMATE.start_main_~array~5_6_aux_1 v_ULTIMATE.start_main_~menor~5_5) (or (= v_v_ULTIMATE.start_main_~array~5_6_aux_1 v_ULTIMATE.start_main_~array~5_val_0_in_3) (not (= v_ULTIMATE.start_main_~array~5_idx_0_term_3 (mod v_ULTIMATE.start_main_~j~5_7 4294967296)))) 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_3, ULTIMATE.start_main_~menor~5=v_ULTIMATE.start_main_~menor~5_5, ULTIMATE.start_main_~array~5_idx_0=v_ULTIMATE.start_main_~array~5_idx_0_term_3, 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_in_3, ULTIMATE.start_main_~menor~5=v_ULTIMATE.start_main_~menor~5_5, ULTIMATE.start_main_~array~5_idx_0=v_ULTIMATE.start_main_~array~5_idx_0_term_3, ULTIMATE.start_main_~j~5=v_ULTIMATE.start_main_~j~5_7} AuxVars[v_v_ULTIMATE.start_main_~array~5_6_aux_1] AssignedVars[] [2019-05-15 10:43:02,821 INFO L635 onniauxMapEliminator]: L46 [2019-05-15 10:43:02,829 INFO L632 onniauxMapEliminator]: L46 [2019-05-15 10:43:02,829 INFO L633 onniauxMapEliminator]: In Formula: (= v_ULTIMATE.start_main_~menor~5_6 (select v_ULTIMATE.start_main_~array~5_7 (mod v_ULTIMATE.start_main_~j~5_8 4294967296))) InVars {ULTIMATE.start_main_~array~5=v_ULTIMATE.start_main_~array~5_7, ULTIMATE.start_main_~j~5=v_ULTIMATE.start_main_~j~5_8} OutVars{ULTIMATE.start_main_~array~5=v_ULTIMATE.start_main_~array~5_7, ULTIMATE.start_main_~menor~5=v_ULTIMATE.start_main_~menor~5_6, ULTIMATE.start_main_~j~5=v_ULTIMATE.start_main_~j~5_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~menor~5] [2019-05-15 10:43:02,830 INFO L634 onniauxMapEliminator]: Out Formula: (and (= v_ULTIMATE.start_main_~menor~5_6 v_v_ULTIMATE.start_main_~array~5_7_aux_1) (or (= v_v_ULTIMATE.start_main_~array~5_7_aux_1 v_ULTIMATE.start_main_~array~5_val_0_in_4) (not (= v_ULTIMATE.start_main_~array~5_idx_0_term_4 (mod v_ULTIMATE.start_main_~j~5_8 4294967296)))) v_ULTIMATE.start_main_~array~5_idx_0_term_assigned_1 (or (not v_ULTIMATE.start_main_~array~5_idx_0_term_assigned_1) (= v_ULTIMATE.start_main_~array~5_idx_0_term_4 (mod v_ULTIMATE.start_main_~j~5_8 4294967296)))) 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_4, ULTIMATE.start_main_~array~5_idx_0=v_ULTIMATE.start_main_~array~5_idx_0_term_4, ULTIMATE.start_main_~j~5=v_ULTIMATE.start_main_~j~5_8} 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_4, ULTIMATE.start_main_~menor~5=v_ULTIMATE.start_main_~menor~5_6, ULTIMATE.start_main_~array~5_idx_0=v_ULTIMATE.start_main_~array~5_idx_0_term_4, ULTIMATE.start_main_~j~5=v_ULTIMATE.start_main_~j~5_8} AuxVars[v_v_ULTIMATE.start_main_~array~5_7_aux_1] AssignedVars[ULTIMATE.start_main_~menor~5] [2019-05-15 10:43:02,830 INFO L635 onniauxMapEliminator]: L47 [2019-05-15 10:43:02,864 INFO L202 PluginConnector]: Adding new model array.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.05 10:43:02 BasicIcfg [2019-05-15 10:43:02,865 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2019-05-15 10:43:02,866 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-05-15 10:43:02,866 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-05-15 10:43:02,869 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-05-15 10:43:02,870 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:43:01" (1/3) ... [2019-05-15 10:43:02,871 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f3d1992 and model type array.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.05 10:43:02, skipping insertion in model container [2019-05-15 10:43:02,871 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:43:02" (2/3) ... [2019-05-15 10:43:02,872 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f3d1992 and model type array.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.05 10:43:02, skipping insertion in model container [2019-05-15 10:43:02,872 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:43:02" (3/3) ... [2019-05-15 10:43:02,874 INFO L109 eAbstractionObserver]: Analyzing ICFG array.i_3.bplME [2019-05-15 10:43:02,884 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-05-15 10:43:02,892 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-05-15 10:43:02,908 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-05-15 10:43:02,935 INFO L127 ementStrategyFactory]: Using default assertion order modulation [2019-05-15 10:43:02,936 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-05-15 10:43:02,936 INFO L378 AbstractCegarLoop]: Hoare is false [2019-05-15 10:43:02,936 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-05-15 10:43:02,936 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-05-15 10:43:02,936 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-05-15 10:43:02,937 INFO L382 AbstractCegarLoop]: Difference is false [2019-05-15 10:43:02,937 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-05-15 10:43:02,937 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-05-15 10:43:02,951 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2019-05-15 10:43:02,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-05-15 10:43:02,959 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:43:02,960 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-15 10:43:02,962 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:43:02,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:43:02,967 INFO L82 PathProgramCache]: Analyzing trace with hash -382718579, now seen corresponding path program 1 times [2019-05-15 10:43:03,009 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:43:03,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:43:03,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 5 conjunts are in the unsatisfiable core [2019-05-15 10:43:03,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:43:03,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:43:03,375 INFO L273 TraceCheckUtils]: 0: Hoare triple {32#true} [35] ULTIMATE.startENTRY-->L16: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res] {32#true} is VALID [2019-05-15 10:43:03,376 INFO L273 TraceCheckUtils]: 1: Hoare triple {32#true} [36] L16-->L17: Formula: true 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_~SIZE~5=v_ULTIMATE.start_main_~SIZE~5_1, ULTIMATE.start_main_#t~post1=|v_ULTIMATE.start_main_#t~post1_1|, ULTIMATE.start_main_~array~5=v_ULTIMATE.start_main_~array~5_1, ULTIMATE.start_main_~k~5=v_ULTIMATE.start_main_~k~5_1, ULTIMATE.start_main_~menor~5=v_ULTIMATE.start_main_~menor~5_1, ULTIMATE.start_main_~j~5=v_ULTIMATE.start_main_~j~5_1} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~SIZE~5, ULTIMATE.start_main_#t~post1, ULTIMATE.start_main_~array~5, ULTIMATE.start_main_~k~5, ULTIMATE.start_main_~menor~5, ULTIMATE.start_main_~j~5] {32#true} is VALID [2019-05-15 10:43:03,378 INFO L273 TraceCheckUtils]: 2: Hoare triple {32#true} [37] L17-->L18: Formula: (= v_ULTIMATE.start_main_~SIZE~5_2 1) InVars {} OutVars{ULTIMATE.start_main_~SIZE~5=v_ULTIMATE.start_main_~SIZE~5_2} AuxVars[] AssignedVars[ULTIMATE.start_main_~SIZE~5] {43#(= ULTIMATE.start_main_~SIZE~5 1)} is VALID [2019-05-15 10:43:03,387 INFO L273 TraceCheckUtils]: 3: Hoare triple {43#(= ULTIMATE.start_main_~SIZE~5 1)} [38] L18-->L19: Formula: true InVars {} OutVars{ULTIMATE.start_main_~j~5=v_ULTIMATE.start_main_~j~5_2} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~5] {43#(= ULTIMATE.start_main_~SIZE~5 1)} is VALID [2019-05-15 10:43:03,400 INFO L273 TraceCheckUtils]: 4: Hoare triple {43#(= ULTIMATE.start_main_~SIZE~5 1)} [39] L19-->L20: Formula: true InVars {} OutVars{ULTIMATE.start_main_~k~5=v_ULTIMATE.start_main_~k~5_2} AuxVars[] AssignedVars[ULTIMATE.start_main_~k~5] {43#(= ULTIMATE.start_main_~SIZE~5 1)} is VALID [2019-05-15 10:43:03,413 INFO L273 TraceCheckUtils]: 5: Hoare triple {43#(= ULTIMATE.start_main_~SIZE~5 1)} [40] L20-->L21: Formula: true InVars {} OutVars{ULTIMATE.start_main_~array~5=v_ULTIMATE.start_main_~array~5_2} AuxVars[] AssignedVars[ULTIMATE.start_main_~array~5] {43#(= ULTIMATE.start_main_~SIZE~5 1)} is VALID [2019-05-15 10:43:03,418 INFO L273 TraceCheckUtils]: 6: Hoare triple {43#(= ULTIMATE.start_main_~SIZE~5 1)} [41] L21-->L22: Formula: true InVars {} OutVars{ULTIMATE.start_main_~menor~5=v_ULTIMATE.start_main_~menor~5_2} AuxVars[] AssignedVars[ULTIMATE.start_main_~menor~5] {43#(= ULTIMATE.start_main_~SIZE~5 1)} is VALID [2019-05-15 10:43:03,419 INFO L273 TraceCheckUtils]: 7: Hoare triple {43#(= ULTIMATE.start_main_~SIZE~5 1)} [42] L22-->L23: Formula: (and (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet0_2| 2147483648)) (<= |v_ULTIMATE.start_main_#t~nondet0_2| 2147483647)) InVars {ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_2|} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_2|} AuxVars[] AssignedVars[] {43#(= ULTIMATE.start_main_~SIZE~5 1)} is VALID [2019-05-15 10:43:03,423 INFO L273 TraceCheckUtils]: 8: Hoare triple {43#(= ULTIMATE.start_main_~SIZE~5 1)} [43] L23-->L24: Formula: (= v_ULTIMATE.start_main_~menor~5_3 |v_ULTIMATE.start_main_#t~nondet0_3|) InVars {ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_3|} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_3|, ULTIMATE.start_main_~menor~5=v_ULTIMATE.start_main_~menor~5_3} AuxVars[] AssignedVars[ULTIMATE.start_main_~menor~5] {43#(= ULTIMATE.start_main_~SIZE~5 1)} is VALID [2019-05-15 10:43:03,427 INFO L273 TraceCheckUtils]: 9: Hoare triple {43#(= ULTIMATE.start_main_~SIZE~5 1)} [44] L24-->L25: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0] {43#(= ULTIMATE.start_main_~SIZE~5 1)} is VALID [2019-05-15 10:43:03,436 INFO L273 TraceCheckUtils]: 10: Hoare triple {43#(= ULTIMATE.start_main_~SIZE~5 1)} [45] L25-->L50: Formula: (= v_ULTIMATE.start_main_~j~5_3 0) InVars {} OutVars{ULTIMATE.start_main_~j~5=v_ULTIMATE.start_main_~j~5_3} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~5] {68#(and (= ULTIMATE.start_main_~j~5 0) (= ULTIMATE.start_main_~SIZE~5 1))} is VALID [2019-05-15 10:43:03,438 INFO L273 TraceCheckUtils]: 11: Hoare triple {68#(and (= ULTIMATE.start_main_~j~5 0) (= ULTIMATE.start_main_~SIZE~5 1))} [46] L50-->L34: Formula: (not (< (mod v_ULTIMATE.start_main_~j~5_4 4294967296) (mod v_ULTIMATE.start_main_~SIZE~5_3 4294967296))) InVars {ULTIMATE.start_main_~SIZE~5=v_ULTIMATE.start_main_~SIZE~5_3, ULTIMATE.start_main_~j~5=v_ULTIMATE.start_main_~j~5_4} OutVars{ULTIMATE.start_main_~SIZE~5=v_ULTIMATE.start_main_~SIZE~5_3, ULTIMATE.start_main_~j~5=v_ULTIMATE.start_main_~j~5_4} AuxVars[] AssignedVars[] {33#false} is VALID [2019-05-15 10:43:03,438 INFO L273 TraceCheckUtils]: 12: Hoare triple {33#false} [48] L34-->L35: Formula: (let ((.cse0 (= 0 v_ULTIMATE.start_main_~array~5_idx_0_term_1))) (and (or (= v_ULTIMATE.start_main_~array~5_val_0_in_1 v_v_ULTIMATE.start_main_~array~5_3_aux_1) (not .cse0)) 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)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond_1| (ite (<= v_ULTIMATE.start_main_~menor~5_4 v_v_ULTIMATE.start_main_~array~5_3_aux_1) 1 0)))) 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_~menor~5=v_ULTIMATE.start_main_~menor~5_4, ULTIMATE.start_main_~array~5_idx_0=v_ULTIMATE.start_main_~array~5_idx_0_term_1} 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_#in~cond=|v_ULTIMATE.start___VERIFIER_assert_#in~cond_1|, ULTIMATE.start_main_~menor~5=v_ULTIMATE.start_main_~menor~5_4, ULTIMATE.start_main_~array~5_idx_0=v_ULTIMATE.start_main_~array~5_idx_0_term_1} AuxVars[v_v_ULTIMATE.start_main_~array~5_3_aux_1] AssignedVars[ULTIMATE.start___VERIFIER_assert_#in~cond] {33#false} is VALID [2019-05-15 10:43:03,439 INFO L273 TraceCheckUtils]: 13: Hoare triple {33#false} [50] L35-->L36: Formula: true InVars {} OutVars{ULTIMATE.start___VERIFIER_assert_~cond=v_ULTIMATE.start___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~cond] {33#false} is VALID [2019-05-15 10:43:03,439 INFO L273 TraceCheckUtils]: 14: Hoare triple {33#false} [52] L36-->L37: Formula: (= v_ULTIMATE.start___VERIFIER_assert_~cond_2 |v_ULTIMATE.start___VERIFIER_assert_#in~cond_2|) InVars {ULTIMATE.start___VERIFIER_assert_#in~cond=|v_ULTIMATE.start___VERIFIER_assert_#in~cond_2|} OutVars{ULTIMATE.start___VERIFIER_assert_~cond=v_ULTIMATE.start___VERIFIER_assert_~cond_2, ULTIMATE.start___VERIFIER_assert_#in~cond=|v_ULTIMATE.start___VERIFIER_assert_#in~cond_2|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~cond] {33#false} is VALID [2019-05-15 10:43:03,439 INFO L273 TraceCheckUtils]: 15: Hoare triple {33#false} [54] L37-->L38: Formula: (= 0 v_ULTIMATE.start___VERIFIER_assert_~cond_3) InVars {ULTIMATE.start___VERIFIER_assert_~cond=v_ULTIMATE.start___VERIFIER_assert_~cond_3} OutVars{ULTIMATE.start___VERIFIER_assert_~cond=v_ULTIMATE.start___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {33#false} is VALID [2019-05-15 10:43:03,440 INFO L273 TraceCheckUtils]: 16: Hoare triple {33#false} [56] L38-->L39: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#false} is VALID [2019-05-15 10:43:03,440 INFO L273 TraceCheckUtils]: 17: Hoare triple {33#false} [58] L39-->ULTIMATE.startErr0ASSERT_VIOLATIONASSERT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#false} is VALID [2019-05-15 10:43:03,444 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:43:03,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-05-15 10:43:03,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-05-15 10:43:03,453 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-05-15 10:43:03,455 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:43:03,459 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-05-15 10:43:03,590 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:43:03,591 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-05-15 10:43:03,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-05-15 10:43:03,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-05-15 10:43:03,601 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 4 states. [2019-05-15 10:43:03,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:43:03,904 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-05-15 10:43:03,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-05-15 10:43:03,905 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-05-15 10:43:03,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:43:03,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-05-15 10:43:03,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2019-05-15 10:43:03,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-05-15 10:43:03,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2019-05-15 10:43:03,920 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 37 transitions. [2019-05-15 10:43:04,017 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:43:04,032 INFO L225 Difference]: With dead ends: 35 [2019-05-15 10:43:04,032 INFO L226 Difference]: Without dead ends: 35 [2019-05-15 10:43:04,034 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-05-15 10:43:04,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-05-15 10:43:04,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 28. [2019-05-15 10:43:04,065 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:43:04,067 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 28 states. [2019-05-15 10:43:04,068 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 28 states. [2019-05-15 10:43:04,068 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 28 states. [2019-05-15 10:43:04,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:43:04,080 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-05-15 10:43:04,080 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-05-15 10:43:04,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:43:04,081 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:43:04,082 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 35 states. [2019-05-15 10:43:04,082 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 35 states. [2019-05-15 10:43:04,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:43:04,088 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-05-15 10:43:04,088 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-05-15 10:43:04,089 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:43:04,089 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:43:04,089 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:43:04,090 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:43:04,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-05-15 10:43:04,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-05-15 10:43:04,094 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 18 [2019-05-15 10:43:04,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:43:04,095 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-05-15 10:43:04,095 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-05-15 10:43:04,095 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-05-15 10:43:04,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-05-15 10:43:04,096 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:43:04,096 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-15 10:43:04,097 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:43:04,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:43:04,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1036365692, now seen corresponding path program 1 times [2019-05-15 10:43:04,098 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:43:04,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:43:04,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 10 conjunts are in the unsatisfiable core [2019-05-15 10:43:04,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:43:04,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:43:04,564 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-05-15 10:43:04,944 INFO L273 TraceCheckUtils]: 0: Hoare triple {222#true} [35] ULTIMATE.startENTRY-->L16: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res] {222#true} is VALID [2019-05-15 10:43:04,944 INFO L273 TraceCheckUtils]: 1: Hoare triple {222#true} [36] L16-->L17: Formula: true 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_~SIZE~5=v_ULTIMATE.start_main_~SIZE~5_1, ULTIMATE.start_main_#t~post1=|v_ULTIMATE.start_main_#t~post1_1|, ULTIMATE.start_main_~array~5=v_ULTIMATE.start_main_~array~5_1, ULTIMATE.start_main_~k~5=v_ULTIMATE.start_main_~k~5_1, ULTIMATE.start_main_~menor~5=v_ULTIMATE.start_main_~menor~5_1, ULTIMATE.start_main_~j~5=v_ULTIMATE.start_main_~j~5_1} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~SIZE~5, ULTIMATE.start_main_#t~post1, ULTIMATE.start_main_~array~5, ULTIMATE.start_main_~k~5, ULTIMATE.start_main_~menor~5, ULTIMATE.start_main_~j~5] {222#true} is VALID [2019-05-15 10:43:04,945 INFO L273 TraceCheckUtils]: 2: Hoare triple {222#true} [37] L17-->L18: Formula: (= v_ULTIMATE.start_main_~SIZE~5_2 1) InVars {} OutVars{ULTIMATE.start_main_~SIZE~5=v_ULTIMATE.start_main_~SIZE~5_2} AuxVars[] AssignedVars[ULTIMATE.start_main_~SIZE~5] {222#true} is VALID [2019-05-15 10:43:04,945 INFO L273 TraceCheckUtils]: 3: Hoare triple {222#true} [38] L18-->L19: Formula: true InVars {} OutVars{ULTIMATE.start_main_~j~5=v_ULTIMATE.start_main_~j~5_2} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~5] {222#true} is VALID [2019-05-15 10:43:04,945 INFO L273 TraceCheckUtils]: 4: Hoare triple {222#true} [39] L19-->L20: Formula: true InVars {} OutVars{ULTIMATE.start_main_~k~5=v_ULTIMATE.start_main_~k~5_2} AuxVars[] AssignedVars[ULTIMATE.start_main_~k~5] {222#true} is VALID [2019-05-15 10:43:04,946 INFO L273 TraceCheckUtils]: 5: Hoare triple {222#true} [40] L20-->L21: Formula: true InVars {} OutVars{ULTIMATE.start_main_~array~5=v_ULTIMATE.start_main_~array~5_2} AuxVars[] AssignedVars[ULTIMATE.start_main_~array~5] {222#true} is VALID [2019-05-15 10:43:04,946 INFO L273 TraceCheckUtils]: 6: Hoare triple {222#true} [41] L21-->L22: Formula: true InVars {} OutVars{ULTIMATE.start_main_~menor~5=v_ULTIMATE.start_main_~menor~5_2} AuxVars[] AssignedVars[ULTIMATE.start_main_~menor~5] {222#true} is VALID [2019-05-15 10:43:04,947 INFO L273 TraceCheckUtils]: 7: Hoare triple {222#true} [42] L22-->L23: Formula: (and (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet0_2| 2147483648)) (<= |v_ULTIMATE.start_main_#t~nondet0_2| 2147483647)) InVars {ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_2|} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_2|} AuxVars[] AssignedVars[] {222#true} is VALID [2019-05-15 10:43:04,947 INFO L273 TraceCheckUtils]: 8: Hoare triple {222#true} [43] L23-->L24: Formula: (= v_ULTIMATE.start_main_~menor~5_3 |v_ULTIMATE.start_main_#t~nondet0_3|) InVars {ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_3|} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_3|, ULTIMATE.start_main_~menor~5=v_ULTIMATE.start_main_~menor~5_3} AuxVars[] AssignedVars[ULTIMATE.start_main_~menor~5] {222#true} is VALID [2019-05-15 10:43:04,947 INFO L273 TraceCheckUtils]: 9: Hoare triple {222#true} [44] L24-->L25: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0] {222#true} is VALID [2019-05-15 10:43:04,948 INFO L273 TraceCheckUtils]: 10: Hoare triple {222#true} [45] L25-->L50: Formula: (= v_ULTIMATE.start_main_~j~5_3 0) InVars {} OutVars{ULTIMATE.start_main_~j~5=v_ULTIMATE.start_main_~j~5_3} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~5] {222#true} is VALID [2019-05-15 10:43:04,948 INFO L273 TraceCheckUtils]: 11: Hoare triple {222#true} [47] L50-->L42: Formula: (< (mod v_ULTIMATE.start_main_~j~5_5 4294967296) (mod v_ULTIMATE.start_main_~SIZE~5_4 4294967296)) InVars {ULTIMATE.start_main_~SIZE~5=v_ULTIMATE.start_main_~SIZE~5_4, ULTIMATE.start_main_~j~5=v_ULTIMATE.start_main_~j~5_5} OutVars{ULTIMATE.start_main_~SIZE~5=v_ULTIMATE.start_main_~SIZE~5_4, ULTIMATE.start_main_~j~5=v_ULTIMATE.start_main_~j~5_5} AuxVars[] AssignedVars[] {222#true} is VALID [2019-05-15 10:43:04,948 INFO L273 TraceCheckUtils]: 12: Hoare triple {222#true} [49] L42-->L43: Formula: (and (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet2_2| 2147483648)) (<= |v_ULTIMATE.start_main_#t~nondet2_2| 2147483647)) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_2|} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_2|} AuxVars[] AssignedVars[] {222#true} is VALID [2019-05-15 10:43:04,959 INFO L273 TraceCheckUtils]: 13: Hoare triple {222#true} [51] L43-->L44: Formula: (let ((.cse0 (= (mod v_ULTIMATE.start_main_~j~5_6 4294967296) v_ULTIMATE.start_main_~array~5_idx_0_term_2))) (and (= v_ULTIMATE.start_main_~array~5_val_0_out_1 v_ULTIMATE.start_main_~array~5_val_0_in_2) v_ULTIMATE.start_main_~array~5_idx_0_term_assigned_1 (or (not .cse0) (= v_ULTIMATE.start_main_~array~5_val_0_in_2 |v_ULTIMATE.start_main_#t~nondet2_3|)) (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_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_~j~5=v_ULTIMATE.start_main_~j~5_6} 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_3|, ULTIMATE.start_main_~j~5=v_ULTIMATE.start_main_~j~5_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~array~5_val_0] {266#(and (= ULTIMATE.start_main_~array~5_idx_0 (mod ULTIMATE.start_main_~j~5 4294967296)) ULTIMATE.start_main_~array~5_idx_0_bool)} is VALID [2019-05-15 10:43:04,972 INFO L273 TraceCheckUtils]: 14: Hoare triple {266#(and (= ULTIMATE.start_main_~array~5_idx_0 (mod ULTIMATE.start_main_~j~5 4294967296)) ULTIMATE.start_main_~array~5_idx_0_bool)} [53] L44-->L45: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] {266#(and (= ULTIMATE.start_main_~array~5_idx_0 (mod ULTIMATE.start_main_~j~5 4294967296)) ULTIMATE.start_main_~array~5_idx_0_bool)} is VALID [2019-05-15 10:43:04,979 INFO L273 TraceCheckUtils]: 15: Hoare triple {266#(and (= ULTIMATE.start_main_~array~5_idx_0 (mod ULTIMATE.start_main_~j~5 4294967296)) ULTIMATE.start_main_~array~5_idx_0_bool)} [55] L45-->L46: Formula: (let ((.cse0 (= v_ULTIMATE.start_main_~array~5_idx_0_term_3 (mod v_ULTIMATE.start_main_~j~5_7 4294967296)))) (and (or .cse0 (not v_ULTIMATE.start_main_~array~5_idx_0_term_assigned_1)) (<= v_v_ULTIMATE.start_main_~array~5_6_aux_1 v_ULTIMATE.start_main_~menor~5_5) (or (= v_v_ULTIMATE.start_main_~array~5_6_aux_1 v_ULTIMATE.start_main_~array~5_val_0_in_3) (not .cse0)) 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_3, ULTIMATE.start_main_~menor~5=v_ULTIMATE.start_main_~menor~5_5, ULTIMATE.start_main_~array~5_idx_0=v_ULTIMATE.start_main_~array~5_idx_0_term_3, 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_in_3, ULTIMATE.start_main_~menor~5=v_ULTIMATE.start_main_~menor~5_5, ULTIMATE.start_main_~array~5_idx_0=v_ULTIMATE.start_main_~array~5_idx_0_term_3, ULTIMATE.start_main_~j~5=v_ULTIMATE.start_main_~j~5_7} AuxVars[v_v_ULTIMATE.start_main_~array~5_6_aux_1] AssignedVars[] {266#(and (= ULTIMATE.start_main_~array~5_idx_0 (mod ULTIMATE.start_main_~j~5 4294967296)) ULTIMATE.start_main_~array~5_idx_0_bool)} is VALID [2019-05-15 10:43:04,989 INFO L273 TraceCheckUtils]: 16: Hoare triple {266#(and (= ULTIMATE.start_main_~array~5_idx_0 (mod ULTIMATE.start_main_~j~5 4294967296)) ULTIMATE.start_main_~array~5_idx_0_bool)} [57] L46-->L47: Formula: (let ((.cse0 (= v_ULTIMATE.start_main_~array~5_idx_0_term_4 (mod v_ULTIMATE.start_main_~j~5_8 4294967296)))) (and (= v_ULTIMATE.start_main_~menor~5_6 v_v_ULTIMATE.start_main_~array~5_7_aux_1) (or (= v_v_ULTIMATE.start_main_~array~5_7_aux_1 v_ULTIMATE.start_main_~array~5_val_0_in_4) (not .cse0)) v_ULTIMATE.start_main_~array~5_idx_0_term_assigned_1 (or (not v_ULTIMATE.start_main_~array~5_idx_0_term_assigned_1) .cse0))) 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_4, ULTIMATE.start_main_~array~5_idx_0=v_ULTIMATE.start_main_~array~5_idx_0_term_4, ULTIMATE.start_main_~j~5=v_ULTIMATE.start_main_~j~5_8} 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_4, ULTIMATE.start_main_~menor~5=v_ULTIMATE.start_main_~menor~5_6, ULTIMATE.start_main_~array~5_idx_0=v_ULTIMATE.start_main_~array~5_idx_0_term_4, ULTIMATE.start_main_~j~5=v_ULTIMATE.start_main_~j~5_8} AuxVars[v_v_ULTIMATE.start_main_~array~5_7_aux_1] AssignedVars[ULTIMATE.start_main_~menor~5] {276#(and ULTIMATE.start_main_~array~5_idx_0_bool (exists ((ULTIMATE.start_main_~j~5 Int)) (= ULTIMATE.start_main_~array~5_idx_0 (mod ULTIMATE.start_main_~j~5 4294967296))) (<= ULTIMATE.start_main_~menor~5 ULTIMATE.start_main_~array~5_val_0))} is VALID [2019-05-15 10:43:05,002 INFO L273 TraceCheckUtils]: 17: Hoare triple {276#(and ULTIMATE.start_main_~array~5_idx_0_bool (exists ((ULTIMATE.start_main_~j~5 Int)) (= ULTIMATE.start_main_~array~5_idx_0 (mod ULTIMATE.start_main_~j~5 4294967296))) (<= ULTIMATE.start_main_~menor~5 ULTIMATE.start_main_~array~5_val_0))} [60] L47-->L48: Formula: (= |v_ULTIMATE.start_main_#t~post1_2| v_ULTIMATE.start_main_~j~5_9) InVars {ULTIMATE.start_main_~j~5=v_ULTIMATE.start_main_~j~5_9} OutVars{ULTIMATE.start_main_#t~post1=|v_ULTIMATE.start_main_#t~post1_2|, ULTIMATE.start_main_~j~5=v_ULTIMATE.start_main_~j~5_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post1] {276#(and ULTIMATE.start_main_~array~5_idx_0_bool (exists ((ULTIMATE.start_main_~j~5 Int)) (= ULTIMATE.start_main_~array~5_idx_0 (mod ULTIMATE.start_main_~j~5 4294967296))) (<= ULTIMATE.start_main_~menor~5 ULTIMATE.start_main_~array~5_val_0))} is VALID [2019-05-15 10:43:05,015 INFO L273 TraceCheckUtils]: 18: Hoare triple {276#(and ULTIMATE.start_main_~array~5_idx_0_bool (exists ((ULTIMATE.start_main_~j~5 Int)) (= ULTIMATE.start_main_~array~5_idx_0 (mod ULTIMATE.start_main_~j~5 4294967296))) (<= ULTIMATE.start_main_~menor~5 ULTIMATE.start_main_~array~5_val_0))} [62] L48-->L49: Formula: (= v_ULTIMATE.start_main_~j~5_10 (+ |v_ULTIMATE.start_main_#t~post1_3| 1)) InVars {ULTIMATE.start_main_#t~post1=|v_ULTIMATE.start_main_#t~post1_3|} OutVars{ULTIMATE.start_main_#t~post1=|v_ULTIMATE.start_main_#t~post1_3|, ULTIMATE.start_main_~j~5=v_ULTIMATE.start_main_~j~5_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~5] {276#(and ULTIMATE.start_main_~array~5_idx_0_bool (exists ((ULTIMATE.start_main_~j~5 Int)) (= ULTIMATE.start_main_~array~5_idx_0 (mod ULTIMATE.start_main_~j~5 4294967296))) (<= ULTIMATE.start_main_~menor~5 ULTIMATE.start_main_~array~5_val_0))} is VALID [2019-05-15 10:43:05,028 INFO L273 TraceCheckUtils]: 19: Hoare triple {276#(and ULTIMATE.start_main_~array~5_idx_0_bool (exists ((ULTIMATE.start_main_~j~5 Int)) (= ULTIMATE.start_main_~array~5_idx_0 (mod ULTIMATE.start_main_~j~5 4294967296))) (<= ULTIMATE.start_main_~menor~5 ULTIMATE.start_main_~array~5_val_0))} [63] L49-->L50: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~post1=|v_ULTIMATE.start_main_#t~post1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post1] {276#(and ULTIMATE.start_main_~array~5_idx_0_bool (exists ((ULTIMATE.start_main_~j~5 Int)) (= ULTIMATE.start_main_~array~5_idx_0 (mod ULTIMATE.start_main_~j~5 4294967296))) (<= ULTIMATE.start_main_~menor~5 ULTIMATE.start_main_~array~5_val_0))} is VALID [2019-05-15 10:43:05,041 INFO L273 TraceCheckUtils]: 20: Hoare triple {276#(and ULTIMATE.start_main_~array~5_idx_0_bool (exists ((ULTIMATE.start_main_~j~5 Int)) (= ULTIMATE.start_main_~array~5_idx_0 (mod ULTIMATE.start_main_~j~5 4294967296))) (<= ULTIMATE.start_main_~menor~5 ULTIMATE.start_main_~array~5_val_0))} [46] L50-->L34: Formula: (not (< (mod v_ULTIMATE.start_main_~j~5_4 4294967296) (mod v_ULTIMATE.start_main_~SIZE~5_3 4294967296))) InVars {ULTIMATE.start_main_~SIZE~5=v_ULTIMATE.start_main_~SIZE~5_3, ULTIMATE.start_main_~j~5=v_ULTIMATE.start_main_~j~5_4} OutVars{ULTIMATE.start_main_~SIZE~5=v_ULTIMATE.start_main_~SIZE~5_3, ULTIMATE.start_main_~j~5=v_ULTIMATE.start_main_~j~5_4} AuxVars[] AssignedVars[] {276#(and ULTIMATE.start_main_~array~5_idx_0_bool (exists ((ULTIMATE.start_main_~j~5 Int)) (= ULTIMATE.start_main_~array~5_idx_0 (mod ULTIMATE.start_main_~j~5 4294967296))) (<= ULTIMATE.start_main_~menor~5 ULTIMATE.start_main_~array~5_val_0))} is VALID [2019-05-15 10:43:05,055 INFO L273 TraceCheckUtils]: 21: Hoare triple {276#(and ULTIMATE.start_main_~array~5_idx_0_bool (exists ((ULTIMATE.start_main_~j~5 Int)) (= ULTIMATE.start_main_~array~5_idx_0 (mod ULTIMATE.start_main_~j~5 4294967296))) (<= ULTIMATE.start_main_~menor~5 ULTIMATE.start_main_~array~5_val_0))} [48] L34-->L35: Formula: (let ((.cse0 (= 0 v_ULTIMATE.start_main_~array~5_idx_0_term_1))) (and (or (= v_ULTIMATE.start_main_~array~5_val_0_in_1 v_v_ULTIMATE.start_main_~array~5_3_aux_1) (not .cse0)) 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)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond_1| (ite (<= v_ULTIMATE.start_main_~menor~5_4 v_v_ULTIMATE.start_main_~array~5_3_aux_1) 1 0)))) 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_~menor~5=v_ULTIMATE.start_main_~menor~5_4, ULTIMATE.start_main_~array~5_idx_0=v_ULTIMATE.start_main_~array~5_idx_0_term_1} 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_#in~cond=|v_ULTIMATE.start___VERIFIER_assert_#in~cond_1|, ULTIMATE.start_main_~menor~5=v_ULTIMATE.start_main_~menor~5_4, ULTIMATE.start_main_~array~5_idx_0=v_ULTIMATE.start_main_~array~5_idx_0_term_1} AuxVars[v_v_ULTIMATE.start_main_~array~5_3_aux_1] AssignedVars[ULTIMATE.start___VERIFIER_assert_#in~cond] {292#(= 1 |ULTIMATE.start___VERIFIER_assert_#in~cond|)} is VALID [2019-05-15 10:43:05,065 INFO L273 TraceCheckUtils]: 22: Hoare triple {292#(= 1 |ULTIMATE.start___VERIFIER_assert_#in~cond|)} [50] L35-->L36: Formula: true InVars {} OutVars{ULTIMATE.start___VERIFIER_assert_~cond=v_ULTIMATE.start___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~cond] {292#(= 1 |ULTIMATE.start___VERIFIER_assert_#in~cond|)} is VALID [2019-05-15 10:43:05,074 INFO L273 TraceCheckUtils]: 23: Hoare triple {292#(= 1 |ULTIMATE.start___VERIFIER_assert_#in~cond|)} [52] L36-->L37: Formula: (= v_ULTIMATE.start___VERIFIER_assert_~cond_2 |v_ULTIMATE.start___VERIFIER_assert_#in~cond_2|) InVars {ULTIMATE.start___VERIFIER_assert_#in~cond=|v_ULTIMATE.start___VERIFIER_assert_#in~cond_2|} OutVars{ULTIMATE.start___VERIFIER_assert_~cond=v_ULTIMATE.start___VERIFIER_assert_~cond_2, ULTIMATE.start___VERIFIER_assert_#in~cond=|v_ULTIMATE.start___VERIFIER_assert_#in~cond_2|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~cond] {299#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2019-05-15 10:43:05,085 INFO L273 TraceCheckUtils]: 24: Hoare triple {299#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} [54] L37-->L38: Formula: (= 0 v_ULTIMATE.start___VERIFIER_assert_~cond_3) InVars {ULTIMATE.start___VERIFIER_assert_~cond=v_ULTIMATE.start___VERIFIER_assert_~cond_3} OutVars{ULTIMATE.start___VERIFIER_assert_~cond=v_ULTIMATE.start___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {223#false} is VALID [2019-05-15 10:43:05,085 INFO L273 TraceCheckUtils]: 25: Hoare triple {223#false} [56] L38-->L39: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {223#false} is VALID [2019-05-15 10:43:05,086 INFO L273 TraceCheckUtils]: 26: Hoare triple {223#false} [58] L39-->ULTIMATE.startErr0ASSERT_VIOLATIONASSERT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {223#false} is VALID [2019-05-15 10:43:05,089 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:43:05,090 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-05-15 10:43:05,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-05-15 10:43:05,092 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-05-15 10:43:05,092 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:43:05,092 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2019-05-15 10:43:05,161 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:43:05,161 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-05-15 10:43:05,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-05-15 10:43:05,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-05-15 10:43:05,163 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 6 states. [2019-05-15 10:43:05,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:43:05,637 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-05-15 10:43:05,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-05-15 10:43:05,638 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-05-15 10:43:05,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:43:05,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-05-15 10:43:05,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 31 transitions. [2019-05-15 10:43:05,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-05-15 10:43:05,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 31 transitions. [2019-05-15 10:43:05,644 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 31 transitions. [2019-05-15 10:43:05,747 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:43:05,747 INFO L225 Difference]: With dead ends: 30 [2019-05-15 10:43:05,747 INFO L226 Difference]: Without dead ends: 0 [2019-05-15 10:43:05,748 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-05-15 10:43:05,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-05-15 10:43:05,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-05-15 10:43:05,749 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:43:05,749 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2019-05-15 10:43:05,749 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-05-15 10:43:05,749 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-05-15 10:43:05,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:43:05,750 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-05-15 10:43:05,750 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-05-15 10:43:05,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:43:05,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:43:05,751 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-05-15 10:43:05,751 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-05-15 10:43:05,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:43:05,751 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-05-15 10:43:05,751 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-05-15 10:43:05,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:43:05,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:43:05,752 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:43:05,752 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:43:05,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-05-15 10:43:05,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-05-15 10:43:05,753 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2019-05-15 10:43:05,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:43:05,753 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-05-15 10:43:05,753 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-05-15 10:43:05,753 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-05-15 10:43:05,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:43:05,756 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-05-15 10:43:05,758 INFO L202 PluginConnector]: Adding new model array.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.05 10:43:05 BasicIcfg [2019-05-15 10:43:05,759 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-05-15 10:43:05,760 INFO L168 Benchmark]: Toolchain (without parser) took 3851.85 ms. Allocated memory was 107.5 MB in the beginning and 166.2 MB in the end (delta: 58.7 MB). Free memory was 78.2 MB in the beginning and 121.3 MB in the end (delta: -43.1 MB). Peak memory consumption was 15.6 MB. Max. memory is 7.1 GB. [2019-05-15 10:43:05,762 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.14 ms. Allocated memory is still 107.5 MB. Free memory is still 79.4 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-05-15 10:43:05,762 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.84 ms. Allocated memory is still 107.5 MB. Free memory was 77.9 MB in the beginning and 76.3 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. [2019-05-15 10:43:05,764 INFO L168 Benchmark]: Boogie Preprocessor took 27.52 ms. Allocated memory is still 107.5 MB. Free memory was 76.3 MB in the beginning and 75.2 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:43:05,765 INFO L168 Benchmark]: RCFGBuilder took 684.55 ms. Allocated memory is still 107.5 MB. Free memory was 75.1 MB in the beginning and 61.3 MB in the end (delta: 13.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 7.1 GB. [2019-05-15 10:43:05,766 INFO L168 Benchmark]: IcfgTransformer took 201.92 ms. Allocated memory was 107.5 MB in the beginning and 126.9 MB in the end (delta: 19.4 MB). Free memory was 61.2 MB in the beginning and 98.5 MB in the end (delta: -37.3 MB). Peak memory consumption was 7.0 MB. Max. memory is 7.1 GB. [2019-05-15 10:43:05,768 INFO L168 Benchmark]: TraceAbstraction took 2892.69 ms. Allocated memory was 126.9 MB in the beginning and 166.2 MB in the end (delta: 39.3 MB). Free memory was 98.2 MB in the beginning and 121.3 MB in the end (delta: -23.1 MB). Peak memory consumption was 16.2 MB. Max. memory is 7.1 GB. [2019-05-15 10:43:05,775 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.14 ms. Allocated memory is still 107.5 MB. Free memory is still 79.4 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 39.84 ms. Allocated memory is still 107.5 MB. Free memory was 77.9 MB in the beginning and 76.3 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 27.52 ms. Allocated memory is still 107.5 MB. Free memory was 76.3 MB in the beginning and 75.2 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 684.55 ms. Allocated memory is still 107.5 MB. Free memory was 75.1 MB in the beginning and 61.3 MB in the end (delta: 13.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 7.1 GB. * IcfgTransformer took 201.92 ms. Allocated memory was 107.5 MB in the beginning and 126.9 MB in the end (delta: 19.4 MB). Free memory was 61.2 MB in the beginning and 98.5 MB in the end (delta: -37.3 MB). Peak memory consumption was 7.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2892.69 ms. Allocated memory was 126.9 MB in the beginning and 166.2 MB in the end (delta: 39.3 MB). Free memory was 98.2 MB in the beginning and 121.3 MB in the end (delta: -23.1 MB). Peak memory consumption was 16.2 MB. 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, 29 locations, 1 error locations. SAFE Result, 2.8s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 1.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 41 SDtfs, 35 SDslu, 84 SDs, 0 SdLazy, 58 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred 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, 7 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 45 NumberOfCodeBlocks, 45 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 43 ConstructedInterpolants, 5 QuantifiedInterpolants, 3263 SizeOfPredicates, 9 NumberOfNonLiveVariables, 83 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...