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/PointerIncrement-simplified03.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1c58c86 [2019-05-15 10:43:12,139 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-05-15 10:43:12,141 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-05-15 10:43:12,153 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-05-15 10:43:12,153 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-05-15 10:43:12,154 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-05-15 10:43:12,156 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-05-15 10:43:12,158 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-05-15 10:43:12,159 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-05-15 10:43:12,160 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-05-15 10:43:12,161 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-05-15 10:43:12,162 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-05-15 10:43:12,163 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-05-15 10:43:12,164 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-05-15 10:43:12,165 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-05-15 10:43:12,166 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-05-15 10:43:12,167 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-05-15 10:43:12,169 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-05-15 10:43:12,171 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-05-15 10:43:12,172 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-05-15 10:43:12,174 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-05-15 10:43:12,175 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-05-15 10:43:12,177 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-05-15 10:43:12,178 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-05-15 10:43:12,178 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-05-15 10:43:12,179 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-05-15 10:43:12,179 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-05-15 10:43:12,180 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-05-15 10:43:12,180 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-05-15 10:43:12,181 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-05-15 10:43:12,182 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-05-15 10:43:12,183 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-05-15 10:43:12,184 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-05-15 10:43:12,184 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-05-15 10:43:12,185 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-05-15 10:43:12,185 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-05-15 10:43:12,186 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-05-15 10:43:12,187 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-05-15 10:43:12,187 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:12,230 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-05-15 10:43:12,245 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-05-15 10:43:12,249 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-05-15 10:43:12,251 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-05-15 10:43:12,251 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-05-15 10:43:12,252 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified03.bpl [2019-05-15 10:43:12,252 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified03.bpl' [2019-05-15 10:43:12,312 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-05-15 10:43:12,314 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-05-15 10:43:12,315 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-05-15 10:43:12,315 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-05-15 10:43:12,315 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-05-15 10:43:12,333 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:43:12" (1/1) ... [2019-05-15 10:43:12,346 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:43:12" (1/1) ... [2019-05-15 10:43:12,353 WARN L165 Inliner]: Program contained no entry procedure! [2019-05-15 10:43:12,354 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-05-15 10:43:12,354 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-05-15 10:43:12,356 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-05-15 10:43:12,357 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-05-15 10:43:12,357 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-05-15 10:43:12,357 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-05-15 10:43:12,368 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:43:12" (1/1) ... [2019-05-15 10:43:12,368 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:43:12" (1/1) ... [2019-05-15 10:43:12,369 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:43:12" (1/1) ... [2019-05-15 10:43:12,370 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:43:12" (1/1) ... [2019-05-15 10:43:12,375 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:43:12" (1/1) ... [2019-05-15 10:43:12,379 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:43:12" (1/1) ... [2019-05-15 10:43:12,380 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:43:12" (1/1) ... [2019-05-15 10:43:12,382 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-05-15 10:43:12,382 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-05-15 10:43:12,382 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-05-15 10:43:12,383 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-05-15 10:43:12,384 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:43:12" (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:12,454 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-05-15 10:43:12,455 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-05-15 10:43:12,455 INFO L130 BoogieDeclarations]: Found specification of procedure ~malloc [2019-05-15 10:43:12,879 INFO L275 CfgBuilder]: Using library mode [2019-05-15 10:43:12,880 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-05-15 10:43:12,883 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.05 10:43:12 BoogieIcfgContainer [2019-05-15 10:43:12,884 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-05-15 10:43:12,884 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2019-05-15 10:43:12,884 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2019-05-15 10:43:12,885 INFO L275 PluginConnector]: IcfgTransformer initialized [2019-05-15 10:43:12,889 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.05 10:43:12" (1/1) ... [2019-05-15 10:43:12,940 INFO L632 onniauxMapEliminator]: mainENTRY [2019-05-15 10:43:12,941 INFO L633 onniauxMapEliminator]: In Formula: (and (not (= 0 v_main_p.base_1)) (not (select |v_#valid_2| v_main_p.base_1)) (= (store |v_#length_2| v_main_p.base_1 400) |v_#length_1|) (= (store |v_#valid_2| v_main_p.base_1 true) |v_#valid_1|) (= 0 v_main_p.offset_1)) InVars {#valid=|v_#valid_2|, #length=|v_#length_2|} OutVars{main_p.offset=v_main_p.offset_1, #valid=|v_#valid_1|, #length=|v_#length_1|, main_p.base=v_main_p.base_1} AuxVars[] AssignedVars[main_p.offset, #valid, #length, main_p.base] [2019-05-15 10:43:12,941 INFO L634 onniauxMapEliminator]: Out Formula: (and (not (= 0 v_main_p.base_1)) (or (not (= |v_#length_idx_0_term_1| v_main_p.base_1)) (= |v_#length_val_0_in_1| 400)) (or (= |v_#valid_idx_0_term_1| v_main_p.base_1) (not |v_#valid_idx_0_term_assigned_1|)) |v_#length_idx_0_term_assigned_1| (not |v_v_#valid_2_aux_1|) (or |v_#valid_val_0_in_1| (not (= |v_#valid_idx_0_term_1| v_main_p.base_1))) (= |v_#length_val_0_in_1| |v_#length_val_0_out_1|) |v_#valid_idx_0_term_assigned_1| (or (not |v_#length_idx_0_term_assigned_1|) (= |v_#length_idx_0_term_1| v_main_p.base_1)) (or (= |v_#valid_val_0_in_1| |v_v_#valid_2_aux_1|) (not (= |v_#valid_idx_0_term_1| v_main_p.base_1))) (= |v_#valid_val_0_in_1| |v_#valid_val_0_out_1|) (= 0 v_main_p.offset_1)) InVars {#valid_idx_0=|v_#valid_idx_0_term_1|, #length_val_0=|v_#length_val_0_in_1|, #valid_idx_0_bool=|v_#valid_idx_0_term_assigned_1|, #length_idx_0_bool=|v_#length_idx_0_term_assigned_1|, #length_idx_0=|v_#length_idx_0_term_1|, #valid_val_0=|v_#valid_val_0_in_1|} OutVars{#valid_idx_0=|v_#valid_idx_0_term_1|, main_p.offset=v_main_p.offset_1, #length_val_0=|v_#length_val_0_out_1|, #valid_idx_0_bool=|v_#valid_idx_0_term_assigned_1|, #length_idx_0_bool=|v_#length_idx_0_term_assigned_1|, #length_idx_0=|v_#length_idx_0_term_1|, #valid_val_0=|v_#valid_val_0_out_1|, main_p.base=v_main_p.base_1} AuxVars[|v_v_#valid_2_aux_1|] AssignedVars[main_p.offset, #length_val_0, #valid_val_0, main_p.base] [2019-05-15 10:43:12,941 INFO L635 onniauxMapEliminator]: L10 [2019-05-15 10:43:12,995 INFO L632 onniauxMapEliminator]: L15 [2019-05-15 10:43:12,996 INFO L633 onniauxMapEliminator]: In Formula: (not (<= (+ v_main_q.offset_3 4) (select |v_#length_3| v_main_q.base_2))) InVars {main_q.offset=v_main_q.offset_3, #length=|v_#length_3|, main_q.base=v_main_q.base_2} OutVars{main_q.offset=v_main_q.offset_3, #length=|v_#length_3|, main_q.base=v_main_q.base_2} AuxVars[] AssignedVars[] [2019-05-15 10:43:12,997 INFO L634 onniauxMapEliminator]: Out Formula: (and (or (not |v_#length_idx_0_term_assigned_1|) (= v_main_q.base_2 |v_#length_idx_0_term_2|)) |v_#length_idx_0_term_assigned_1| (not (<= (+ v_main_q.offset_3 4) |v_v_#length_3_aux_1|)) (or (= |v_#length_val_0_in_2| |v_v_#length_3_aux_1|) (not (= v_main_q.base_2 |v_#length_idx_0_term_2|)))) InVars {#length_val_0=|v_#length_val_0_in_2|, main_q.offset=v_main_q.offset_3, #length_idx_0_bool=|v_#length_idx_0_term_assigned_1|, #length_idx_0=|v_#length_idx_0_term_2|, main_q.base=v_main_q.base_2} OutVars{#length_val_0=|v_#length_val_0_in_2|, main_q.offset=v_main_q.offset_3, #length_idx_0_bool=|v_#length_idx_0_term_assigned_1|, #length_idx_0=|v_#length_idx_0_term_2|, main_q.base=v_main_q.base_2} AuxVars[|v_v_#length_3_aux_1|] AssignedVars[] [2019-05-15 10:43:12,997 INFO L635 onniauxMapEliminator]: mainErr0ASSERT_VIOLATIONASSERT [2019-05-15 10:43:13,021 INFO L632 onniauxMapEliminator]: L15 [2019-05-15 10:43:13,022 INFO L633 onniauxMapEliminator]: In Formula: (<= (+ v_main_q.offset_4 4) (select |v_#length_4| v_main_q.base_3)) InVars {main_q.offset=v_main_q.offset_4, #length=|v_#length_4|, main_q.base=v_main_q.base_3} OutVars{main_q.offset=v_main_q.offset_4, #length=|v_#length_4|, main_q.base=v_main_q.base_3} AuxVars[] AssignedVars[] [2019-05-15 10:43:13,022 INFO L634 onniauxMapEliminator]: Out Formula: (and (or (not |v_#length_idx_0_term_assigned_1|) (= v_main_q.base_3 |v_#length_idx_0_term_3|)) |v_#length_idx_0_term_assigned_1| (<= (+ v_main_q.offset_4 4) |v_v_#length_4_aux_1|) (or (= |v_#length_val_0_in_3| |v_v_#length_4_aux_1|) (not (= v_main_q.base_3 |v_#length_idx_0_term_3|)))) InVars {#length_val_0=|v_#length_val_0_in_3|, main_q.offset=v_main_q.offset_4, #length_idx_0_bool=|v_#length_idx_0_term_assigned_1|, #length_idx_0=|v_#length_idx_0_term_3|, main_q.base=v_main_q.base_3} OutVars{#length_val_0=|v_#length_val_0_in_3|, main_q.offset=v_main_q.offset_4, #length_idx_0_bool=|v_#length_idx_0_term_assigned_1|, #length_idx_0=|v_#length_idx_0_term_3|, main_q.base=v_main_q.base_3} AuxVars[|v_v_#length_4_aux_1|] AssignedVars[] [2019-05-15 10:43:13,022 INFO L635 onniauxMapEliminator]: L14 [2019-05-15 10:43:13,039 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.05 10:43:13 BasicIcfg [2019-05-15 10:43:13,039 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2019-05-15 10:43:13,040 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-05-15 10:43:13,041 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-05-15 10:43:13,044 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-05-15 10:43:13,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:43:12" (1/3) ... [2019-05-15 10:43:13,045 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ccf0b67 and model type PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.05 10:43:13, skipping insertion in model container [2019-05-15 10:43:13,046 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.05 10:43:12" (2/3) ... [2019-05-15 10:43:13,046 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ccf0b67 and model type PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.05 10:43:13, skipping insertion in model container [2019-05-15 10:43:13,046 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.05 10:43:13" (3/3) ... [2019-05-15 10:43:13,048 INFO L109 eAbstractionObserver]: Analyzing ICFG PointerIncrement-simplified03.bplME [2019-05-15 10:43:13,058 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-05-15 10:43:13,066 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-05-15 10:43:13,082 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-05-15 10:43:13,110 INFO L127 ementStrategyFactory]: Using default assertion order modulation [2019-05-15 10:43:13,110 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-05-15 10:43:13,111 INFO L378 AbstractCegarLoop]: Hoare is false [2019-05-15 10:43:13,111 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-05-15 10:43:13,111 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-05-15 10:43:13,111 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-05-15 10:43:13,111 INFO L382 AbstractCegarLoop]: Difference is false [2019-05-15 10:43:13,111 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-05-15 10:43:13,112 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-05-15 10:43:13,125 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states. [2019-05-15 10:43:13,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-05-15 10:43:13,133 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:43:13,134 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-05-15 10:43:13,135 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:43:13,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:43:13,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1478693, now seen corresponding path program 1 times [2019-05-15 10:43:13,185 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:43:13,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:43:13,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 5 conjunts are in the unsatisfiable core [2019-05-15 10:43:13,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:43:13,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:43:13,300 INFO L273 TraceCheckUtils]: 0: Hoare triple {11#true} [18] mainENTRY-->L10: Formula: (let ((.cse1 (= |v_#valid_idx_0_term_1| v_main_p.base_1))) (let ((.cse0 (= |v_#length_idx_0_term_1| v_main_p.base_1)) (.cse2 (not .cse1))) (and (not (= 0 v_main_p.base_1)) (or (not .cse0) (= |v_#length_val_0_in_1| 400)) (or .cse1 (not |v_#valid_idx_0_term_assigned_1|)) |v_#length_idx_0_term_assigned_1| (not |v_v_#valid_2_aux_1|) (or |v_#valid_val_0_in_1| .cse2) (= |v_#length_val_0_in_1| |v_#length_val_0_out_1|) |v_#valid_idx_0_term_assigned_1| (or (not |v_#length_idx_0_term_assigned_1|) .cse0) (or (= |v_#valid_val_0_in_1| |v_v_#valid_2_aux_1|) .cse2) (= |v_#valid_val_0_in_1| |v_#valid_val_0_out_1|) (= 0 v_main_p.offset_1)))) InVars {#valid_idx_0=|v_#valid_idx_0_term_1|, #length_val_0=|v_#length_val_0_in_1|, #valid_idx_0_bool=|v_#valid_idx_0_term_assigned_1|, #length_idx_0_bool=|v_#length_idx_0_term_assigned_1|, #length_idx_0=|v_#length_idx_0_term_1|, #valid_val_0=|v_#valid_val_0_in_1|} OutVars{#valid_idx_0=|v_#valid_idx_0_term_1|, main_p.offset=v_main_p.offset_1, #length_val_0=|v_#length_val_0_out_1|, #valid_idx_0_bool=|v_#valid_idx_0_term_assigned_1|, #length_idx_0_bool=|v_#length_idx_0_term_assigned_1|, #length_idx_0=|v_#length_idx_0_term_1|, #valid_val_0=|v_#valid_val_0_out_1|, main_p.base=v_main_p.base_1} AuxVars[|v_v_#valid_2_aux_1|] AssignedVars[main_p.offset, #length_val_0, #valid_val_0, main_p.base] {12#false} is VALID [2019-05-15 10:43:13,302 INFO L273 TraceCheckUtils]: 1: Hoare triple {12#false} [19] L10-->L12-1: Formula: (and (= v_main_q.base_1 v_main_p.base_2) (= v_main_q.offset_1 v_main_p.offset_2)) InVars {main_p.offset=v_main_p.offset_2, main_p.base=v_main_p.base_2} OutVars{main_p.offset=v_main_p.offset_2, main_q.offset=v_main_q.offset_1, main_q.base=v_main_q.base_1, main_p.base=v_main_p.base_2} AuxVars[] AssignedVars[main_q.offset, main_q.base] {12#false} is VALID [2019-05-15 10:43:13,303 INFO L273 TraceCheckUtils]: 2: Hoare triple {12#false} [21] L12-1-->L15: Formula: (< v_main_q.offset_2 (+ v_main_p.offset_3 400)) InVars {main_p.offset=v_main_p.offset_3, main_q.offset=v_main_q.offset_2} OutVars{main_p.offset=v_main_p.offset_3, main_q.offset=v_main_q.offset_2} AuxVars[] AssignedVars[] {12#false} is VALID [2019-05-15 10:43:13,303 INFO L273 TraceCheckUtils]: 3: Hoare triple {12#false} [24] L15-->mainErr0ASSERT_VIOLATIONASSERT: Formula: (let ((.cse0 (= v_main_q.base_2 |v_#length_idx_0_term_2|))) (and (or (not |v_#length_idx_0_term_assigned_1|) .cse0) |v_#length_idx_0_term_assigned_1| (not (<= (+ v_main_q.offset_3 4) |v_v_#length_3_aux_1|)) (or (= |v_#length_val_0_in_2| |v_v_#length_3_aux_1|) (not .cse0)))) InVars {#length_val_0=|v_#length_val_0_in_2|, main_q.offset=v_main_q.offset_3, #length_idx_0_bool=|v_#length_idx_0_term_assigned_1|, #length_idx_0=|v_#length_idx_0_term_2|, main_q.base=v_main_q.base_2} OutVars{#length_val_0=|v_#length_val_0_in_2|, main_q.offset=v_main_q.offset_3, #length_idx_0_bool=|v_#length_idx_0_term_assigned_1|, #length_idx_0=|v_#length_idx_0_term_2|, main_q.base=v_main_q.base_2} AuxVars[|v_v_#length_3_aux_1|] AssignedVars[] {12#false} is VALID [2019-05-15 10:43:13,308 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:13,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-05-15 10:43:13,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-05-15 10:43:13,317 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 4 [2019-05-15 10:43:13,319 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:43:13,323 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2019-05-15 10:43:13,381 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:13,382 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-05-15 10:43:13,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-05-15 10:43:13,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-05-15 10:43:13,394 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 2 states. [2019-05-15 10:43:13,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:43:13,405 INFO L93 Difference]: Finished difference Result 1 states and 0 transitions. [2019-05-15 10:43:13,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-05-15 10:43:13,405 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 4 [2019-05-15 10:43:13,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:43:13,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-05-15 10:43:13,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 1 transitions. [2019-05-15 10:43:13,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-05-15 10:43:13,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 1 transitions. [2019-05-15 10:43:13,408 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 1 transitions. [2019-05-15 10:43:13,412 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 1 edges. 1 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:43:13,419 INFO L225 Difference]: With dead ends: 1 [2019-05-15 10:43:13,419 INFO L226 Difference]: Without dead ends: 0 [2019-05-15 10:43:13,421 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-05-15 10:43:13,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-05-15 10:43:13,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-05-15 10:43:13,445 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:43:13,446 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2019-05-15 10:43:13,446 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-05-15 10:43:13,447 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-05-15 10:43:13,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:43:13,447 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-05-15 10:43:13,448 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-05-15 10:43:13,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:43:13,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:43:13,449 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-05-15 10:43:13,449 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-05-15 10:43:13,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:43:13,449 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-05-15 10:43:13,450 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-05-15 10:43:13,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:43:13,450 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:43:13,450 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:43:13,451 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:43:13,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-05-15 10:43:13,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-05-15 10:43:13,452 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 4 [2019-05-15 10:43:13,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:43:13,453 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-05-15 10:43:13,453 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-05-15 10:43:13,453 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-05-15 10:43:13,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:43:13,457 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-05-15 10:43:13,459 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.05 10:43:13 BasicIcfg [2019-05-15 10:43:13,459 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-05-15 10:43:13,460 INFO L168 Benchmark]: Toolchain (without parser) took 1147.27 ms. Allocated memory is still 132.6 MB. Free memory was 110.0 MB in the beginning and 67.5 MB in the end (delta: 42.5 MB). Peak memory consumption was 42.5 MB. Max. memory is 7.1 GB. [2019-05-15 10:43:13,462 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 132.6 MB. Free memory is still 111.4 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-05-15 10:43:13,463 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.44 ms. Allocated memory is still 132.6 MB. Free memory was 110.0 MB in the beginning and 108.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-05-15 10:43:13,465 INFO L168 Benchmark]: Boogie Preprocessor took 25.16 ms. Allocated memory is still 132.6 MB. Free memory was 108.0 MB in the beginning and 106.8 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-05-15 10:43:13,466 INFO L168 Benchmark]: RCFGBuilder took 501.50 ms. Allocated memory is still 132.6 MB. Free memory was 106.8 MB in the beginning and 95.1 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 7.1 GB. [2019-05-15 10:43:13,467 INFO L168 Benchmark]: IcfgTransformer took 155.09 ms. Allocated memory is still 132.6 MB. Free memory was 95.1 MB in the beginning and 90.1 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 7.1 GB. [2019-05-15 10:43:13,468 INFO L168 Benchmark]: TraceAbstraction took 418.69 ms. Allocated memory is still 132.6 MB. Free memory was 89.7 MB in the beginning and 67.5 MB in the end (delta: 22.2 MB). Peak memory consumption was 22.2 MB. Max. memory is 7.1 GB. [2019-05-15 10:43:13,473 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 132.6 MB. Free memory is still 111.4 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 41.44 ms. Allocated memory is still 132.6 MB. Free memory was 110.0 MB in the beginning and 108.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 25.16 ms. Allocated memory is still 132.6 MB. Free memory was 108.0 MB in the beginning and 106.8 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 501.50 ms. Allocated memory is still 132.6 MB. Free memory was 106.8 MB in the beginning and 95.1 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 7.1 GB. * IcfgTransformer took 155.09 ms. Allocated memory is still 132.6 MB. Free memory was 95.1 MB in the beginning and 90.1 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 418.69 ms. Allocated memory is still 132.6 MB. Free memory was 89.7 MB in the beginning and 67.5 MB in the end (delta: 22.2 MB). Peak memory consumption was 22.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 15]: 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, 8 locations, 1 error locations. SAFE Result, 0.3s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 0 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8occurred 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 4 NumberOfCodeBlocks, 4 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 3 ConstructedInterpolants, 0 QuantifiedInterpolants, 9 SizeOfPredicates, 3 NumberOfNonLiveVariables, 25 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...