java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/programs/20181010-MemSafetyPathprograms/alternating_list_true-unreach-call_true-valid-memsafety.i_40.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:01:14,226 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:01:14,230 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:01:14,244 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:01:14,244 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:01:14,246 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:01:14,248 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:01:14,250 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:01:14,254 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:01:14,259 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:01:14,260 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:01:14,260 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:01:14,260 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:01:14,261 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:01:14,262 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:01:14,263 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:01:14,264 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:01:14,265 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:01:14,266 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:01:14,268 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:01:14,270 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:01:14,271 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:01:14,272 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:01:14,272 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:01:14,275 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:01:14,275 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:01:14,275 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:01:14,276 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:01:14,276 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:01:14,277 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:01:14,277 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:01:14,278 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:01:14,279 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:01:14,280 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:01:14,281 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:01:14,281 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:01:14,281 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:01:14,282 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:01:14,282 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:01:14,283 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:01:14,284 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:01:14,315 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:01:14,331 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:01:14,335 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:01:14,337 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:01:14,338 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:01:14,339 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/alternating_list_true-unreach-call_true-valid-memsafety.i_40.bpl [2019-08-05 11:01:14,339 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/alternating_list_true-unreach-call_true-valid-memsafety.i_40.bpl' [2019-08-05 11:01:14,414 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:01:14,415 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:01:14,416 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:01:14,416 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:01:14,416 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:01:14,434 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "alternating_list_true-unreach-call_true-valid-memsafety.i_40.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:01:14" (1/1) ... [2019-08-05 11:01:14,460 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "alternating_list_true-unreach-call_true-valid-memsafety.i_40.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:01:14" (1/1) ... [2019-08-05 11:01:14,471 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:01:14,472 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:01:14,472 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:01:14,473 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:01:14,483 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "alternating_list_true-unreach-call_true-valid-memsafety.i_40.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:01:14" (1/1) ... [2019-08-05 11:01:14,484 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "alternating_list_true-unreach-call_true-valid-memsafety.i_40.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:01:14" (1/1) ... [2019-08-05 11:01:14,490 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "alternating_list_true-unreach-call_true-valid-memsafety.i_40.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:01:14" (1/1) ... [2019-08-05 11:01:14,491 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "alternating_list_true-unreach-call_true-valid-memsafety.i_40.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:01:14" (1/1) ... [2019-08-05 11:01:14,511 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "alternating_list_true-unreach-call_true-valid-memsafety.i_40.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:01:14" (1/1) ... [2019-08-05 11:01:14,516 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "alternating_list_true-unreach-call_true-valid-memsafety.i_40.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:01:14" (1/1) ... [2019-08-05 11:01:14,517 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "alternating_list_true-unreach-call_true-valid-memsafety.i_40.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:01:14" (1/1) ... [2019-08-05 11:01:14,528 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:01:14,529 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:01:14,529 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:01:14,530 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:01:14,530 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "alternating_list_true-unreach-call_true-valid-memsafety.i_40.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:01:14" (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-08-05 11:01:14,607 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-08-05 11:01:14,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 11:01:14,607 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 11:01:15,096 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 11:01:15,096 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 11:01:15,097 INFO L202 PluginConnector]: Adding new model alternating_list_true-unreach-call_true-valid-memsafety.i_40.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:01:15 BoogieIcfgContainer [2019-08-05 11:01:15,098 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:01:15,105 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:01:15,105 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:01:15,112 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:01:15,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "alternating_list_true-unreach-call_true-valid-memsafety.i_40.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:01:14" (1/2) ... [2019-08-05 11:01:15,114 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b5d621c and model type alternating_list_true-unreach-call_true-valid-memsafety.i_40.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:01:15, skipping insertion in model container [2019-08-05 11:01:15,114 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "alternating_list_true-unreach-call_true-valid-memsafety.i_40.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:01:15" (2/2) ... [2019-08-05 11:01:15,116 INFO L109 eAbstractionObserver]: Analyzing ICFG alternating_list_true-unreach-call_true-valid-memsafety.i_40.bpl [2019-08-05 11:01:15,126 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:01:15,134 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 11:01:15,151 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 11:01:15,181 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:01:15,182 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:01:15,182 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:01:15,182 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:01:15,183 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:01:15,183 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:01:15,183 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:01:15,183 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:01:15,183 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:01:15,196 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states. [2019-08-05 11:01:15,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 11:01:15,204 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:15,205 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:01:15,207 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:15,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:15,214 INFO L82 PathProgramCache]: Analyzing trace with hash 148998095, now seen corresponding path program 1 times [2019-08-05 11:01:15,263 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:15,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:15,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:01:15,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:15,487 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:01:15,488 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:15,529 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:15,530 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:01:15,531 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-08-05 11:01:15,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:01:15,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:01:15,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 11:01:15,675 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:01:15,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:01:15,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:01:15,695 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 5 states. [2019-08-05 11:01:16,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:16,134 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2019-08-05 11:01:16,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 11:01:16,137 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-08-05 11:01:16,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:16,147 INFO L225 Difference]: With dead ends: 21 [2019-08-05 11:01:16,147 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 11:01:16,149 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:01:16,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 11:01:16,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 11. [2019-08-05 11:01:16,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 11:01:16,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2019-08-05 11:01:16,185 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 8 [2019-08-05 11:01:16,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:16,185 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2019-08-05 11:01:16,185 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:01:16,186 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2019-08-05 11:01:16,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 11:01:16,186 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:16,186 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:01:16,187 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:16,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:16,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1453301129, now seen corresponding path program 1 times [2019-08-05 11:01:16,188 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:16,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:16,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:01:16,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:16,385 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-08-05 11:01:16,385 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:16,493 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 11:01:16,494 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:16,495 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:01:16,495 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2019-08-05 11:01:16,568 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:01:16,568 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:01:16,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 11:01:16,570 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:01:16,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:01:16,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:01:16,571 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand 5 states. [2019-08-05 11:01:16,773 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 19 [2019-08-05 11:01:16,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:16,960 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2019-08-05 11:01:16,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:01:16,962 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-08-05 11:01:16,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:16,962 INFO L225 Difference]: With dead ends: 16 [2019-08-05 11:01:16,962 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 11:01:16,963 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:01:16,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 11:01:16,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 11:01:16,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 11:01:16,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2019-08-05 11:01:16,967 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 10 [2019-08-05 11:01:16,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:16,967 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2019-08-05 11:01:16,967 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:01:16,967 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2019-08-05 11:01:16,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 11:01:16,968 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:16,968 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:01:16,968 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:16,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:16,969 INFO L82 PathProgramCache]: Analyzing trace with hash 2085806019, now seen corresponding path program 1 times [2019-08-05 11:01:16,970 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:17,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:17,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 11:01:17,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:17,350 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-08-05 11:01:17,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:01:17,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-08-05 11:01:17,352 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:01:17,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:01:17,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:01:17,353 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand 6 states. [2019-08-05 11:01:17,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:17,650 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2019-08-05 11:01:17,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 11:01:17,651 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2019-08-05 11:01:17,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:17,652 INFO L225 Difference]: With dead ends: 16 [2019-08-05 11:01:17,652 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 11:01:17,652 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:01:17,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 11:01:17,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 11:01:17,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 11:01:17,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2019-08-05 11:01:17,656 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 12 [2019-08-05 11:01:17,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:17,656 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-08-05 11:01:17,656 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:01:17,656 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2019-08-05 11:01:17,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 11:01:17,657 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:17,657 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:01:17,658 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:17,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:17,658 INFO L82 PathProgramCache]: Analyzing trace with hash -895823363, now seen corresponding path program 1 times [2019-08-05 11:01:17,659 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:17,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:17,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-05 11:01:17,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:17,977 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-08-05 11:01:17,977 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:18,023 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:18,029 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-08-05 11:01:18,030 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:18,037 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:18,038 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:01:18,038 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:9 [2019-08-05 11:01:18,327 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2019-08-05 11:01:18,328 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:18,364 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:18,369 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-08-05 11:01:18,370 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:18,382 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:18,384 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:01:18,384 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:43, output treesize:17 [2019-08-05 11:01:18,438 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:01:18,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:18,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:01:18,439 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 11:01:18,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 11:01:18,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:01:18,440 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand 10 states. [2019-08-05 11:01:19,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:19,056 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2019-08-05 11:01:19,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 11:01:19,056 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 14 [2019-08-05 11:01:19,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:19,058 INFO L225 Difference]: With dead ends: 27 [2019-08-05 11:01:19,058 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 11:01:19,059 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:01:19,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 11:01:19,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 11:01:19,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 11:01:19,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2019-08-05 11:01:19,067 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 14 [2019-08-05 11:01:19,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:19,067 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2019-08-05 11:01:19,068 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 11:01:19,068 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2019-08-05 11:01:19,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 11:01:19,069 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:19,069 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-08-05 11:01:19,069 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:19,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:19,070 INFO L82 PathProgramCache]: Analyzing trace with hash -778941327, now seen corresponding path program 2 times [2019-08-05 11:01:19,071 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:19,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:19,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:01:19,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:19,121 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-08-05 11:01:19,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:01:19,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 11:01:19,122 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:01:19,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:01:19,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:01:19,123 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 3 states. [2019-08-05 11:01:19,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:19,136 INFO L93 Difference]: Finished difference Result 5 states and 4 transitions. [2019-08-05 11:01:19,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:01:19,136 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-08-05 11:01:19,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:19,136 INFO L225 Difference]: With dead ends: 5 [2019-08-05 11:01:19,136 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 11:01:19,137 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 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-08-05 11:01:19,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 11:01:19,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 11:01:19,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 11:01:19,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 11:01:19,138 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2019-08-05 11:01:19,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:19,138 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 11:01:19,138 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:01:19,138 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 11:01:19,138 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 11:01:19,143 INFO L202 PluginConnector]: Adding new model alternating_list_true-unreach-call_true-valid-memsafety.i_40.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:01:19 BoogieIcfgContainer [2019-08-05 11:01:19,143 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:01:19,145 INFO L168 Benchmark]: Toolchain (without parser) took 4729.85 ms. Allocated memory was 135.3 MB in the beginning and 198.2 MB in the end (delta: 62.9 MB). Free memory was 110.8 MB in the beginning and 109.8 MB in the end (delta: 970.6 kB). Peak memory consumption was 63.9 MB. Max. memory is 7.1 GB. [2019-08-05 11:01:19,146 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 135.3 MB. Free memory was 112.8 MB in the beginning and 112.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-08-05 11:01:19,147 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.89 ms. Allocated memory is still 135.3 MB. Free memory was 110.8 MB in the beginning and 108.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-08-05 11:01:19,148 INFO L168 Benchmark]: Boogie Preprocessor took 56.50 ms. Allocated memory is still 135.3 MB. Free memory was 108.8 MB in the beginning and 107.4 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2019-08-05 11:01:19,149 INFO L168 Benchmark]: RCFGBuilder took 569.22 ms. Allocated memory is still 135.3 MB. Free memory was 107.2 MB in the beginning and 89.9 MB in the end (delta: 17.3 MB). Peak memory consumption was 17.3 MB. Max. memory is 7.1 GB. [2019-08-05 11:01:19,150 INFO L168 Benchmark]: TraceAbstraction took 4038.72 ms. Allocated memory was 135.3 MB in the beginning and 198.2 MB in the end (delta: 62.9 MB). Free memory was 89.7 MB in the beginning and 109.8 MB in the end (delta: -20.1 MB). Peak memory consumption was 42.8 MB. Max. memory is 7.1 GB. [2019-08-05 11:01:19,154 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 135.3 MB. Free memory was 112.8 MB in the beginning and 112.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 55.89 ms. Allocated memory is still 135.3 MB. Free memory was 110.8 MB in the beginning and 108.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 56.50 ms. Allocated memory is still 135.3 MB. Free memory was 108.8 MB in the beginning and 107.4 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 569.22 ms. Allocated memory is still 135.3 MB. Free memory was 107.2 MB in the beginning and 89.9 MB in the end (delta: 17.3 MB). Peak memory consumption was 17.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4038.72 ms. Allocated memory was 135.3 MB in the beginning and 198.2 MB in the end (delta: 62.9 MB). Free memory was 89.7 MB in the beginning and 109.8 MB in the end (delta: -20.1 MB). Peak memory consumption was 42.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 242]: 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, 10 locations, 1 error locations. SAFE Result, 3.9s OverallTime, 5 OverallIterations, 3 TraceHistogramMax, 1.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 25 SDtfs, 53 SDslu, 50 SDs, 0 SdLazy, 160 SolverSat, 48 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 69 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred in iteration=4, 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, 5 MinimizatonAttempts, 10 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 62 NumberOfCodeBlocks, 62 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 57 ConstructedInterpolants, 9 QuantifiedInterpolants, 5051 SizeOfPredicates, 87 NumberOfNonLiveVariables, 1202 ConjunctsInSsa, 149 ConjunctsInUnsatCore, 5 InterpolantComputations, 4 PerfectInterpolantSequences, 21/26 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...