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/array2.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1c58c86 [2019-05-15 10:43:01,332 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-05-15 10:43:01,334 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-05-15 10:43:01,352 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-05-15 10:43:01,352 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-05-15 10:43:01,353 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-05-15 10:43:01,358 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-05-15 10:43:01,360 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-05-15 10:43:01,363 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-05-15 10:43:01,364 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-05-15 10:43:01,366 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-05-15 10:43:01,366 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-05-15 10:43:01,368 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-05-15 10:43:01,368 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-05-15 10:43:01,377 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-05-15 10:43:01,378 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-05-15 10:43:01,382 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-05-15 10:43:01,384 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-05-15 10:43:01,387 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-05-15 10:43:01,392 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-05-15 10:43:01,395 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-05-15 10:43:01,398 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-05-15 10:43:01,403 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-05-15 10:43:01,403 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-05-15 10:43:01,404 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-05-15 10:43:01,405 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-05-15 10:43:01,405 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-05-15 10:43:01,406 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-05-15 10:43:01,407 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-05-15 10:43:01,407 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-05-15 10:43:01,410 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-05-15 10:43:01,411 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-05-15 10:43:01,412 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-05-15 10:43:01,414 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-05-15 10:43:01,415 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-05-15 10:43:01,415 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-05-15 10:43:01,415 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-05-15 10:43:01,417 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-05-15 10:43:01,418 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,470 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-05-15 10:43:01,483 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-05-15 10:43:01,486 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-05-15 10:43:01,488 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-05-15 10:43:01,488 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-05-15 10:43:01,489 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:43:01,489 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array2.i_3.bpl' [2019-05-15 10:43:01,531 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-05-15 10:43:01,533 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-05-15 10:43:01,533 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-05-15 10:43:01,533 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-05-15 10:43:01,534 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-05-15 10:43:01,553 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:43:01" (1/1) ... [2019-05-15 10:43:01,564 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:43:01" (1/1) ... [2019-05-15 10:43:01,572 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-05-15 10:43:01,573 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-05-15 10:43:01,573 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-05-15 10:43:01,573 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-05-15 10:43:01,586 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:43:01" (1/1) ... [2019-05-15 10:43:01,586 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:43:01" (1/1) ... [2019-05-15 10:43:01,587 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:43:01" (1/1) ... [2019-05-15 10:43:01,587 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:43:01" (1/1) ... [2019-05-15 10:43:01,591 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:43:01" (1/1) ... [2019-05-15 10:43:01,593 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:43:01" (1/1) ... [2019-05-15 10:43:01,594 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:43:01" (1/1) ... [2019-05-15 10:43:01,596 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-05-15 10:43:01,596 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-05-15 10:43:01,596 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-05-15 10:43:01,596 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-05-15 10:43:01,598 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: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:01,672 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-05-15 10:43:01,672 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-05-15 10:43:02,093 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-05-15 10:43:02,094 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-05-15 10:43:02,095 INFO L202 PluginConnector]: Adding new model array2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.05 10:43:02 BoogieIcfgContainer [2019-05-15 10:43:02,095 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-05-15 10:43:02,096 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2019-05-15 10:43:02,096 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2019-05-15 10:43:02,097 INFO L275 PluginConnector]: IcfgTransformer initialized [2019-05-15 10:43:02,101 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:43:02" (1/1) ... [2019-05-15 10:43:02,181 INFO L632 onniauxMapEliminator]: L27 [2019-05-15 10:43:02,182 INFO L633 onniauxMapEliminator]: In Formula: (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond_1| (ite (not (= (select v_ULTIMATE.start_main_~B~4_3 1024) (select v_ULTIMATE.start_main_~A~4_3 1024))) 1 0)) InVars {ULTIMATE.start_main_~A~4=v_ULTIMATE.start_main_~A~4_3, ULTIMATE.start_main_~B~4=v_ULTIMATE.start_main_~B~4_3} OutVars{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_3, ULTIMATE.start_main_~B~4=v_ULTIMATE.start_main_~B~4_3} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_#in~cond] [2019-05-15 10:43:02,182 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_#in~cond_1| (ite (not (= v_v_ULTIMATE.start_main_~A~4_3_aux_1 v_v_ULTIMATE.start_main_~B~4_3_aux_1)) 1 0)) (or (not (= 1024 v_ULTIMATE.start_main_~A~4_idx_0_term_1)) (= v_ULTIMATE.start_main_~A~4_val_0_in_1 v_v_ULTIMATE.start_main_~A~4_3_aux_1)) (or (not (= v_ULTIMATE.start_main_~B~4_idx_0_term_1 1024)) (= v_ULTIMATE.start_main_~B~4_val_0_in_1 v_v_ULTIMATE.start_main_~B~4_3_aux_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)) 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} 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_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} AuxVars[v_v_ULTIMATE.start_main_~A~4_3_aux_1, v_v_ULTIMATE.start_main_~B~4_3_aux_1] AssignedVars[ULTIMATE.start___VERIFIER_assert_#in~cond] [2019-05-15 10:43:02,182 INFO L635 onniauxMapEliminator]: L28 [2019-05-15 10:43:02,198 INFO L632 onniauxMapEliminator]: L35 [2019-05-15 10:43:02,198 INFO L633 onniauxMapEliminator]: In Formula: (= v_ULTIMATE.start_main_~tmp~4_3 (select v_ULTIMATE.start_main_~A~4_4 v_ULTIMATE.start_main_~i~4_6)) InVars {ULTIMATE.start_main_~A~4=v_ULTIMATE.start_main_~A~4_4, ULTIMATE.start_main_~i~4=v_ULTIMATE.start_main_~i~4_6} OutVars{ULTIMATE.start_main_~tmp~4=v_ULTIMATE.start_main_~tmp~4_3, ULTIMATE.start_main_~A~4=v_ULTIMATE.start_main_~A~4_4, ULTIMATE.start_main_~i~4=v_ULTIMATE.start_main_~i~4_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~tmp~4] [2019-05-15 10:43:02,198 INFO L634 onniauxMapEliminator]: Out Formula: (and (or (not (= v_ULTIMATE.start_main_~A~4_idx_0_term_2 v_ULTIMATE.start_main_~i~4_6)) (= v_ULTIMATE.start_main_~A~4_val_0_in_2 v_v_ULTIMATE.start_main_~A~4_4_aux_1)) (= v_v_ULTIMATE.start_main_~A~4_4_aux_1 v_ULTIMATE.start_main_~tmp~4_3) (or (= v_ULTIMATE.start_main_~A~4_idx_0_term_2 v_ULTIMATE.start_main_~i~4_6) (not v_ULTIMATE.start_main_~A~4_idx_0_term_assigned_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_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_~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_2, ULTIMATE.start_main_~A~4_val_0=v_ULTIMATE.start_main_~A~4_val_0_in_2, ULTIMATE.start_main_~tmp~4=v_ULTIMATE.start_main_~tmp~4_3, ULTIMATE.start_main_~A~4_idx_0_bool=v_ULTIMATE.start_main_~A~4_idx_0_term_assigned_1, ULTIMATE.start_main_~i~4=v_ULTIMATE.start_main_~i~4_6} AuxVars[v_v_ULTIMATE.start_main_~A~4_4_aux_1] AssignedVars[ULTIMATE.start_main_~tmp~4] [2019-05-15 10:43:02,199 INFO L635 onniauxMapEliminator]: L36 [2019-05-15 10:43:02,218 INFO L632 onniauxMapEliminator]: L36 [2019-05-15 10:43:02,219 INFO L633 onniauxMapEliminator]: In Formula: (= v_ULTIMATE.start_main_~B~4_4 (store v_ULTIMATE.start_main_~B~4_5 v_ULTIMATE.start_main_~i~4_7 v_ULTIMATE.start_main_~tmp~4_4)) InVars {ULTIMATE.start_main_~tmp~4=v_ULTIMATE.start_main_~tmp~4_4, ULTIMATE.start_main_~B~4=v_ULTIMATE.start_main_~B~4_5, ULTIMATE.start_main_~i~4=v_ULTIMATE.start_main_~i~4_7} OutVars{ULTIMATE.start_main_~tmp~4=v_ULTIMATE.start_main_~tmp~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_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~B~4] [2019-05-15 10:43:02,219 INFO L634 onniauxMapEliminator]: Out Formula: (and (= 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_3 v_ULTIMATE.start_main_~i~4_7))) v_ULTIMATE.start_main_~B~4_idx_0_term_assigned_1 (or (= v_ULTIMATE.start_main_~B~4_idx_0_term_3 v_ULTIMATE.start_main_~i~4_7) (not v_ULTIMATE.start_main_~B~4_idx_0_term_assigned_1))) InVars {ULTIMATE.start_main_~tmp~4=v_ULTIMATE.start_main_~tmp~4_4, ULTIMATE.start_main_~B~4_idx_0=v_ULTIMATE.start_main_~B~4_idx_0_term_3, 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_7} OutVars{ULTIMATE.start_main_~tmp~4=v_ULTIMATE.start_main_~tmp~4_4, ULTIMATE.start_main_~B~4_idx_0=v_ULTIMATE.start_main_~B~4_idx_0_term_3, 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[] AssignedVars[ULTIMATE.start_main_~B~4_val_0] [2019-05-15 10:43:02,219 INFO L635 onniauxMapEliminator]: L37 [2019-05-15 10:43:02,255 INFO L202 PluginConnector]: Adding new model array2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.05 10:43:02 BasicIcfg [2019-05-15 10:43:02,255 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2019-05-15 10:43:02,256 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-05-15 10:43:02,256 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-05-15 10:43:02,260 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-05-15 10:43:02,260 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:43:01" (1/3) ... [2019-05-15 10:43:02,261 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4209b9c3 and model type array2.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,262 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:43:02" (2/3) ... [2019-05-15 10:43:02,262 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4209b9c3 and model type array2.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,262 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:43:02" (3/3) ... [2019-05-15 10:43:02,264 INFO L109 eAbstractionObserver]: Analyzing ICFG array2.i_3.bplME [2019-05-15 10:43:02,273 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-05-15 10:43:02,283 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-05-15 10:43:02,301 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-05-15 10:43:02,331 INFO L127 ementStrategyFactory]: Using default assertion order modulation [2019-05-15 10:43:02,331 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-05-15 10:43:02,332 INFO L378 AbstractCegarLoop]: Hoare is false [2019-05-15 10:43:02,332 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-05-15 10:43:02,332 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-05-15 10:43:02,332 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-05-15 10:43:02,332 INFO L382 AbstractCegarLoop]: Difference is false [2019-05-15 10:43:02,333 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-05-15 10:43:02,333 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-05-15 10:43:02,348 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2019-05-15 10:43:02,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-05-15 10:43:02,357 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:43:02,358 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-15 10:43:02,361 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:43:02,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:43:02,367 INFO L82 PathProgramCache]: Analyzing trace with hash -264836309, now seen corresponding path program 1 times [2019-05-15 10:43:02,417 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:43:02,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:43:02,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjunts are in the unsatisfiable core [2019-05-15 10:43:02,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:43:02,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:43:02,601 INFO L273 TraceCheckUtils]: 0: Hoare triple {25#true} [28] ULTIMATE.startENTRY-->L13: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res] {25#true} is VALID [2019-05-15 10:43:02,602 INFO L273 TraceCheckUtils]: 1: Hoare triple {25#true} [29] L13-->L14: Formula: true InVars {} OutVars{ULTIMATE.start_main_~tmp~4=v_ULTIMATE.start_main_~tmp~4_1, ULTIMATE.start_main_#t~post0=|v_ULTIMATE.start_main_#t~post0_1|, ULTIMATE.start_main_~A~4=v_ULTIMATE.start_main_~A~4_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_~tmp~4, ULTIMATE.start_main_#t~post0, ULTIMATE.start_main_~A~4, ULTIMATE.start_main_~B~4, ULTIMATE.start_main_~i~4] {25#true} is VALID [2019-05-15 10:43:02,602 INFO L273 TraceCheckUtils]: 2: Hoare triple {25#true} [30] L14-->L15: Formula: true InVars {} OutVars{ULTIMATE.start_main_~A~4=v_ULTIMATE.start_main_~A~4_2} AuxVars[] AssignedVars[ULTIMATE.start_main_~A~4] {25#true} is VALID [2019-05-15 10:43:02,603 INFO L273 TraceCheckUtils]: 3: Hoare triple {25#true} [31] L15-->L16: Formula: true InVars {} OutVars{ULTIMATE.start_main_~B~4=v_ULTIMATE.start_main_~B~4_2} AuxVars[] AssignedVars[ULTIMATE.start_main_~B~4] {25#true} is VALID [2019-05-15 10:43:02,603 INFO L273 TraceCheckUtils]: 4: Hoare triple {25#true} [32] L16-->L17: Formula: true InVars {} OutVars{ULTIMATE.start_main_~i~4=v_ULTIMATE.start_main_~i~4_2} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~4] {25#true} is VALID [2019-05-15 10:43:02,604 INFO L273 TraceCheckUtils]: 5: Hoare triple {25#true} [33] L17-->L18: Formula: true InVars {} OutVars{ULTIMATE.start_main_~tmp~4=v_ULTIMATE.start_main_~tmp~4_2} AuxVars[] AssignedVars[ULTIMATE.start_main_~tmp~4] {25#true} is VALID [2019-05-15 10:43:02,606 INFO L273 TraceCheckUtils]: 6: Hoare triple {25#true} [34] L18-->L40: Formula: (= v_ULTIMATE.start_main_~i~4_3 0) InVars {} OutVars{ULTIMATE.start_main_~i~4=v_ULTIMATE.start_main_~i~4_3} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~4] {48#(<= ULTIMATE.start_main_~i~4 0)} is VALID [2019-05-15 10:43:02,610 INFO L273 TraceCheckUtils]: 7: Hoare triple {48#(<= ULTIMATE.start_main_~i~4 0)} [35] L40-->L27: Formula: (not (< v_ULTIMATE.start_main_~i~4_4 2048)) InVars {ULTIMATE.start_main_~i~4=v_ULTIMATE.start_main_~i~4_4} OutVars{ULTIMATE.start_main_~i~4=v_ULTIMATE.start_main_~i~4_4} AuxVars[] AssignedVars[] {26#false} is VALID [2019-05-15 10:43:02,610 INFO L273 TraceCheckUtils]: 8: Hoare triple {26#false} [37] L27-->L28: Formula: (let ((.cse0 (= 1024 v_ULTIMATE.start_main_~A~4_idx_0_term_1)) (.cse1 (= v_ULTIMATE.start_main_~B~4_idx_0_term_1 1024))) (and (or .cse0 (not v_ULTIMATE.start_main_~A~4_idx_0_term_assigned_1)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond_1| (ite (not (= v_v_ULTIMATE.start_main_~A~4_3_aux_1 v_v_ULTIMATE.start_main_~B~4_3_aux_1)) 1 0)) (or (not .cse0) (= v_ULTIMATE.start_main_~A~4_val_0_in_1 v_v_ULTIMATE.start_main_~A~4_3_aux_1)) (or (not .cse1) (= v_ULTIMATE.start_main_~B~4_val_0_in_1 v_v_ULTIMATE.start_main_~B~4_3_aux_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)) 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} 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_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} AuxVars[v_v_ULTIMATE.start_main_~A~4_3_aux_1, v_v_ULTIMATE.start_main_~B~4_3_aux_1] AssignedVars[ULTIMATE.start___VERIFIER_assert_#in~cond] {26#false} is VALID [2019-05-15 10:43:02,611 INFO L273 TraceCheckUtils]: 9: Hoare triple {26#false} [39] L28-->L29: Formula: true InVars {} OutVars{ULTIMATE.start___VERIFIER_assert_~cond=v_ULTIMATE.start___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~cond] {26#false} is VALID [2019-05-15 10:43:02,612 INFO L273 TraceCheckUtils]: 10: Hoare triple {26#false} [41] L29-->L30: 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] {26#false} is VALID [2019-05-15 10:43:02,612 INFO L273 TraceCheckUtils]: 11: Hoare triple {26#false} [43] L30-->L31: 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[] {26#false} is VALID [2019-05-15 10:43:02,613 INFO L273 TraceCheckUtils]: 12: Hoare triple {26#false} [45] L31-->L32: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#false} is VALID [2019-05-15 10:43:02,613 INFO L273 TraceCheckUtils]: 13: Hoare triple {26#false} [47] L32-->ULTIMATE.startErr0ASSERT_VIOLATIONASSERT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#false} is VALID [2019-05-15 10:43:02,616 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:02,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-05-15 10:43:02,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-05-15 10:43:02,625 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-05-15 10:43:02,627 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:43:02,630 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-05-15 10:43:02,733 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:43:02,734 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-05-15 10:43:02,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-05-15 10:43:02,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-05-15 10:43:02,747 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 3 states. [2019-05-15 10:43:03,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:43:03,097 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-05-15 10:43:03,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-05-15 10:43:03,098 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-05-15 10:43:03,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:43:03,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-05-15 10:43:03,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2019-05-15 10:43:03,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-05-15 10:43:03,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2019-05-15 10:43:03,117 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 27 transitions. [2019-05-15 10:43:03,208 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:03,221 INFO L225 Difference]: With dead ends: 25 [2019-05-15 10:43:03,222 INFO L226 Difference]: Without dead ends: 25 [2019-05-15 10:43:03,226 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 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:43:03,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-05-15 10:43:03,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2019-05-15 10:43:03,260 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:43:03,261 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 21 states. [2019-05-15 10:43:03,263 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 21 states. [2019-05-15 10:43:03,263 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 21 states. [2019-05-15 10:43:03,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:43:03,270 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-05-15 10:43:03,270 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-05-15 10:43:03,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:43:03,271 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:43:03,271 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 25 states. [2019-05-15 10:43:03,271 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 25 states. [2019-05-15 10:43:03,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:43:03,275 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-05-15 10:43:03,275 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-05-15 10:43:03,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:43:03,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:43:03,276 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:43:03,276 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:43:03,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-05-15 10:43:03,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-05-15 10:43:03,282 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 14 [2019-05-15 10:43:03,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:43:03,283 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-05-15 10:43:03,283 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-05-15 10:43:03,283 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-05-15 10:43:03,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-05-15 10:43:03,286 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:43:03,286 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] [2019-05-15 10:43:03,286 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:43:03,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:43:03,287 INFO L82 PathProgramCache]: Analyzing trace with hash -320835227, now seen corresponding path program 1 times [2019-05-15 10:43:03,288 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:43:03,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:43:03,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjunts are in the unsatisfiable core [2019-05-15 10:43:03,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:43:03,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:43:03,562 INFO L273 TraceCheckUtils]: 0: Hoare triple {165#true} [28] ULTIMATE.startENTRY-->L13: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res] {165#true} is VALID [2019-05-15 10:43:03,563 INFO L273 TraceCheckUtils]: 1: Hoare triple {165#true} [29] L13-->L14: Formula: true InVars {} OutVars{ULTIMATE.start_main_~tmp~4=v_ULTIMATE.start_main_~tmp~4_1, ULTIMATE.start_main_#t~post0=|v_ULTIMATE.start_main_#t~post0_1|, ULTIMATE.start_main_~A~4=v_ULTIMATE.start_main_~A~4_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_~tmp~4, ULTIMATE.start_main_#t~post0, ULTIMATE.start_main_~A~4, ULTIMATE.start_main_~B~4, ULTIMATE.start_main_~i~4] {165#true} is VALID [2019-05-15 10:43:03,563 INFO L273 TraceCheckUtils]: 2: Hoare triple {165#true} [30] L14-->L15: Formula: true InVars {} OutVars{ULTIMATE.start_main_~A~4=v_ULTIMATE.start_main_~A~4_2} AuxVars[] AssignedVars[ULTIMATE.start_main_~A~4] {165#true} is VALID [2019-05-15 10:43:03,564 INFO L273 TraceCheckUtils]: 3: Hoare triple {165#true} [31] L15-->L16: Formula: true InVars {} OutVars{ULTIMATE.start_main_~B~4=v_ULTIMATE.start_main_~B~4_2} AuxVars[] AssignedVars[ULTIMATE.start_main_~B~4] {165#true} is VALID [2019-05-15 10:43:03,564 INFO L273 TraceCheckUtils]: 4: Hoare triple {165#true} [32] L16-->L17: Formula: true InVars {} OutVars{ULTIMATE.start_main_~i~4=v_ULTIMATE.start_main_~i~4_2} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~4] {165#true} is VALID [2019-05-15 10:43:03,565 INFO L273 TraceCheckUtils]: 5: Hoare triple {165#true} [33] L17-->L18: Formula: true InVars {} OutVars{ULTIMATE.start_main_~tmp~4=v_ULTIMATE.start_main_~tmp~4_2} AuxVars[] AssignedVars[ULTIMATE.start_main_~tmp~4] {165#true} is VALID [2019-05-15 10:43:03,580 INFO L273 TraceCheckUtils]: 6: Hoare triple {165#true} [34] L18-->L40: Formula: (= v_ULTIMATE.start_main_~i~4_3 0) InVars {} OutVars{ULTIMATE.start_main_~i~4=v_ULTIMATE.start_main_~i~4_3} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~4] {188#(<= ULTIMATE.start_main_~i~4 0)} is VALID [2019-05-15 10:43:03,598 INFO L273 TraceCheckUtils]: 7: Hoare triple {188#(<= ULTIMATE.start_main_~i~4 0)} [36] L40-->L35: Formula: (< v_ULTIMATE.start_main_~i~4_5 2048) InVars {ULTIMATE.start_main_~i~4=v_ULTIMATE.start_main_~i~4_5} OutVars{ULTIMATE.start_main_~i~4=v_ULTIMATE.start_main_~i~4_5} AuxVars[] AssignedVars[] {188#(<= ULTIMATE.start_main_~i~4 0)} is VALID [2019-05-15 10:43:03,610 INFO L273 TraceCheckUtils]: 8: Hoare triple {188#(<= ULTIMATE.start_main_~i~4 0)} [38] L35-->L36: Formula: (let ((.cse0 (= v_ULTIMATE.start_main_~A~4_idx_0_term_2 v_ULTIMATE.start_main_~i~4_6))) (and (or (not .cse0) (= v_ULTIMATE.start_main_~A~4_val_0_in_2 v_v_ULTIMATE.start_main_~A~4_4_aux_1)) (= v_v_ULTIMATE.start_main_~A~4_4_aux_1 v_ULTIMATE.start_main_~tmp~4_3) (or .cse0 (not v_ULTIMATE.start_main_~A~4_idx_0_term_assigned_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_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_~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_2, ULTIMATE.start_main_~A~4_val_0=v_ULTIMATE.start_main_~A~4_val_0_in_2, ULTIMATE.start_main_~tmp~4=v_ULTIMATE.start_main_~tmp~4_3, ULTIMATE.start_main_~A~4_idx_0_bool=v_ULTIMATE.start_main_~A~4_idx_0_term_assigned_1, ULTIMATE.start_main_~i~4=v_ULTIMATE.start_main_~i~4_6} AuxVars[v_v_ULTIMATE.start_main_~A~4_4_aux_1] AssignedVars[ULTIMATE.start_main_~tmp~4] {195#(and (<= ULTIMATE.start_main_~A~4_idx_0 0) ULTIMATE.start_main_~A~4_idx_0_bool)} is VALID [2019-05-15 10:43:03,611 INFO L273 TraceCheckUtils]: 9: Hoare triple {195#(and (<= ULTIMATE.start_main_~A~4_idx_0 0) ULTIMATE.start_main_~A~4_idx_0_bool)} [40] L36-->L37: Formula: (let ((.cse0 (= v_ULTIMATE.start_main_~B~4_idx_0_term_3 v_ULTIMATE.start_main_~i~4_7))) (and (= 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 (or .cse0 (not v_ULTIMATE.start_main_~B~4_idx_0_term_assigned_1)))) InVars {ULTIMATE.start_main_~tmp~4=v_ULTIMATE.start_main_~tmp~4_4, ULTIMATE.start_main_~B~4_idx_0=v_ULTIMATE.start_main_~B~4_idx_0_term_3, 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_7} OutVars{ULTIMATE.start_main_~tmp~4=v_ULTIMATE.start_main_~tmp~4_4, ULTIMATE.start_main_~B~4_idx_0=v_ULTIMATE.start_main_~B~4_idx_0_term_3, 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[] AssignedVars[ULTIMATE.start_main_~B~4_val_0] {195#(and (<= ULTIMATE.start_main_~A~4_idx_0 0) ULTIMATE.start_main_~A~4_idx_0_bool)} is VALID [2019-05-15 10:43:03,612 INFO L273 TraceCheckUtils]: 10: Hoare triple {195#(and (<= ULTIMATE.start_main_~A~4_idx_0 0) ULTIMATE.start_main_~A~4_idx_0_bool)} [42] L37-->L38: Formula: (= |v_ULTIMATE.start_main_#t~post0_2| v_ULTIMATE.start_main_~i~4_8) InVars {ULTIMATE.start_main_~i~4=v_ULTIMATE.start_main_~i~4_8} OutVars{ULTIMATE.start_main_#t~post0=|v_ULTIMATE.start_main_#t~post0_2|, ULTIMATE.start_main_~i~4=v_ULTIMATE.start_main_~i~4_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post0] {195#(and (<= ULTIMATE.start_main_~A~4_idx_0 0) ULTIMATE.start_main_~A~4_idx_0_bool)} is VALID [2019-05-15 10:43:03,613 INFO L273 TraceCheckUtils]: 11: Hoare triple {195#(and (<= ULTIMATE.start_main_~A~4_idx_0 0) ULTIMATE.start_main_~A~4_idx_0_bool)} [44] L38-->L39: Formula: (= v_ULTIMATE.start_main_~i~4_9 (+ |v_ULTIMATE.start_main_#t~post0_3| 1)) InVars {ULTIMATE.start_main_#t~post0=|v_ULTIMATE.start_main_#t~post0_3|} OutVars{ULTIMATE.start_main_#t~post0=|v_ULTIMATE.start_main_#t~post0_3|, ULTIMATE.start_main_~i~4=v_ULTIMATE.start_main_~i~4_9} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~4] {195#(and (<= ULTIMATE.start_main_~A~4_idx_0 0) ULTIMATE.start_main_~A~4_idx_0_bool)} is VALID [2019-05-15 10:43:03,630 INFO L273 TraceCheckUtils]: 12: Hoare triple {195#(and (<= ULTIMATE.start_main_~A~4_idx_0 0) ULTIMATE.start_main_~A~4_idx_0_bool)} [46] L39-->L40: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~post0=|v_ULTIMATE.start_main_#t~post0_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post0] {195#(and (<= ULTIMATE.start_main_~A~4_idx_0 0) ULTIMATE.start_main_~A~4_idx_0_bool)} is VALID [2019-05-15 10:43:03,640 INFO L273 TraceCheckUtils]: 13: Hoare triple {195#(and (<= ULTIMATE.start_main_~A~4_idx_0 0) ULTIMATE.start_main_~A~4_idx_0_bool)} [35] L40-->L27: Formula: (not (< v_ULTIMATE.start_main_~i~4_4 2048)) InVars {ULTIMATE.start_main_~i~4=v_ULTIMATE.start_main_~i~4_4} OutVars{ULTIMATE.start_main_~i~4=v_ULTIMATE.start_main_~i~4_4} AuxVars[] AssignedVars[] {195#(and (<= ULTIMATE.start_main_~A~4_idx_0 0) ULTIMATE.start_main_~A~4_idx_0_bool)} is VALID [2019-05-15 10:43:03,646 INFO L273 TraceCheckUtils]: 14: Hoare triple {195#(and (<= ULTIMATE.start_main_~A~4_idx_0 0) ULTIMATE.start_main_~A~4_idx_0_bool)} [37] L27-->L28: Formula: (let ((.cse0 (= 1024 v_ULTIMATE.start_main_~A~4_idx_0_term_1)) (.cse1 (= v_ULTIMATE.start_main_~B~4_idx_0_term_1 1024))) (and (or .cse0 (not v_ULTIMATE.start_main_~A~4_idx_0_term_assigned_1)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond_1| (ite (not (= v_v_ULTIMATE.start_main_~A~4_3_aux_1 v_v_ULTIMATE.start_main_~B~4_3_aux_1)) 1 0)) (or (not .cse0) (= v_ULTIMATE.start_main_~A~4_val_0_in_1 v_v_ULTIMATE.start_main_~A~4_3_aux_1)) (or (not .cse1) (= v_ULTIMATE.start_main_~B~4_val_0_in_1 v_v_ULTIMATE.start_main_~B~4_3_aux_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)) 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} 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_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} AuxVars[v_v_ULTIMATE.start_main_~A~4_3_aux_1, v_v_ULTIMATE.start_main_~B~4_3_aux_1] AssignedVars[ULTIMATE.start___VERIFIER_assert_#in~cond] {166#false} is VALID [2019-05-15 10:43:03,646 INFO L273 TraceCheckUtils]: 15: Hoare triple {166#false} [39] L28-->L29: Formula: true InVars {} OutVars{ULTIMATE.start___VERIFIER_assert_~cond=v_ULTIMATE.start___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~cond] {166#false} is VALID [2019-05-15 10:43:03,647 INFO L273 TraceCheckUtils]: 16: Hoare triple {166#false} [41] L29-->L30: 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] {166#false} is VALID [2019-05-15 10:43:03,647 INFO L273 TraceCheckUtils]: 17: Hoare triple {166#false} [43] L30-->L31: 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[] {166#false} is VALID [2019-05-15 10:43:03,647 INFO L273 TraceCheckUtils]: 18: Hoare triple {166#false} [45] L31-->L32: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {166#false} is VALID [2019-05-15 10:43:03,648 INFO L273 TraceCheckUtils]: 19: Hoare triple {166#false} [47] L32-->ULTIMATE.startErr0ASSERT_VIOLATIONASSERT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {166#false} is VALID [2019-05-15 10:43:03,651 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:43:03,653 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:43:03,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-05-15 10:43:03,654 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-05-15 10:43:03,655 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:43:03,655 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-05-15 10:43:03,702 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:43:03,702 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-05-15 10:43:03,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-05-15 10:43:03,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-05-15 10:43:03,703 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 4 states. [2019-05-15 10:43:03,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:43:03,827 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-05-15 10:43:03,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-05-15 10:43:03,831 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-05-15 10:43:03,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:43:03,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-05-15 10:43:03,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2019-05-15 10:43:03,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-05-15 10:43:03,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2019-05-15 10:43:03,840 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 17 transitions. [2019-05-15 10:43:04,018 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:43:04,019 INFO L225 Difference]: With dead ends: 16 [2019-05-15 10:43:04,020 INFO L226 Difference]: Without dead ends: 0 [2019-05-15 10:43:04,021 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-05-15 10:43:04,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-05-15 10:43:04,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-05-15 10:43:04,022 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:43:04,022 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2019-05-15 10:43:04,024 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-05-15 10:43:04,025 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-05-15 10:43:04,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:43:04,025 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-05-15 10:43:04,025 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-05-15 10:43:04,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:43:04,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:43:04,026 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-05-15 10:43:04,026 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-05-15 10:43:04,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:43:04,027 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-05-15 10:43:04,027 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-05-15 10:43:04,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:43:04,027 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:43:04,027 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:43:04,027 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:43:04,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-05-15 10:43:04,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-05-15 10:43:04,029 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2019-05-15 10:43:04,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:43:04,029 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-05-15 10:43:04,030 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-05-15 10:43:04,030 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-05-15 10:43:04,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:43:04,033 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-05-15 10:43:04,036 INFO L202 PluginConnector]: Adding new model array2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.05 10:43:04 BasicIcfg [2019-05-15 10:43:04,036 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-05-15 10:43:04,037 INFO L168 Benchmark]: Toolchain (without parser) took 2505.78 ms. Allocated memory was 133.2 MB in the beginning and 170.9 MB in the end (delta: 37.7 MB). Free memory was 110.7 MB in the beginning and 104.0 MB in the end (delta: 6.7 MB). Peak memory consumption was 44.5 MB. Max. memory is 7.1 GB. [2019-05-15 10:43:04,041 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 133.2 MB. Free memory is still 111.9 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-05-15 10:43:04,042 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.16 ms. Allocated memory is still 133.2 MB. Free memory was 110.5 MB in the beginning and 108.9 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB. [2019-05-15 10:43:04,045 INFO L168 Benchmark]: Boogie Preprocessor took 22.94 ms. Allocated memory is still 133.2 MB. Free memory was 108.7 MB in the beginning and 107.7 MB in the end (delta: 1.0 MB). Peak memory consumption was 1.0 MB. Max. memory is 7.1 GB. [2019-05-15 10:43:04,046 INFO L168 Benchmark]: RCFGBuilder took 499.46 ms. Allocated memory is still 133.2 MB. Free memory was 107.7 MB in the beginning and 95.6 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 7.1 GB. [2019-05-15 10:43:04,049 INFO L168 Benchmark]: IcfgTransformer took 159.00 ms. Allocated memory is still 133.2 MB. Free memory was 95.6 MB in the beginning and 90.0 MB in the end (delta: 5.6 MB). Peak memory consumption was 5.6 MB. Max. memory is 7.1 GB. [2019-05-15 10:43:04,051 INFO L168 Benchmark]: TraceAbstraction took 1779.91 ms. Allocated memory was 133.2 MB in the beginning and 170.9 MB in the end (delta: 37.7 MB). Free memory was 89.8 MB in the beginning and 104.0 MB in the end (delta: -14.2 MB). Peak memory consumption was 23.6 MB. Max. memory is 7.1 GB. [2019-05-15 10:43:04,058 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 133.2 MB. Free memory is still 111.9 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 39.16 ms. Allocated memory is still 133.2 MB. Free memory was 110.5 MB in the beginning and 108.9 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 22.94 ms. Allocated memory is still 133.2 MB. Free memory was 108.7 MB in the beginning and 107.7 MB in the end (delta: 1.0 MB). Peak memory consumption was 1.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 499.46 ms. Allocated memory is still 133.2 MB. Free memory was 107.7 MB in the beginning and 95.6 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 7.1 GB. * IcfgTransformer took 159.00 ms. Allocated memory is still 133.2 MB. Free memory was 95.6 MB in the beginning and 90.0 MB in the end (delta: 5.6 MB). Peak memory consumption was 5.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1779.91 ms. Allocated memory was 133.2 MB in the beginning and 170.9 MB in the end (delta: 37.7 MB). Free memory was 89.8 MB in the beginning and 104.0 MB in the end (delta: -14.2 MB). Peak memory consumption was 23.6 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, 22 locations, 1 error locations. SAFE Result, 1.7s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 26 SDtfs, 9 SDslu, 24 SDs, 0 SdLazy, 25 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 33 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22occurred 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, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 34 NumberOfCodeBlocks, 34 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 32 ConstructedInterpolants, 0 QuantifiedInterpolants, 1088 SizeOfPredicates, 4 NumberOfNonLiveVariables, 68 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 0/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...