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/array2.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1c58c86 [2019-05-15 10:56:00,134 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-05-15 10:56:00,136 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-05-15 10:56:00,148 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-05-15 10:56:00,148 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-05-15 10:56:00,149 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-05-15 10:56:00,151 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-05-15 10:56:00,153 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-05-15 10:56:00,154 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-05-15 10:56:00,155 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-05-15 10:56:00,156 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-05-15 10:56:00,157 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-05-15 10:56:00,158 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-05-15 10:56:00,159 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-05-15 10:56:00,160 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-05-15 10:56:00,161 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-05-15 10:56:00,161 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-05-15 10:56:00,163 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-05-15 10:56:00,166 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-05-15 10:56:00,170 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-05-15 10:56:00,171 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-05-15 10:56:00,173 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-05-15 10:56:00,175 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-05-15 10:56:00,176 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-05-15 10:56:00,176 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-05-15 10:56:00,179 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-05-15 10:56:00,179 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-05-15 10:56:00,182 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-05-15 10:56:00,182 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-05-15 10:56:00,186 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-05-15 10:56:00,188 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-05-15 10:56:00,189 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-05-15 10:56:00,190 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-05-15 10:56:00,191 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-05-15 10:56:00,191 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-05-15 10:56:00,192 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-05-15 10:56:00,192 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-05-15 10:56:00,194 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-05-15 10:56:00,195 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,233 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-05-15 10:56:00,245 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-05-15 10:56:00,248 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-05-15 10:56:00,249 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-05-15 10:56:00,249 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-05-15 10:56:00,250 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array2.i_3.bpl [2019-05-15 10:56:00,250 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array2.i_3.bpl' [2019-05-15 10:56:00,283 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-05-15 10:56:00,284 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-05-15 10:56:00,285 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-05-15 10:56:00,285 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-05-15 10:56:00,285 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-05-15 10:56:00,302 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:00" (1/1) ... [2019-05-15 10:56:00,313 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:00" (1/1) ... [2019-05-15 10:56:00,321 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-05-15 10:56:00,322 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-05-15 10:56:00,322 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-05-15 10:56:00,322 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-05-15 10:56:00,333 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:00" (1/1) ... [2019-05-15 10:56:00,333 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:00" (1/1) ... [2019-05-15 10:56:00,334 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:00" (1/1) ... [2019-05-15 10:56:00,334 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:00" (1/1) ... [2019-05-15 10:56:00,337 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:00" (1/1) ... [2019-05-15 10:56:00,339 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:00" (1/1) ... [2019-05-15 10:56:00,340 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:00" (1/1) ... [2019-05-15 10:56:00,341 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-05-15 10:56:00,342 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-05-15 10:56:00,342 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-05-15 10:56:00,342 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-05-15 10:56:00,343 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array2.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,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-05-15 10:56:00,415 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-05-15 10:56:00,736 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-05-15 10:56:00,736 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-05-15 10:56:00,737 INFO L202 PluginConnector]: Adding new model array2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.05 10:56:00 BoogieIcfgContainer [2019-05-15 10:56:00,738 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-05-15 10:56:00,738 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2019-05-15 10:56:00,738 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2019-05-15 10:56:00,739 INFO L275 PluginConnector]: IcfgTransformer initialized [2019-05-15 10:56:00,743 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.05 10:56:00" (1/1) ... [2019-05-15 10:56:00,828 INFO L632 onniauxMapEliminator]: L40 [2019-05-15 10:56:00,832 INFO L633 onniauxMapEliminator]: In Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~cond_1 |v_ULTIMATE.start___VERIFIER_assert_#in~cond_1|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond_1| (ite (not (= (select v_ULTIMATE.start_main_~A~4_4 1024) (select v_ULTIMATE.start_main_~B~4_4 1024))) 1 0)) (= 0 v_ULTIMATE.start___VERIFIER_assert_~cond_1) (not (< v_ULTIMATE.start_main_~i~4_6 2048))) InVars {ULTIMATE.start_main_~A~4=v_ULTIMATE.start_main_~A~4_4, ULTIMATE.start_main_~B~4=v_ULTIMATE.start_main_~B~4_4, ULTIMATE.start_main_~i~4=v_ULTIMATE.start_main_~i~4_6} OutVars{ULTIMATE.start___VERIFIER_assert_~cond=v_ULTIMATE.start___VERIFIER_assert_~cond_1, ULTIMATE.start___VERIFIER_assert_#in~cond=|v_ULTIMATE.start___VERIFIER_assert_#in~cond_1|, ULTIMATE.start_main_~A~4=v_ULTIMATE.start_main_~A~4_4, ULTIMATE.start_main_~B~4=v_ULTIMATE.start_main_~B~4_4, ULTIMATE.start_main_~i~4=v_ULTIMATE.start_main_~i~4_6} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start___VERIFIER_assert_#in~cond] [2019-05-15 10:56:00,833 INFO L634 onniauxMapEliminator]: Out Formula: (and (or (= 1024 v_ULTIMATE.start_main_~A~4_idx_0_term_1) (not v_ULTIMATE.start_main_~A~4_idx_0_term_assigned_1)) (= v_ULTIMATE.start___VERIFIER_assert_~cond_1 |v_ULTIMATE.start___VERIFIER_assert_#in~cond_1|) (or (= v_ULTIMATE.start_main_~B~4_val_0_in_1 v_v_ULTIMATE.start_main_~B~4_4_aux_1) (not (= v_ULTIMATE.start_main_~B~4_idx_0_term_1 1024))) (= 0 v_ULTIMATE.start___VERIFIER_assert_~cond_1) (= (ite (not (= v_v_ULTIMATE.start_main_~B~4_4_aux_1 v_v_ULTIMATE.start_main_~A~4_4_aux_1)) 1 0) |v_ULTIMATE.start___VERIFIER_assert_#in~cond_1|) v_ULTIMATE.start_main_~B~4_idx_0_term_assigned_1 (or (= v_ULTIMATE.start_main_~B~4_idx_0_term_1 1024) (not v_ULTIMATE.start_main_~B~4_idx_0_term_assigned_1)) (not (< v_ULTIMATE.start_main_~i~4_6 2048)) (or (= v_ULTIMATE.start_main_~A~4_val_0_in_1 v_v_ULTIMATE.start_main_~A~4_4_aux_1) (not (= 1024 v_ULTIMATE.start_main_~A~4_idx_0_term_1))) v_ULTIMATE.start_main_~A~4_idx_0_term_assigned_1) InVars {ULTIMATE.start_main_~A~4_idx_0=v_ULTIMATE.start_main_~A~4_idx_0_term_1, ULTIMATE.start_main_~A~4_val_0=v_ULTIMATE.start_main_~A~4_val_0_in_1, ULTIMATE.start_main_~A~4_idx_0_bool=v_ULTIMATE.start_main_~A~4_idx_0_term_assigned_1, ULTIMATE.start_main_~B~4_idx_0=v_ULTIMATE.start_main_~B~4_idx_0_term_1, ULTIMATE.start_main_~B~4_idx_0_bool=v_ULTIMATE.start_main_~B~4_idx_0_term_assigned_1, ULTIMATE.start_main_~B~4_val_0=v_ULTIMATE.start_main_~B~4_val_0_in_1, ULTIMATE.start_main_~i~4=v_ULTIMATE.start_main_~i~4_6} OutVars{ULTIMATE.start_main_~A~4_idx_0=v_ULTIMATE.start_main_~A~4_idx_0_term_1, ULTIMATE.start_main_~A~4_val_0=v_ULTIMATE.start_main_~A~4_val_0_in_1, ULTIMATE.start___VERIFIER_assert_~cond=v_ULTIMATE.start___VERIFIER_assert_~cond_1, ULTIMATE.start_main_~A~4_idx_0_bool=v_ULTIMATE.start_main_~A~4_idx_0_term_assigned_1, ULTIMATE.start_main_~B~4_idx_0=v_ULTIMATE.start_main_~B~4_idx_0_term_1, ULTIMATE.start___VERIFIER_assert_#in~cond=|v_ULTIMATE.start___VERIFIER_assert_#in~cond_1|, ULTIMATE.start_main_~B~4_idx_0_bool=v_ULTIMATE.start_main_~B~4_idx_0_term_assigned_1, ULTIMATE.start_main_~B~4_val_0=v_ULTIMATE.start_main_~B~4_val_0_in_1, ULTIMATE.start_main_~i~4=v_ULTIMATE.start_main_~i~4_6} AuxVars[v_v_ULTIMATE.start_main_~B~4_4_aux_1, v_v_ULTIMATE.start_main_~A~4_4_aux_1] AssignedVars[ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start___VERIFIER_assert_#in~cond] [2019-05-15 10:56:00,833 INFO L635 onniauxMapEliminator]: L32 [2019-05-15 10:56:00,862 INFO L632 onniauxMapEliminator]: L40 [2019-05-15 10:56:00,862 INFO L633 onniauxMapEliminator]: In Formula: (and (< v_ULTIMATE.start_main_~i~4_8 2048) (= v_ULTIMATE.start_main_~tmp~4_4 (select v_ULTIMATE.start_main_~A~4_5 v_ULTIMATE.start_main_~i~4_8)) (= v_ULTIMATE.start_main_~i~4_7 (+ v_ULTIMATE.start_main_~i~4_8 1)) (= v_ULTIMATE.start_main_~B~4_5 (store v_ULTIMATE.start_main_~B~4_6 v_ULTIMATE.start_main_~i~4_8 v_ULTIMATE.start_main_~tmp~4_4))) InVars {ULTIMATE.start_main_~A~4=v_ULTIMATE.start_main_~A~4_5, ULTIMATE.start_main_~B~4=v_ULTIMATE.start_main_~B~4_6, ULTIMATE.start_main_~i~4=v_ULTIMATE.start_main_~i~4_8} OutVars{ULTIMATE.start_main_~tmp~4=v_ULTIMATE.start_main_~tmp~4_4, ULTIMATE.start_main_#t~post0=|v_ULTIMATE.start_main_#t~post0_2|, ULTIMATE.start_main_~A~4=v_ULTIMATE.start_main_~A~4_5, ULTIMATE.start_main_~B~4=v_ULTIMATE.start_main_~B~4_5, ULTIMATE.start_main_~i~4=v_ULTIMATE.start_main_~i~4_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~tmp~4, ULTIMATE.start_main_#t~post0, ULTIMATE.start_main_~B~4, ULTIMATE.start_main_~i~4] [2019-05-15 10:56:00,863 INFO L634 onniauxMapEliminator]: Out Formula: (and (< v_ULTIMATE.start_main_~i~4_8 2048) (or (= v_ULTIMATE.start_main_~B~4_idx_0_term_2 v_ULTIMATE.start_main_~i~4_8) (not v_ULTIMATE.start_main_~B~4_idx_0_term_assigned_1)) (= v_ULTIMATE.start_main_~A~4_val_0_out_1 v_ULTIMATE.start_main_~A~4_val_0_in_2) (or (= v_ULTIMATE.start_main_~A~4_val_0_out_1 v_v_ULTIMATE.start_main_~A~4_5_aux_1) (not (= v_ULTIMATE.start_main_~A~4_idx_0_term_2 v_ULTIMATE.start_main_~i~4_8))) (= v_ULTIMATE.start_main_~i~4_7 (+ v_ULTIMATE.start_main_~i~4_8 1)) (= v_ULTIMATE.start_main_~tmp~4_4 v_v_ULTIMATE.start_main_~A~4_5_aux_1) (= v_ULTIMATE.start_main_~B~4_val_0_in_2 v_ULTIMATE.start_main_~B~4_val_0_out_1) (or (= v_ULTIMATE.start_main_~B~4_val_0_in_2 v_ULTIMATE.start_main_~tmp~4_4) (not (= v_ULTIMATE.start_main_~B~4_idx_0_term_2 v_ULTIMATE.start_main_~i~4_8))) v_ULTIMATE.start_main_~B~4_idx_0_term_assigned_1 v_ULTIMATE.start_main_~A~4_idx_0_term_assigned_1 (or (= v_ULTIMATE.start_main_~A~4_idx_0_term_2 v_ULTIMATE.start_main_~i~4_8) (not v_ULTIMATE.start_main_~A~4_idx_0_term_assigned_1))) InVars {ULTIMATE.start_main_~A~4_idx_0=v_ULTIMATE.start_main_~A~4_idx_0_term_2, ULTIMATE.start_main_~A~4_val_0=v_ULTIMATE.start_main_~A~4_val_0_in_2, ULTIMATE.start_main_~A~4_idx_0_bool=v_ULTIMATE.start_main_~A~4_idx_0_term_assigned_1, ULTIMATE.start_main_~B~4_idx_0=v_ULTIMATE.start_main_~B~4_idx_0_term_2, ULTIMATE.start_main_~B~4_idx_0_bool=v_ULTIMATE.start_main_~B~4_idx_0_term_assigned_1, ULTIMATE.start_main_~B~4_val_0=v_ULTIMATE.start_main_~B~4_val_0_in_2, ULTIMATE.start_main_~i~4=v_ULTIMATE.start_main_~i~4_8} OutVars{ULTIMATE.start_main_~A~4_idx_0=v_ULTIMATE.start_main_~A~4_idx_0_term_2, ULTIMATE.start_main_~A~4_val_0=v_ULTIMATE.start_main_~A~4_val_0_out_1, ULTIMATE.start_main_~tmp~4=v_ULTIMATE.start_main_~tmp~4_4, ULTIMATE.start_main_~A~4_idx_0_bool=v_ULTIMATE.start_main_~A~4_idx_0_term_assigned_1, ULTIMATE.start_main_~B~4_idx_0=v_ULTIMATE.start_main_~B~4_idx_0_term_2, ULTIMATE.start_main_#t~post0=|v_ULTIMATE.start_main_#t~post0_2|, ULTIMATE.start_main_~B~4_idx_0_bool=v_ULTIMATE.start_main_~B~4_idx_0_term_assigned_1, ULTIMATE.start_main_~B~4_val_0=v_ULTIMATE.start_main_~B~4_val_0_out_1, ULTIMATE.start_main_~i~4=v_ULTIMATE.start_main_~i~4_7} AuxVars[v_v_ULTIMATE.start_main_~A~4_5_aux_1] AssignedVars[ULTIMATE.start_main_~A~4_val_0, ULTIMATE.start_main_~tmp~4, ULTIMATE.start_main_#t~post0, ULTIMATE.start_main_~B~4_val_0, ULTIMATE.start_main_~i~4] [2019-05-15 10:56:00,863 INFO L635 onniauxMapEliminator]: L40 [2019-05-15 10:56:00,919 INFO L202 PluginConnector]: Adding new model array2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.05 10:56:00 BasicIcfg [2019-05-15 10:56:00,919 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2019-05-15 10:56:00,920 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-05-15 10:56:00,921 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-05-15 10:56:00,924 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-05-15 10:56:00,924 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:00" (1/3) ... [2019-05-15 10:56:00,925 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35ed8f79 and model type array2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.05 10:56:00, skipping insertion in model container [2019-05-15 10:56:00,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.05 10:56:00" (2/3) ... [2019-05-15 10:56:00,926 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35ed8f79 and model type array2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.05 10:56:00, skipping insertion in model container [2019-05-15 10:56:00,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.05 10:56:00" (3/3) ... [2019-05-15 10:56:00,928 INFO L109 eAbstractionObserver]: Analyzing ICFG array2.i_3.bplME [2019-05-15 10:56:00,937 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-05-15 10:56:00,945 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-05-15 10:56:00,958 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-05-15 10:56:00,981 INFO L127 ementStrategyFactory]: Using default assertion order modulation [2019-05-15 10:56:00,982 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-05-15 10:56:00,983 INFO L378 AbstractCegarLoop]: Hoare is false [2019-05-15 10:56:00,983 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-05-15 10:56:00,983 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-05-15 10:56:00,983 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-05-15 10:56:00,983 INFO L382 AbstractCegarLoop]: Difference is false [2019-05-15 10:56:00,983 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-05-15 10:56:00,984 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-05-15 10:56:00,998 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-05-15 10:56:01,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-05-15 10:56:01,007 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:56:01,008 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-05-15 10:56:01,011 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:56:01,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:56:01,017 INFO L82 PathProgramCache]: Analyzing trace with hash 42734, now seen corresponding path program 1 times [2019-05-15 10:56:01,068 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:56:01,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:56:01,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-05-15 10:56:01,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:56:01,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:56:01,226 INFO L273 TraceCheckUtils]: 0: Hoare triple {8#true} [13] ULTIMATE.startENTRY-->L40: Formula: (= v_ULTIMATE.start_main_~i~4_1 0) InVars {} OutVars{ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~tmp~4=v_ULTIMATE.start_main_~tmp~4_1, ULTIMATE.start_main_~A~4=v_ULTIMATE.start_main_~A~4_1, ULTIMATE.start_main_#t~post0=|v_ULTIMATE.start_main_#t~post0_1|, ULTIMATE.start_main_~B~4=v_ULTIMATE.start_main_~B~4_1, ULTIMATE.start_main_~i~4=v_ULTIMATE.start_main_~i~4_1} AuxVars[] AssignedVars[ULTIMATE.start_main_#res, ULTIMATE.start_main_~tmp~4, ULTIMATE.start_main_~A~4, ULTIMATE.start_main_#t~post0, ULTIMATE.start_main_~B~4, ULTIMATE.start_main_~i~4] {13#(<= ULTIMATE.start_main_~i~4 0)} is VALID [2019-05-15 10:56:01,231 INFO L273 TraceCheckUtils]: 1: Hoare triple {13#(<= ULTIMATE.start_main_~i~4 0)} [14] L40-->L32: Formula: (let ((.cse1 (= v_ULTIMATE.start_main_~B~4_idx_0_term_1 1024)) (.cse0 (= 1024 v_ULTIMATE.start_main_~A~4_idx_0_term_1))) (and (or .cse0 (not v_ULTIMATE.start_main_~A~4_idx_0_term_assigned_1)) (= v_ULTIMATE.start___VERIFIER_assert_~cond_1 |v_ULTIMATE.start___VERIFIER_assert_#in~cond_1|) (or (= v_ULTIMATE.start_main_~B~4_val_0_in_1 v_v_ULTIMATE.start_main_~B~4_4_aux_1) (not .cse1)) (= 0 v_ULTIMATE.start___VERIFIER_assert_~cond_1) (= (ite (not (= v_v_ULTIMATE.start_main_~B~4_4_aux_1 v_v_ULTIMATE.start_main_~A~4_4_aux_1)) 1 0) |v_ULTIMATE.start___VERIFIER_assert_#in~cond_1|) v_ULTIMATE.start_main_~B~4_idx_0_term_assigned_1 (or .cse1 (not v_ULTIMATE.start_main_~B~4_idx_0_term_assigned_1)) (not (< v_ULTIMATE.start_main_~i~4_6 2048)) (or (= v_ULTIMATE.start_main_~A~4_val_0_in_1 v_v_ULTIMATE.start_main_~A~4_4_aux_1) (not .cse0)) v_ULTIMATE.start_main_~A~4_idx_0_term_assigned_1)) InVars {ULTIMATE.start_main_~A~4_idx_0=v_ULTIMATE.start_main_~A~4_idx_0_term_1, ULTIMATE.start_main_~A~4_val_0=v_ULTIMATE.start_main_~A~4_val_0_in_1, ULTIMATE.start_main_~A~4_idx_0_bool=v_ULTIMATE.start_main_~A~4_idx_0_term_assigned_1, ULTIMATE.start_main_~B~4_idx_0=v_ULTIMATE.start_main_~B~4_idx_0_term_1, ULTIMATE.start_main_~B~4_idx_0_bool=v_ULTIMATE.start_main_~B~4_idx_0_term_assigned_1, ULTIMATE.start_main_~B~4_val_0=v_ULTIMATE.start_main_~B~4_val_0_in_1, ULTIMATE.start_main_~i~4=v_ULTIMATE.start_main_~i~4_6} OutVars{ULTIMATE.start_main_~A~4_idx_0=v_ULTIMATE.start_main_~A~4_idx_0_term_1, ULTIMATE.start_main_~A~4_val_0=v_ULTIMATE.start_main_~A~4_val_0_in_1, ULTIMATE.start___VERIFIER_assert_~cond=v_ULTIMATE.start___VERIFIER_assert_~cond_1, ULTIMATE.start_main_~A~4_idx_0_bool=v_ULTIMATE.start_main_~A~4_idx_0_term_assigned_1, ULTIMATE.start_main_~B~4_idx_0=v_ULTIMATE.start_main_~B~4_idx_0_term_1, ULTIMATE.start___VERIFIER_assert_#in~cond=|v_ULTIMATE.start___VERIFIER_assert_#in~cond_1|, ULTIMATE.start_main_~B~4_idx_0_bool=v_ULTIMATE.start_main_~B~4_idx_0_term_assigned_1, ULTIMATE.start_main_~B~4_val_0=v_ULTIMATE.start_main_~B~4_val_0_in_1, ULTIMATE.start_main_~i~4=v_ULTIMATE.start_main_~i~4_6} AuxVars[v_v_ULTIMATE.start_main_~B~4_4_aux_1, v_v_ULTIMATE.start_main_~A~4_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,232 INFO L273 TraceCheckUtils]: 2: Hoare triple {9#false} [16] L32-->ULTIMATE.startErr0ASSERT_VIOLATIONASSERT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9#false} is VALID [2019-05-15 10:56:01,234 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,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-05-15 10:56:01,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-05-15 10:56:01,241 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-05-15 10:56:01,243 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:56:01,246 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-05-15 10:56:01,275 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,276 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-05-15 10:56:01,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-05-15 10:56:01,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-05-15 10:56:01,287 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-05-15 10:56:01,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:56:01,368 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-05-15 10:56:01,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-05-15 10:56:01,369 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-05-15 10:56:01,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:56:01,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-05-15 10:56:01,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-05-15 10:56:01,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-05-15 10:56:01,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-05-15 10:56:01,377 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 7 transitions. [2019-05-15 10:56:01,428 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,442 INFO L225 Difference]: With dead ends: 5 [2019-05-15 10:56:01,443 INFO L226 Difference]: Without dead ends: 5 [2019-05-15 10:56:01,445 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,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-05-15 10:56:01,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-05-15 10:56:01,468 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:56:01,468 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5 states. Second operand 5 states. [2019-05-15 10:56:01,469 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states. [2019-05-15 10:56:01,469 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states. [2019-05-15 10:56:01,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:56:01,471 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-05-15 10:56:01,471 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-05-15 10:56:01,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:56:01,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:56:01,472 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states. [2019-05-15 10:56:01,472 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states. [2019-05-15 10:56:01,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:56:01,474 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-05-15 10:56:01,474 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-05-15 10:56:01,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:56:01,474 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:56:01,475 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:56:01,475 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:56:01,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-05-15 10:56:01,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-05-15 10:56:01,478 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-05-15 10:56:01,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:56:01,478 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-05-15 10:56:01,478 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-05-15 10:56:01,479 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-05-15 10:56:01,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-05-15 10:56:01,479 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:56:01,479 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-05-15 10:56:01,480 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:56:01,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:56:01,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1325669, now seen corresponding path program 1 times [2019-05-15 10:56:01,481 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:56:01,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:56:01,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 3 conjunts are in the unsatisfiable core [2019-05-15 10:56:01,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:56:01,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:56:01,709 INFO L273 TraceCheckUtils]: 0: Hoare triple {39#true} [13] ULTIMATE.startENTRY-->L40: Formula: (= v_ULTIMATE.start_main_~i~4_1 0) InVars {} OutVars{ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~tmp~4=v_ULTIMATE.start_main_~tmp~4_1, ULTIMATE.start_main_~A~4=v_ULTIMATE.start_main_~A~4_1, ULTIMATE.start_main_#t~post0=|v_ULTIMATE.start_main_#t~post0_1|, ULTIMATE.start_main_~B~4=v_ULTIMATE.start_main_~B~4_1, ULTIMATE.start_main_~i~4=v_ULTIMATE.start_main_~i~4_1} AuxVars[] AssignedVars[ULTIMATE.start_main_#res, ULTIMATE.start_main_~tmp~4, ULTIMATE.start_main_~A~4, ULTIMATE.start_main_#t~post0, ULTIMATE.start_main_~B~4, ULTIMATE.start_main_~i~4] {44#(<= ULTIMATE.start_main_~i~4 0)} is VALID [2019-05-15 10:56:01,710 INFO L273 TraceCheckUtils]: 1: Hoare triple {44#(<= ULTIMATE.start_main_~i~4 0)} [15] L40-->L40: Formula: (let ((.cse0 (= v_ULTIMATE.start_main_~B~4_idx_0_term_2 v_ULTIMATE.start_main_~i~4_8)) (.cse1 (= v_ULTIMATE.start_main_~A~4_idx_0_term_2 v_ULTIMATE.start_main_~i~4_8))) (and (< v_ULTIMATE.start_main_~i~4_8 2048) (or .cse0 (not v_ULTIMATE.start_main_~B~4_idx_0_term_assigned_1)) (= v_ULTIMATE.start_main_~A~4_val_0_out_1 v_ULTIMATE.start_main_~A~4_val_0_in_2) (or (= v_ULTIMATE.start_main_~A~4_val_0_out_1 v_v_ULTIMATE.start_main_~A~4_5_aux_1) (not .cse1)) (= v_ULTIMATE.start_main_~i~4_7 (+ v_ULTIMATE.start_main_~i~4_8 1)) (= v_ULTIMATE.start_main_~tmp~4_4 v_v_ULTIMATE.start_main_~A~4_5_aux_1) (= v_ULTIMATE.start_main_~B~4_val_0_in_2 v_ULTIMATE.start_main_~B~4_val_0_out_1) (or (= v_ULTIMATE.start_main_~B~4_val_0_in_2 v_ULTIMATE.start_main_~tmp~4_4) (not .cse0)) v_ULTIMATE.start_main_~B~4_idx_0_term_assigned_1 v_ULTIMATE.start_main_~A~4_idx_0_term_assigned_1 (or .cse1 (not v_ULTIMATE.start_main_~A~4_idx_0_term_assigned_1)))) InVars {ULTIMATE.start_main_~A~4_idx_0=v_ULTIMATE.start_main_~A~4_idx_0_term_2, ULTIMATE.start_main_~A~4_val_0=v_ULTIMATE.start_main_~A~4_val_0_in_2, ULTIMATE.start_main_~A~4_idx_0_bool=v_ULTIMATE.start_main_~A~4_idx_0_term_assigned_1, ULTIMATE.start_main_~B~4_idx_0=v_ULTIMATE.start_main_~B~4_idx_0_term_2, ULTIMATE.start_main_~B~4_idx_0_bool=v_ULTIMATE.start_main_~B~4_idx_0_term_assigned_1, ULTIMATE.start_main_~B~4_val_0=v_ULTIMATE.start_main_~B~4_val_0_in_2, ULTIMATE.start_main_~i~4=v_ULTIMATE.start_main_~i~4_8} OutVars{ULTIMATE.start_main_~A~4_idx_0=v_ULTIMATE.start_main_~A~4_idx_0_term_2, ULTIMATE.start_main_~A~4_val_0=v_ULTIMATE.start_main_~A~4_val_0_out_1, ULTIMATE.start_main_~tmp~4=v_ULTIMATE.start_main_~tmp~4_4, ULTIMATE.start_main_~A~4_idx_0_bool=v_ULTIMATE.start_main_~A~4_idx_0_term_assigned_1, ULTIMATE.start_main_~B~4_idx_0=v_ULTIMATE.start_main_~B~4_idx_0_term_2, ULTIMATE.start_main_#t~post0=|v_ULTIMATE.start_main_#t~post0_2|, ULTIMATE.start_main_~B~4_idx_0_bool=v_ULTIMATE.start_main_~B~4_idx_0_term_assigned_1, ULTIMATE.start_main_~B~4_val_0=v_ULTIMATE.start_main_~B~4_val_0_out_1, ULTIMATE.start_main_~i~4=v_ULTIMATE.start_main_~i~4_7} AuxVars[v_v_ULTIMATE.start_main_~A~4_5_aux_1] AssignedVars[ULTIMATE.start_main_~A~4_val_0, ULTIMATE.start_main_~tmp~4, ULTIMATE.start_main_#t~post0, ULTIMATE.start_main_~B~4_val_0, ULTIMATE.start_main_~i~4] {48#(<= ULTIMATE.start_main_~i~4 1)} is VALID [2019-05-15 10:56:01,720 INFO L273 TraceCheckUtils]: 2: Hoare triple {48#(<= ULTIMATE.start_main_~i~4 1)} [14] L40-->L32: Formula: (let ((.cse1 (= v_ULTIMATE.start_main_~B~4_idx_0_term_1 1024)) (.cse0 (= 1024 v_ULTIMATE.start_main_~A~4_idx_0_term_1))) (and (or .cse0 (not v_ULTIMATE.start_main_~A~4_idx_0_term_assigned_1)) (= v_ULTIMATE.start___VERIFIER_assert_~cond_1 |v_ULTIMATE.start___VERIFIER_assert_#in~cond_1|) (or (= v_ULTIMATE.start_main_~B~4_val_0_in_1 v_v_ULTIMATE.start_main_~B~4_4_aux_1) (not .cse1)) (= 0 v_ULTIMATE.start___VERIFIER_assert_~cond_1) (= (ite (not (= v_v_ULTIMATE.start_main_~B~4_4_aux_1 v_v_ULTIMATE.start_main_~A~4_4_aux_1)) 1 0) |v_ULTIMATE.start___VERIFIER_assert_#in~cond_1|) v_ULTIMATE.start_main_~B~4_idx_0_term_assigned_1 (or .cse1 (not v_ULTIMATE.start_main_~B~4_idx_0_term_assigned_1)) (not (< v_ULTIMATE.start_main_~i~4_6 2048)) (or (= v_ULTIMATE.start_main_~A~4_val_0_in_1 v_v_ULTIMATE.start_main_~A~4_4_aux_1) (not .cse0)) v_ULTIMATE.start_main_~A~4_idx_0_term_assigned_1)) InVars {ULTIMATE.start_main_~A~4_idx_0=v_ULTIMATE.start_main_~A~4_idx_0_term_1, ULTIMATE.start_main_~A~4_val_0=v_ULTIMATE.start_main_~A~4_val_0_in_1, ULTIMATE.start_main_~A~4_idx_0_bool=v_ULTIMATE.start_main_~A~4_idx_0_term_assigned_1, ULTIMATE.start_main_~B~4_idx_0=v_ULTIMATE.start_main_~B~4_idx_0_term_1, ULTIMATE.start_main_~B~4_idx_0_bool=v_ULTIMATE.start_main_~B~4_idx_0_term_assigned_1, ULTIMATE.start_main_~B~4_val_0=v_ULTIMATE.start_main_~B~4_val_0_in_1, ULTIMATE.start_main_~i~4=v_ULTIMATE.start_main_~i~4_6} OutVars{ULTIMATE.start_main_~A~4_idx_0=v_ULTIMATE.start_main_~A~4_idx_0_term_1, ULTIMATE.start_main_~A~4_val_0=v_ULTIMATE.start_main_~A~4_val_0_in_1, ULTIMATE.start___VERIFIER_assert_~cond=v_ULTIMATE.start___VERIFIER_assert_~cond_1, ULTIMATE.start_main_~A~4_idx_0_bool=v_ULTIMATE.start_main_~A~4_idx_0_term_assigned_1, ULTIMATE.start_main_~B~4_idx_0=v_ULTIMATE.start_main_~B~4_idx_0_term_1, ULTIMATE.start___VERIFIER_assert_#in~cond=|v_ULTIMATE.start___VERIFIER_assert_#in~cond_1|, ULTIMATE.start_main_~B~4_idx_0_bool=v_ULTIMATE.start_main_~B~4_idx_0_term_assigned_1, ULTIMATE.start_main_~B~4_val_0=v_ULTIMATE.start_main_~B~4_val_0_in_1, ULTIMATE.start_main_~i~4=v_ULTIMATE.start_main_~i~4_6} AuxVars[v_v_ULTIMATE.start_main_~B~4_4_aux_1, v_v_ULTIMATE.start_main_~A~4_4_aux_1] AssignedVars[ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start___VERIFIER_assert_#in~cond] {40#false} is VALID [2019-05-15 10:56:01,721 INFO L273 TraceCheckUtils]: 3: Hoare triple {40#false} [16] L32-->ULTIMATE.startErr0ASSERT_VIOLATIONASSERT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40#false} is VALID [2019-05-15 10:56:01,722 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:56:01,722 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:56:01,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-05-15 10:56:01,724 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-05-15 10:56:01,724 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:56:01,725 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-05-15 10:56:01,756 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:01,756 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-05-15 10:56:01,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-05-15 10:56:01,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-05-15 10:56:01,757 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-05-15 10:56:01,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:56:01,858 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-05-15 10:56:01,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-05-15 10:56:01,858 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-05-15 10:56:01,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:56:01,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-05-15 10:56:01,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2019-05-15 10:56:01,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-05-15 10:56:01,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2019-05-15 10:56:01,864 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 7 transitions. [2019-05-15 10:56:01,966 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,967 INFO L225 Difference]: With dead ends: 6 [2019-05-15 10:56:01,967 INFO L226 Difference]: Without dead ends: 6 [2019-05-15 10:56:01,969 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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:56:01,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-05-15 10:56:01,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-05-15 10:56:01,970 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:56:01,971 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6 states. Second operand 6 states. [2019-05-15 10:56:01,972 INFO L74 IsIncluded]: Start isIncluded. First operand 6 states. Second operand 6 states. [2019-05-15 10:56:01,972 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 6 states. [2019-05-15 10:56:01,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:56:01,974 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-05-15 10:56:01,974 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-05-15 10:56:01,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:56:01,974 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:56:01,974 INFO L74 IsIncluded]: Start isIncluded. First operand 6 states. Second operand 6 states. [2019-05-15 10:56:01,975 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 6 states. [2019-05-15 10:56:01,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:56:01,977 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-05-15 10:56:01,977 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-05-15 10:56:01,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:56:01,977 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:56:01,978 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:56:01,978 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:56:01,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-05-15 10:56:01,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-05-15 10:56:01,981 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-05-15 10:56:01,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:56:01,981 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-05-15 10:56:01,981 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-05-15 10:56:01,981 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-05-15 10:56:01,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-05-15 10:56:01,982 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:56:01,982 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-05-15 10:56:01,982 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:56:01,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:56:01,983 INFO L82 PathProgramCache]: Analyzing trace with hash 41096654, now seen corresponding path program 2 times [2019-05-15 10:56:01,984 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:56:02,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:56:02,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 4 conjunts are in the unsatisfiable core [2019-05-15 10:56:02,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:56:02,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:56:02,174 INFO L273 TraceCheckUtils]: 0: Hoare triple {78#true} [13] ULTIMATE.startENTRY-->L40: Formula: (= v_ULTIMATE.start_main_~i~4_1 0) InVars {} OutVars{ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~tmp~4=v_ULTIMATE.start_main_~tmp~4_1, ULTIMATE.start_main_~A~4=v_ULTIMATE.start_main_~A~4_1, ULTIMATE.start_main_#t~post0=|v_ULTIMATE.start_main_#t~post0_1|, ULTIMATE.start_main_~B~4=v_ULTIMATE.start_main_~B~4_1, ULTIMATE.start_main_~i~4=v_ULTIMATE.start_main_~i~4_1} AuxVars[] AssignedVars[ULTIMATE.start_main_#res, ULTIMATE.start_main_~tmp~4, ULTIMATE.start_main_~A~4, ULTIMATE.start_main_#t~post0, ULTIMATE.start_main_~B~4, ULTIMATE.start_main_~i~4] {83#(<= ULTIMATE.start_main_~i~4 0)} is VALID [2019-05-15 10:56:02,177 INFO L273 TraceCheckUtils]: 1: Hoare triple {83#(<= ULTIMATE.start_main_~i~4 0)} [15] L40-->L40: Formula: (let ((.cse0 (= v_ULTIMATE.start_main_~B~4_idx_0_term_2 v_ULTIMATE.start_main_~i~4_8)) (.cse1 (= v_ULTIMATE.start_main_~A~4_idx_0_term_2 v_ULTIMATE.start_main_~i~4_8))) (and (< v_ULTIMATE.start_main_~i~4_8 2048) (or .cse0 (not v_ULTIMATE.start_main_~B~4_idx_0_term_assigned_1)) (= v_ULTIMATE.start_main_~A~4_val_0_out_1 v_ULTIMATE.start_main_~A~4_val_0_in_2) (or (= v_ULTIMATE.start_main_~A~4_val_0_out_1 v_v_ULTIMATE.start_main_~A~4_5_aux_1) (not .cse1)) (= v_ULTIMATE.start_main_~i~4_7 (+ v_ULTIMATE.start_main_~i~4_8 1)) (= v_ULTIMATE.start_main_~tmp~4_4 v_v_ULTIMATE.start_main_~A~4_5_aux_1) (= v_ULTIMATE.start_main_~B~4_val_0_in_2 v_ULTIMATE.start_main_~B~4_val_0_out_1) (or (= v_ULTIMATE.start_main_~B~4_val_0_in_2 v_ULTIMATE.start_main_~tmp~4_4) (not .cse0)) v_ULTIMATE.start_main_~B~4_idx_0_term_assigned_1 v_ULTIMATE.start_main_~A~4_idx_0_term_assigned_1 (or .cse1 (not v_ULTIMATE.start_main_~A~4_idx_0_term_assigned_1)))) InVars {ULTIMATE.start_main_~A~4_idx_0=v_ULTIMATE.start_main_~A~4_idx_0_term_2, ULTIMATE.start_main_~A~4_val_0=v_ULTIMATE.start_main_~A~4_val_0_in_2, ULTIMATE.start_main_~A~4_idx_0_bool=v_ULTIMATE.start_main_~A~4_idx_0_term_assigned_1, ULTIMATE.start_main_~B~4_idx_0=v_ULTIMATE.start_main_~B~4_idx_0_term_2, ULTIMATE.start_main_~B~4_idx_0_bool=v_ULTIMATE.start_main_~B~4_idx_0_term_assigned_1, ULTIMATE.start_main_~B~4_val_0=v_ULTIMATE.start_main_~B~4_val_0_in_2, ULTIMATE.start_main_~i~4=v_ULTIMATE.start_main_~i~4_8} OutVars{ULTIMATE.start_main_~A~4_idx_0=v_ULTIMATE.start_main_~A~4_idx_0_term_2, ULTIMATE.start_main_~A~4_val_0=v_ULTIMATE.start_main_~A~4_val_0_out_1, ULTIMATE.start_main_~tmp~4=v_ULTIMATE.start_main_~tmp~4_4, ULTIMATE.start_main_~A~4_idx_0_bool=v_ULTIMATE.start_main_~A~4_idx_0_term_assigned_1, ULTIMATE.start_main_~B~4_idx_0=v_ULTIMATE.start_main_~B~4_idx_0_term_2, ULTIMATE.start_main_#t~post0=|v_ULTIMATE.start_main_#t~post0_2|, ULTIMATE.start_main_~B~4_idx_0_bool=v_ULTIMATE.start_main_~B~4_idx_0_term_assigned_1, ULTIMATE.start_main_~B~4_val_0=v_ULTIMATE.start_main_~B~4_val_0_out_1, ULTIMATE.start_main_~i~4=v_ULTIMATE.start_main_~i~4_7} AuxVars[v_v_ULTIMATE.start_main_~A~4_5_aux_1] AssignedVars[ULTIMATE.start_main_~A~4_val_0, ULTIMATE.start_main_~tmp~4, ULTIMATE.start_main_#t~post0, ULTIMATE.start_main_~B~4_val_0, ULTIMATE.start_main_~i~4] {87#(and (<= ULTIMATE.start_main_~A~4_idx_0 0) ULTIMATE.start_main_~A~4_idx_0_bool)} is VALID [2019-05-15 10:56:02,187 INFO L273 TraceCheckUtils]: 2: Hoare triple {87#(and (<= ULTIMATE.start_main_~A~4_idx_0 0) ULTIMATE.start_main_~A~4_idx_0_bool)} [15] L40-->L40: Formula: (let ((.cse0 (= v_ULTIMATE.start_main_~B~4_idx_0_term_2 v_ULTIMATE.start_main_~i~4_8)) (.cse1 (= v_ULTIMATE.start_main_~A~4_idx_0_term_2 v_ULTIMATE.start_main_~i~4_8))) (and (< v_ULTIMATE.start_main_~i~4_8 2048) (or .cse0 (not v_ULTIMATE.start_main_~B~4_idx_0_term_assigned_1)) (= v_ULTIMATE.start_main_~A~4_val_0_out_1 v_ULTIMATE.start_main_~A~4_val_0_in_2) (or (= v_ULTIMATE.start_main_~A~4_val_0_out_1 v_v_ULTIMATE.start_main_~A~4_5_aux_1) (not .cse1)) (= v_ULTIMATE.start_main_~i~4_7 (+ v_ULTIMATE.start_main_~i~4_8 1)) (= v_ULTIMATE.start_main_~tmp~4_4 v_v_ULTIMATE.start_main_~A~4_5_aux_1) (= v_ULTIMATE.start_main_~B~4_val_0_in_2 v_ULTIMATE.start_main_~B~4_val_0_out_1) (or (= v_ULTIMATE.start_main_~B~4_val_0_in_2 v_ULTIMATE.start_main_~tmp~4_4) (not .cse0)) v_ULTIMATE.start_main_~B~4_idx_0_term_assigned_1 v_ULTIMATE.start_main_~A~4_idx_0_term_assigned_1 (or .cse1 (not v_ULTIMATE.start_main_~A~4_idx_0_term_assigned_1)))) InVars {ULTIMATE.start_main_~A~4_idx_0=v_ULTIMATE.start_main_~A~4_idx_0_term_2, ULTIMATE.start_main_~A~4_val_0=v_ULTIMATE.start_main_~A~4_val_0_in_2, ULTIMATE.start_main_~A~4_idx_0_bool=v_ULTIMATE.start_main_~A~4_idx_0_term_assigned_1, ULTIMATE.start_main_~B~4_idx_0=v_ULTIMATE.start_main_~B~4_idx_0_term_2, ULTIMATE.start_main_~B~4_idx_0_bool=v_ULTIMATE.start_main_~B~4_idx_0_term_assigned_1, ULTIMATE.start_main_~B~4_val_0=v_ULTIMATE.start_main_~B~4_val_0_in_2, ULTIMATE.start_main_~i~4=v_ULTIMATE.start_main_~i~4_8} OutVars{ULTIMATE.start_main_~A~4_idx_0=v_ULTIMATE.start_main_~A~4_idx_0_term_2, ULTIMATE.start_main_~A~4_val_0=v_ULTIMATE.start_main_~A~4_val_0_out_1, ULTIMATE.start_main_~tmp~4=v_ULTIMATE.start_main_~tmp~4_4, ULTIMATE.start_main_~A~4_idx_0_bool=v_ULTIMATE.start_main_~A~4_idx_0_term_assigned_1, ULTIMATE.start_main_~B~4_idx_0=v_ULTIMATE.start_main_~B~4_idx_0_term_2, ULTIMATE.start_main_#t~post0=|v_ULTIMATE.start_main_#t~post0_2|, ULTIMATE.start_main_~B~4_idx_0_bool=v_ULTIMATE.start_main_~B~4_idx_0_term_assigned_1, ULTIMATE.start_main_~B~4_val_0=v_ULTIMATE.start_main_~B~4_val_0_out_1, ULTIMATE.start_main_~i~4=v_ULTIMATE.start_main_~i~4_7} AuxVars[v_v_ULTIMATE.start_main_~A~4_5_aux_1] AssignedVars[ULTIMATE.start_main_~A~4_val_0, ULTIMATE.start_main_~tmp~4, ULTIMATE.start_main_#t~post0, ULTIMATE.start_main_~B~4_val_0, ULTIMATE.start_main_~i~4] {87#(and (<= ULTIMATE.start_main_~A~4_idx_0 0) ULTIMATE.start_main_~A~4_idx_0_bool)} is VALID [2019-05-15 10:56:02,189 INFO L273 TraceCheckUtils]: 3: Hoare triple {87#(and (<= ULTIMATE.start_main_~A~4_idx_0 0) ULTIMATE.start_main_~A~4_idx_0_bool)} [14] L40-->L32: Formula: (let ((.cse1 (= v_ULTIMATE.start_main_~B~4_idx_0_term_1 1024)) (.cse0 (= 1024 v_ULTIMATE.start_main_~A~4_idx_0_term_1))) (and (or .cse0 (not v_ULTIMATE.start_main_~A~4_idx_0_term_assigned_1)) (= v_ULTIMATE.start___VERIFIER_assert_~cond_1 |v_ULTIMATE.start___VERIFIER_assert_#in~cond_1|) (or (= v_ULTIMATE.start_main_~B~4_val_0_in_1 v_v_ULTIMATE.start_main_~B~4_4_aux_1) (not .cse1)) (= 0 v_ULTIMATE.start___VERIFIER_assert_~cond_1) (= (ite (not (= v_v_ULTIMATE.start_main_~B~4_4_aux_1 v_v_ULTIMATE.start_main_~A~4_4_aux_1)) 1 0) |v_ULTIMATE.start___VERIFIER_assert_#in~cond_1|) v_ULTIMATE.start_main_~B~4_idx_0_term_assigned_1 (or .cse1 (not v_ULTIMATE.start_main_~B~4_idx_0_term_assigned_1)) (not (< v_ULTIMATE.start_main_~i~4_6 2048)) (or (= v_ULTIMATE.start_main_~A~4_val_0_in_1 v_v_ULTIMATE.start_main_~A~4_4_aux_1) (not .cse0)) v_ULTIMATE.start_main_~A~4_idx_0_term_assigned_1)) InVars {ULTIMATE.start_main_~A~4_idx_0=v_ULTIMATE.start_main_~A~4_idx_0_term_1, ULTIMATE.start_main_~A~4_val_0=v_ULTIMATE.start_main_~A~4_val_0_in_1, ULTIMATE.start_main_~A~4_idx_0_bool=v_ULTIMATE.start_main_~A~4_idx_0_term_assigned_1, ULTIMATE.start_main_~B~4_idx_0=v_ULTIMATE.start_main_~B~4_idx_0_term_1, ULTIMATE.start_main_~B~4_idx_0_bool=v_ULTIMATE.start_main_~B~4_idx_0_term_assigned_1, ULTIMATE.start_main_~B~4_val_0=v_ULTIMATE.start_main_~B~4_val_0_in_1, ULTIMATE.start_main_~i~4=v_ULTIMATE.start_main_~i~4_6} OutVars{ULTIMATE.start_main_~A~4_idx_0=v_ULTIMATE.start_main_~A~4_idx_0_term_1, ULTIMATE.start_main_~A~4_val_0=v_ULTIMATE.start_main_~A~4_val_0_in_1, ULTIMATE.start___VERIFIER_assert_~cond=v_ULTIMATE.start___VERIFIER_assert_~cond_1, ULTIMATE.start_main_~A~4_idx_0_bool=v_ULTIMATE.start_main_~A~4_idx_0_term_assigned_1, ULTIMATE.start_main_~B~4_idx_0=v_ULTIMATE.start_main_~B~4_idx_0_term_1, ULTIMATE.start___VERIFIER_assert_#in~cond=|v_ULTIMATE.start___VERIFIER_assert_#in~cond_1|, ULTIMATE.start_main_~B~4_idx_0_bool=v_ULTIMATE.start_main_~B~4_idx_0_term_assigned_1, ULTIMATE.start_main_~B~4_val_0=v_ULTIMATE.start_main_~B~4_val_0_in_1, ULTIMATE.start_main_~i~4=v_ULTIMATE.start_main_~i~4_6} AuxVars[v_v_ULTIMATE.start_main_~B~4_4_aux_1, v_v_ULTIMATE.start_main_~A~4_4_aux_1] AssignedVars[ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start___VERIFIER_assert_#in~cond] {79#false} is VALID [2019-05-15 10:56:02,190 INFO L273 TraceCheckUtils]: 4: Hoare triple {79#false} [16] L32-->ULTIMATE.startErr0ASSERT_VIOLATIONASSERT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {79#false} is VALID [2019-05-15 10:56:02,190 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-05-15 10:56:02,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:56:02,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-05-15 10:56:02,191 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-05-15 10:56:02,191 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:56:02,192 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-05-15 10:56:02,233 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:56:02,233 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-05-15 10:56:02,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-05-15 10:56:02,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-05-15 10:56:02,234 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 4 states. [2019-05-15 10:56:02,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:56:02,300 INFO L93 Difference]: Finished difference Result 4 states and 4 transitions. [2019-05-15 10:56:02,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-05-15 10:56:02,301 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-05-15 10:56:02,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:56:02,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-05-15 10:56:02,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4 transitions. [2019-05-15 10:56:02,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-05-15 10:56:02,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4 transitions. [2019-05-15 10:56:02,303 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 4 transitions. [2019-05-15 10:56:02,314 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,314 INFO L225 Difference]: With dead ends: 4 [2019-05-15 10:56:02,315 INFO L226 Difference]: Without dead ends: 0 [2019-05-15 10:56:02,316 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-05-15 10:56:02,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-05-15 10:56:02,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-05-15 10:56:02,317 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:56:02,317 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2019-05-15 10:56:02,317 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-05-15 10:56:02,318 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-05-15 10:56:02,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:56:02,318 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-05-15 10:56:02,318 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-05-15 10:56:02,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:56:02,319 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:56:02,319 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-05-15 10:56:02,319 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-05-15 10:56:02,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:56:02,319 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-05-15 10:56:02,320 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-05-15 10:56:02,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:56:02,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:56:02,320 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:56:02,320 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:56:02,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-05-15 10:56:02,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-05-15 10:56:02,320 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 5 [2019-05-15 10:56:02,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:56:02,321 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-05-15 10:56:02,321 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-05-15 10:56:02,321 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-05-15 10:56:02,321 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:56:02,323 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-05-15 10:56:02,325 INFO L202 PluginConnector]: Adding new model array2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.05 10:56:02 BasicIcfg [2019-05-15 10:56:02,325 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-05-15 10:56:02,326 INFO L168 Benchmark]: Toolchain (without parser) took 2042.62 ms. Allocated memory was 139.5 MB in the beginning and 176.7 MB in the end (delta: 37.2 MB). Free memory was 109.3 MB in the beginning and 121.1 MB in the end (delta: -11.8 MB). Peak memory consumption was 25.4 MB. Max. memory is 7.1 GB. [2019-05-15 10:56:02,328 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.16 ms. Allocated memory is still 139.5 MB. Free memory is still 110.2 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-05-15 10:56:02,329 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.17 ms. Allocated memory is still 139.5 MB. Free memory was 108.9 MB in the beginning and 107.2 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,330 INFO L168 Benchmark]: Boogie Preprocessor took 20.16 ms. Allocated memory is still 139.5 MB. Free memory was 107.2 MB in the beginning and 106.4 MB in the end (delta: 838.8 kB). Peak memory consumption was 838.8 kB. Max. memory is 7.1 GB. [2019-05-15 10:56:02,330 INFO L168 Benchmark]: RCFGBuilder took 395.53 ms. Allocated memory is still 139.5 MB. Free memory was 106.4 MB in the beginning and 95.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 7.1 GB. [2019-05-15 10:56:02,331 INFO L168 Benchmark]: IcfgTransformer took 181.29 ms. Allocated memory is still 139.5 MB. Free memory was 95.7 MB in the beginning and 91.8 MB in the end (delta: 3.8 MB). Peak memory consumption was 3.8 MB. Max. memory is 7.1 GB. [2019-05-15 10:56:02,332 INFO L168 Benchmark]: TraceAbstraction took 1404.92 ms. Allocated memory was 139.5 MB in the beginning and 176.7 MB in the end (delta: 37.2 MB). Free memory was 91.4 MB in the beginning and 121.1 MB in the end (delta: -29.7 MB). Peak memory consumption was 7.5 MB. Max. memory is 7.1 GB. [2019-05-15 10:56:02,337 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.16 ms. Allocated memory is still 139.5 MB. Free memory is still 110.2 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 36.17 ms. Allocated memory is still 139.5 MB. Free memory was 108.9 MB in the beginning and 107.2 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 20.16 ms. Allocated memory is still 139.5 MB. Free memory was 107.2 MB in the beginning and 106.4 MB in the end (delta: 838.8 kB). Peak memory consumption was 838.8 kB. Max. memory is 7.1 GB. * RCFGBuilder took 395.53 ms. Allocated memory is still 139.5 MB. Free memory was 106.4 MB in the beginning and 95.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 7.1 GB. * IcfgTransformer took 181.29 ms. Allocated memory is still 139.5 MB. Free memory was 95.7 MB in the beginning and 91.8 MB in the end (delta: 3.8 MB). Peak memory consumption was 3.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1404.92 ms. Allocated memory was 139.5 MB in the beginning and 176.7 MB in the end (delta: 37.2 MB). Free memory was 91.4 MB in the beginning and 121.1 MB in the end (delta: -29.7 MB). Peak memory consumption was 7.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 42]: 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.3s OverallTime, 3 OverallIterations, 2 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5 SDtfs, 0 SDslu, 5 SDs, 0 SdLazy, 13 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6occurred in iteration=2, 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, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 12 NumberOfCodeBlocks, 12 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 9 ConstructedInterpolants, 0 QuantifiedInterpolants, 85 SizeOfPredicates, 4 NumberOfNonLiveVariables, 99 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 3 InterpolantComputations, 1 PerfectInterpolantSequences, 1/4 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...