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/toy/tooDifficultLoopInvariant/ValueTerminatedArrayIteration01.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1c58c86 [2019-05-15 10:43:13,265 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-05-15 10:43:13,267 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-05-15 10:43:13,284 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-05-15 10:43:13,284 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-05-15 10:43:13,285 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-05-15 10:43:13,287 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-05-15 10:43:13,288 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-05-15 10:43:13,290 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-05-15 10:43:13,291 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-05-15 10:43:13,292 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-05-15 10:43:13,292 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-05-15 10:43:13,293 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-05-15 10:43:13,294 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-05-15 10:43:13,295 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-05-15 10:43:13,296 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-05-15 10:43:13,297 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-05-15 10:43:13,299 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-05-15 10:43:13,304 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-05-15 10:43:13,306 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-05-15 10:43:13,307 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-05-15 10:43:13,308 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-05-15 10:43:13,310 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-05-15 10:43:13,310 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-05-15 10:43:13,310 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-05-15 10:43:13,311 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-05-15 10:43:13,312 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-05-15 10:43:13,313 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-05-15 10:43:13,313 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-05-15 10:43:13,314 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-05-15 10:43:13,314 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-05-15 10:43:13,315 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-05-15 10:43:13,316 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-05-15 10:43:13,317 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-05-15 10:43:13,317 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-05-15 10:43:13,317 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-05-15 10:43:13,318 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-05-15 10:43:13,319 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-05-15 10:43:13,319 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:13,365 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-05-15 10:43:13,379 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-05-15 10:43:13,383 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-05-15 10:43:13,384 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-05-15 10:43:13,385 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-05-15 10:43:13,386 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ValueTerminatedArrayIteration01.bpl [2019-05-15 10:43:13,386 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ValueTerminatedArrayIteration01.bpl' [2019-05-15 10:43:13,419 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-05-15 10:43:13,420 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-05-15 10:43:13,420 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-05-15 10:43:13,421 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-05-15 10:43:13,421 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-05-15 10:43:13,438 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:43:13" (1/1) ... [2019-05-15 10:43:13,449 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:43:13" (1/1) ... [2019-05-15 10:43:13,456 WARN L165 Inliner]: Program contained no entry procedure! [2019-05-15 10:43:13,456 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-05-15 10:43:13,456 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-05-15 10:43:13,458 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-05-15 10:43:13,459 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-05-15 10:43:13,459 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-05-15 10:43:13,459 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-05-15 10:43:13,471 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:43:13" (1/1) ... [2019-05-15 10:43:13,471 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:43:13" (1/1) ... [2019-05-15 10:43:13,472 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:43:13" (1/1) ... [2019-05-15 10:43:13,472 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:43:13" (1/1) ... [2019-05-15 10:43:13,475 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:43:13" (1/1) ... [2019-05-15 10:43:13,479 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:43:13" (1/1) ... [2019-05-15 10:43:13,480 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:43:13" (1/1) ... [2019-05-15 10:43:13,481 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-05-15 10:43:13,482 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-05-15 10:43:13,482 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-05-15 10:43:13,482 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-05-15 10:43:13,483 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:43:13" (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:13,563 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-05-15 10:43:13,563 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-05-15 10:43:13,563 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-05-15 10:43:13,860 INFO L275 CfgBuilder]: Using library mode [2019-05-15 10:43:13,860 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-05-15 10:43:13,862 INFO L202 PluginConnector]: Adding new model ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.05 10:43:13 BoogieIcfgContainer [2019-05-15 10:43:13,862 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-05-15 10:43:13,863 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2019-05-15 10:43:13,863 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2019-05-15 10:43:13,864 INFO L275 PluginConnector]: IcfgTransformer initialized [2019-05-15 10:43:13,868 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.05 10:43:13" (1/1) ... [2019-05-15 10:43:13,934 INFO L632 onniauxMapEliminator]: L15 [2019-05-15 10:43:13,935 INFO L633 onniauxMapEliminator]: In Formula: (= v_a_1 (store v_a_2 v_end_2 42)) InVars {a=v_a_2, end=v_end_2} OutVars{a=v_a_1, end=v_end_2} AuxVars[] AssignedVars[a] [2019-05-15 10:43:13,935 INFO L634 onniauxMapEliminator]: Out Formula: (and (= v_a_val_0_out_1 v_a_val_0_in_1) (or (= v_end_2 v_a_idx_0_term_1) (not v_a_idx_0_term_assigned_1)) (or (= 42 v_a_val_0_in_1) (not (= v_end_2 v_a_idx_0_term_1))) v_a_idx_0_term_assigned_1) InVars {end=v_end_2, a_val_0=v_a_val_0_in_1, a_idx_0_bool=v_a_idx_0_term_assigned_1, a_idx_0=v_a_idx_0_term_1} OutVars{end=v_end_2, a_val_0=v_a_val_0_out_1, a_idx_0_bool=v_a_idx_0_term_assigned_1, a_idx_0=v_a_idx_0_term_1} AuxVars[] AssignedVars[a_val_0] [2019-05-15 10:43:13,935 INFO L635 onniauxMapEliminator]: L16 [2019-05-15 10:43:13,965 INFO L632 onniauxMapEliminator]: L17-1 [2019-05-15 10:43:13,965 INFO L633 onniauxMapEliminator]: In Formula: (not (= 42 (select v_a_3 v_i_2))) InVars {a=v_a_3, i=v_i_2} OutVars{a=v_a_3, i=v_i_2} AuxVars[] AssignedVars[] [2019-05-15 10:43:13,965 INFO L634 onniauxMapEliminator]: Out Formula: (and (or (= v_v_a_3_aux_1 v_a_val_0_in_2) (not (= v_i_2 v_a_idx_0_term_2))) (not (= 42 v_v_a_3_aux_1)) (or (= v_i_2 v_a_idx_0_term_2) (not v_a_idx_0_term_assigned_1)) v_a_idx_0_term_assigned_1) InVars {i=v_i_2, a_val_0=v_a_val_0_in_2, a_idx_0_bool=v_a_idx_0_term_assigned_1, a_idx_0=v_a_idx_0_term_2} OutVars{i=v_i_2, a_val_0=v_a_val_0_in_2, a_idx_0_bool=v_a_idx_0_term_assigned_1, a_idx_0=v_a_idx_0_term_2} AuxVars[v_v_a_3_aux_1] AssignedVars[] [2019-05-15 10:43:13,966 INFO L635 onniauxMapEliminator]: L18 [2019-05-15 10:43:13,981 INFO L632 onniauxMapEliminator]: L17-1 [2019-05-15 10:43:13,981 INFO L633 onniauxMapEliminator]: In Formula: (= 42 (select v_a_4 v_i_5)) InVars {a=v_a_4, i=v_i_5} OutVars{a=v_a_4, i=v_i_5} AuxVars[] AssignedVars[] [2019-05-15 10:43:13,981 INFO L634 onniauxMapEliminator]: Out Formula: (and (or (= v_v_a_4_aux_1 v_a_val_0_in_3) (not (= v_i_5 v_a_idx_0_term_3))) (= 42 v_v_a_4_aux_1) v_a_idx_0_term_assigned_1 (or (= v_i_5 v_a_idx_0_term_3) (not v_a_idx_0_term_assigned_1))) InVars {i=v_i_5, a_val_0=v_a_val_0_in_3, a_idx_0_bool=v_a_idx_0_term_assigned_1, a_idx_0=v_a_idx_0_term_3} OutVars{i=v_i_5, a_val_0=v_a_val_0_in_3, a_idx_0_bool=v_a_idx_0_term_assigned_1, a_idx_0=v_a_idx_0_term_3} AuxVars[v_v_a_4_aux_1] AssignedVars[] [2019-05-15 10:43:13,982 INFO L635 onniauxMapEliminator]: L20 [2019-05-15 10:43:14,039 INFO L202 PluginConnector]: Adding new model ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.05 10:43:14 BasicIcfg [2019-05-15 10:43:14,039 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2019-05-15 10:43:14,041 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-05-15 10:43:14,041 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-05-15 10:43:14,044 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-05-15 10:43:14,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:43:13" (1/3) ... [2019-05-15 10:43:14,046 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@663f4a00 and model type ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.05 10:43:14, skipping insertion in model container [2019-05-15 10:43:14,046 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.05 10:43:13" (2/3) ... [2019-05-15 10:43:14,046 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@663f4a00 and model type ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.05 10:43:14, skipping insertion in model container [2019-05-15 10:43:14,047 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.05 10:43:14" (3/3) ... [2019-05-15 10:43:14,048 INFO L109 eAbstractionObserver]: Analyzing ICFG ValueTerminatedArrayIteration01.bplME [2019-05-15 10:43:14,058 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-05-15 10:43:14,068 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-05-15 10:43:14,085 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-05-15 10:43:14,113 INFO L127 ementStrategyFactory]: Using default assertion order modulation [2019-05-15 10:43:14,114 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-05-15 10:43:14,114 INFO L378 AbstractCegarLoop]: Hoare is false [2019-05-15 10:43:14,115 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-05-15 10:43:14,115 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-05-15 10:43:14,115 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-05-15 10:43:14,115 INFO L382 AbstractCegarLoop]: Difference is false [2019-05-15 10:43:14,115 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-05-15 10:43:14,115 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-05-15 10:43:14,130 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2019-05-15 10:43:14,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-05-15 10:43:14,139 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:43:14,140 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-05-15 10:43:14,142 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:43:14,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:43:14,148 INFO L82 PathProgramCache]: Analyzing trace with hash 41066959, now seen corresponding path program 1 times [2019-05-15 10:43:14,197 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:43:14,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:43:14,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 3 conjunts are in the unsatisfiable core [2019-05-15 10:43:14,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:43:14,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:43:14,447 INFO L273 TraceCheckUtils]: 0: Hoare triple {12#true} [13] mainENTRY-->L15: Formula: (<= 0 v_end_1) InVars {end=v_end_1} OutVars{end=v_end_1} AuxVars[] AssignedVars[] {17#(<= 0 end)} is VALID [2019-05-15 10:43:14,454 INFO L273 TraceCheckUtils]: 1: Hoare triple {17#(<= 0 end)} [14] L15-->L16: Formula: (let ((.cse0 (= v_end_2 v_a_idx_0_term_1))) (and (= v_a_val_0_out_1 v_a_val_0_in_1) (or .cse0 (not v_a_idx_0_term_assigned_1)) (or (= 42 v_a_val_0_in_1) (not .cse0)) v_a_idx_0_term_assigned_1)) InVars {end=v_end_2, a_val_0=v_a_val_0_in_1, a_idx_0_bool=v_a_idx_0_term_assigned_1, a_idx_0=v_a_idx_0_term_1} OutVars{end=v_end_2, a_val_0=v_a_val_0_out_1, a_idx_0_bool=v_a_idx_0_term_assigned_1, a_idx_0=v_a_idx_0_term_1} AuxVars[] AssignedVars[a_val_0] {17#(<= 0 end)} is VALID [2019-05-15 10:43:14,455 INFO L273 TraceCheckUtils]: 2: Hoare triple {17#(<= 0 end)} [15] L16-->L17-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i] {24#(and (<= i 0) (<= 0 end))} is VALID [2019-05-15 10:43:14,463 INFO L273 TraceCheckUtils]: 3: Hoare triple {24#(and (<= i 0) (<= 0 end))} [17] L17-1-->L20: Formula: (let ((.cse0 (= v_i_5 v_a_idx_0_term_3))) (and (or (= v_v_a_4_aux_1 v_a_val_0_in_3) (not .cse0)) (= 42 v_v_a_4_aux_1) v_a_idx_0_term_assigned_1 (or .cse0 (not v_a_idx_0_term_assigned_1)))) InVars {i=v_i_5, a_val_0=v_a_val_0_in_3, a_idx_0_bool=v_a_idx_0_term_assigned_1, a_idx_0=v_a_idx_0_term_3} OutVars{i=v_i_5, a_val_0=v_a_val_0_in_3, a_idx_0_bool=v_a_idx_0_term_assigned_1, a_idx_0=v_a_idx_0_term_3} AuxVars[v_v_a_4_aux_1] AssignedVars[] {24#(and (<= i 0) (<= 0 end))} is VALID [2019-05-15 10:43:14,465 INFO L273 TraceCheckUtils]: 4: Hoare triple {24#(and (<= i 0) (<= 0 end))} [19] L20-->mainErr0ASSERT_VIOLATIONASSERT: Formula: (not (<= v_i_6 v_end_3)) InVars {i=v_i_6, end=v_end_3} OutVars{i=v_i_6, end=v_end_3} AuxVars[] AssignedVars[] {13#false} is VALID [2019-05-15 10:43:14,467 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:14,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-05-15 10:43:14,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-05-15 10:43:14,474 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-05-15 10:43:14,476 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:43:14,479 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-05-15 10:43:14,495 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:43:14,495 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-05-15 10:43:14,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-05-15 10:43:14,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-05-15 10:43:14,506 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 4 states. [2019-05-15 10:43:14,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:43:14,721 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-05-15 10:43:14,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-05-15 10:43:14,721 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-05-15 10:43:14,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:43:14,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-05-15 10:43:14,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2019-05-15 10:43:14,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-05-15 10:43:14,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2019-05-15 10:43:14,730 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 15 transitions. [2019-05-15 10:43:14,828 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:43:14,842 INFO L225 Difference]: With dead ends: 14 [2019-05-15 10:43:14,842 INFO L226 Difference]: Without dead ends: 9 [2019-05-15 10:43:14,844 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-05-15 10:43:14,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-05-15 10:43:14,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2019-05-15 10:43:14,892 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:43:14,893 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9 states. Second operand 8 states. [2019-05-15 10:43:14,894 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 8 states. [2019-05-15 10:43:14,894 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 8 states. [2019-05-15 10:43:14,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:43:14,896 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-05-15 10:43:14,896 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-05-15 10:43:14,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:43:14,898 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:43:14,899 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 9 states. [2019-05-15 10:43:14,899 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 9 states. [2019-05-15 10:43:14,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:43:14,903 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-05-15 10:43:14,903 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-05-15 10:43:14,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:43:14,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:43:14,904 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:43:14,904 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:43:14,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-05-15 10:43:14,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-05-15 10:43:14,910 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 5 [2019-05-15 10:43:14,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:43:14,911 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-05-15 10:43:14,911 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-05-15 10:43:14,911 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-05-15 10:43:14,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-05-15 10:43:14,913 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:43:14,913 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-05-15 10:43:14,913 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:43:14,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:43:14,914 INFO L82 PathProgramCache]: Analyzing trace with hash 810611729, now seen corresponding path program 1 times [2019-05-15 10:43:14,915 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:43:14,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:43:14,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 8 conjunts are in the unsatisfiable core [2019-05-15 10:43:14,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:43:14,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:43:15,069 INFO L273 TraceCheckUtils]: 0: Hoare triple {70#true} [13] mainENTRY-->L15: Formula: (<= 0 v_end_1) InVars {end=v_end_1} OutVars{end=v_end_1} AuxVars[] AssignedVars[] {70#true} is VALID [2019-05-15 10:43:15,070 INFO L273 TraceCheckUtils]: 1: Hoare triple {70#true} [14] L15-->L16: Formula: (let ((.cse0 (= v_end_2 v_a_idx_0_term_1))) (and (= v_a_val_0_out_1 v_a_val_0_in_1) (or .cse0 (not v_a_idx_0_term_assigned_1)) (or (= 42 v_a_val_0_in_1) (not .cse0)) v_a_idx_0_term_assigned_1)) InVars {end=v_end_2, a_val_0=v_a_val_0_in_1, a_idx_0_bool=v_a_idx_0_term_assigned_1, a_idx_0=v_a_idx_0_term_1} OutVars{end=v_end_2, a_val_0=v_a_val_0_out_1, a_idx_0_bool=v_a_idx_0_term_assigned_1, a_idx_0=v_a_idx_0_term_1} AuxVars[] AssignedVars[a_val_0] {78#(and (= a_val_0 42) a_idx_0_bool)} is VALID [2019-05-15 10:43:15,071 INFO L273 TraceCheckUtils]: 2: Hoare triple {78#(and (= a_val_0 42) a_idx_0_bool)} [15] L16-->L17-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i] {78#(and (= a_val_0 42) a_idx_0_bool)} is VALID [2019-05-15 10:43:15,073 INFO L273 TraceCheckUtils]: 3: Hoare triple {78#(and (= a_val_0 42) a_idx_0_bool)} [16] L17-1-->L18: Formula: (let ((.cse0 (= v_i_2 v_a_idx_0_term_2))) (and (or (= v_v_a_3_aux_1 v_a_val_0_in_2) (not .cse0)) (not (= 42 v_v_a_3_aux_1)) (or .cse0 (not v_a_idx_0_term_assigned_1)) v_a_idx_0_term_assigned_1)) InVars {i=v_i_2, a_val_0=v_a_val_0_in_2, a_idx_0_bool=v_a_idx_0_term_assigned_1, a_idx_0=v_a_idx_0_term_2} OutVars{i=v_i_2, a_val_0=v_a_val_0_in_2, a_idx_0_bool=v_a_idx_0_term_assigned_1, a_idx_0=v_a_idx_0_term_2} AuxVars[v_v_a_3_aux_1] AssignedVars[] {71#false} is VALID [2019-05-15 10:43:15,073 INFO L273 TraceCheckUtils]: 4: Hoare triple {71#false} [18] L18-->L17-1: Formula: (= v_i_3 (+ v_i_4 1)) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i] {71#false} is VALID [2019-05-15 10:43:15,074 INFO L273 TraceCheckUtils]: 5: Hoare triple {71#false} [17] L17-1-->L20: Formula: (let ((.cse0 (= v_i_5 v_a_idx_0_term_3))) (and (or (= v_v_a_4_aux_1 v_a_val_0_in_3) (not .cse0)) (= 42 v_v_a_4_aux_1) v_a_idx_0_term_assigned_1 (or .cse0 (not v_a_idx_0_term_assigned_1)))) InVars {i=v_i_5, a_val_0=v_a_val_0_in_3, a_idx_0_bool=v_a_idx_0_term_assigned_1, a_idx_0=v_a_idx_0_term_3} OutVars{i=v_i_5, a_val_0=v_a_val_0_in_3, a_idx_0_bool=v_a_idx_0_term_assigned_1, a_idx_0=v_a_idx_0_term_3} AuxVars[v_v_a_4_aux_1] AssignedVars[] {71#false} is VALID [2019-05-15 10:43:15,074 INFO L273 TraceCheckUtils]: 6: Hoare triple {71#false} [19] L20-->mainErr0ASSERT_VIOLATIONASSERT: Formula: (not (<= v_i_6 v_end_3)) InVars {i=v_i_6, end=v_end_3} OutVars{i=v_i_6, end=v_end_3} AuxVars[] AssignedVars[] {71#false} is VALID [2019-05-15 10:43:15,076 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:43:15,076 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-05-15 10:43:15,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-05-15 10:43:15,078 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-05-15 10:43:15,078 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:43:15,078 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-05-15 10:43:15,123 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:43:15,123 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-05-15 10:43:15,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-05-15 10:43:15,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-05-15 10:43:15,124 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 3 states. [2019-05-15 10:43:15,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:43:15,134 INFO L93 Difference]: Finished difference Result 4 states and 3 transitions. [2019-05-15 10:43:15,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-05-15 10:43:15,134 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-05-15 10:43:15,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:43:15,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-05-15 10:43:15,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-05-15 10:43:15,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-05-15 10:43:15,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-05-15 10:43:15,137 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 4 transitions. [2019-05-15 10:43:15,171 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:43:15,172 INFO L225 Difference]: With dead ends: 4 [2019-05-15 10:43:15,172 INFO L226 Difference]: Without dead ends: 0 [2019-05-15 10:43:15,173 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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:15,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-05-15 10:43:15,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-05-15 10:43:15,173 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:43:15,173 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2019-05-15 10:43:15,173 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-05-15 10:43:15,174 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-05-15 10:43:15,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:43:15,174 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-05-15 10:43:15,174 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-05-15 10:43:15,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:43:15,175 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:43:15,175 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-05-15 10:43:15,175 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-05-15 10:43:15,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:43:15,175 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-05-15 10:43:15,175 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-05-15 10:43:15,175 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:43:15,176 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:43:15,176 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:43:15,176 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:43:15,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-05-15 10:43:15,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-05-15 10:43:15,177 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 7 [2019-05-15 10:43:15,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:43:15,177 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-05-15 10:43:15,177 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-05-15 10:43:15,177 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-05-15 10:43:15,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:43:15,180 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-05-15 10:43:15,182 INFO L202 PluginConnector]: Adding new model ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.05 10:43:15 BasicIcfg [2019-05-15 10:43:15,182 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-05-15 10:43:15,183 INFO L168 Benchmark]: Toolchain (without parser) took 1764.29 ms. Allocated memory was 141.6 MB in the beginning and 175.1 MB in the end (delta: 33.6 MB). Free memory was 111.3 MB in the beginning and 129.9 MB in the end (delta: -18.6 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. [2019-05-15 10:43:15,186 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 141.6 MB. Free memory is still 112.5 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-05-15 10:43:15,187 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.20 ms. Allocated memory is still 141.6 MB. Free memory was 111.3 MB in the beginning and 109.3 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-05-15 10:43:15,188 INFO L168 Benchmark]: Boogie Preprocessor took 22.60 ms. Allocated memory is still 141.6 MB. Free memory was 109.3 MB in the beginning and 108.2 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.2 MB. Max. memory is 7.1 GB. [2019-05-15 10:43:15,190 INFO L168 Benchmark]: RCFGBuilder took 380.53 ms. Allocated memory is still 141.6 MB. Free memory was 108.2 MB in the beginning and 98.2 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2019-05-15 10:43:15,191 INFO L168 Benchmark]: IcfgTransformer took 176.23 ms. Allocated memory is still 141.6 MB. Free memory was 98.2 MB in the beginning and 94.1 MB in the end (delta: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 7.1 GB. [2019-05-15 10:43:15,192 INFO L168 Benchmark]: TraceAbstraction took 1141.75 ms. Allocated memory was 141.6 MB in the beginning and 175.1 MB in the end (delta: 33.6 MB). Free memory was 93.9 MB in the beginning and 129.9 MB in the end (delta: -36.0 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-05-15 10:43:15,198 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.19 ms. Allocated memory is still 141.6 MB. Free memory is still 112.5 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 38.20 ms. Allocated memory is still 141.6 MB. Free memory was 111.3 MB in the beginning and 109.3 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 22.60 ms. Allocated memory is still 141.6 MB. Free memory was 109.3 MB in the beginning and 108.2 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 380.53 ms. Allocated memory is still 141.6 MB. Free memory was 108.2 MB in the beginning and 98.2 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * IcfgTransformer took 176.23 ms. Allocated memory is still 141.6 MB. Free memory was 98.2 MB in the beginning and 94.1 MB in the end (delta: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1141.75 ms. Allocated memory was 141.6 MB in the beginning and 175.1 MB in the end (delta: 33.6 MB). Free memory was 93.9 MB in the beginning and 129.9 MB in the end (delta: -36.0 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 20]: 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, 9 locations, 1 error locations. SAFE Result, 1.0s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5 SDtfs, 14 SDslu, 3 SDs, 0 SdLazy, 14 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9occurred 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, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 12 NumberOfCodeBlocks, 12 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 10 ConstructedInterpolants, 0 QuantifiedInterpolants, 164 SizeOfPredicates, 5 NumberOfNonLiveVariables, 38 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 1/1 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...