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_26.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:54:58,462 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:54:58,466 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:54:58,481 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:54:58,482 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:54:58,483 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:54:58,485 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:54:58,488 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:54:58,490 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:54:58,492 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:54:58,494 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:54:58,495 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:54:58,495 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:54:58,496 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:54:58,497 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:54:58,501 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:54:58,501 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:54:58,509 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:54:58,512 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:54:58,515 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:54:58,517 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:54:58,519 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:54:58,521 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:54:58,522 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:54:58,525 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:54:58,525 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:54:58,525 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:54:58,526 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:54:58,527 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:54:58,530 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:54:58,530 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:54:58,531 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:54:58,532 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:54:58,533 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:54:58,535 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:54:58,536 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:54:58,537 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:54:58,537 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:54:58,537 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:54:58,538 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:54:58,539 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:54:58,576 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:54:58,590 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:54:58,595 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:54:58,597 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:54:58,598 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:54:58,598 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_26.bpl [2019-08-05 10:54:58,599 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_26.bpl' [2019-08-05 10:54:58,681 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:54:58,683 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:54:58,684 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:54:58,684 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:54:58,684 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:54:58,703 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "alternating_list_true-unreach-call_true-valid-memsafety.i_26.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:54:58" (1/1) ... [2019-08-05 10:54:58,727 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "alternating_list_true-unreach-call_true-valid-memsafety.i_26.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:54:58" (1/1) ... [2019-08-05 10:54:58,738 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:54:58,739 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:54:58,739 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:54:58,739 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:54:58,749 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "alternating_list_true-unreach-call_true-valid-memsafety.i_26.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:54:58" (1/1) ... [2019-08-05 10:54:58,750 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "alternating_list_true-unreach-call_true-valid-memsafety.i_26.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:54:58" (1/1) ... [2019-08-05 10:54:58,755 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "alternating_list_true-unreach-call_true-valid-memsafety.i_26.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:54:58" (1/1) ... [2019-08-05 10:54:58,755 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "alternating_list_true-unreach-call_true-valid-memsafety.i_26.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:54:58" (1/1) ... [2019-08-05 10:54:58,763 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "alternating_list_true-unreach-call_true-valid-memsafety.i_26.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:54:58" (1/1) ... [2019-08-05 10:54:58,765 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "alternating_list_true-unreach-call_true-valid-memsafety.i_26.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:54:58" (1/1) ... [2019-08-05 10:54:58,767 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "alternating_list_true-unreach-call_true-valid-memsafety.i_26.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:54:58" (1/1) ... [2019-08-05 10:54:58,770 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:54:58,771 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:54:58,771 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:54:58,771 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:54:58,773 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "alternating_list_true-unreach-call_true-valid-memsafety.i_26.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:54:58" (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 10:54:58,832 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-08-05 10:54:58,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 10:54:58,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 10:54:59,194 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 10:54:59,194 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 10:54:59,195 INFO L202 PluginConnector]: Adding new model alternating_list_true-unreach-call_true-valid-memsafety.i_26.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:54:59 BoogieIcfgContainer [2019-08-05 10:54:59,196 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:54:59,197 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:54:59,197 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:54:59,200 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:54:59,200 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "alternating_list_true-unreach-call_true-valid-memsafety.i_26.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:54:58" (1/2) ... [2019-08-05 10:54:59,201 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56899974 and model type alternating_list_true-unreach-call_true-valid-memsafety.i_26.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:54:59, skipping insertion in model container [2019-08-05 10:54:59,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "alternating_list_true-unreach-call_true-valid-memsafety.i_26.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:54:59" (2/2) ... [2019-08-05 10:54:59,203 INFO L109 eAbstractionObserver]: Analyzing ICFG alternating_list_true-unreach-call_true-valid-memsafety.i_26.bpl [2019-08-05 10:54:59,213 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:54:59,220 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:54:59,236 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:54:59,264 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:54:59,264 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:54:59,265 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:54:59,265 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:54:59,265 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:54:59,265 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:54:59,265 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:54:59,266 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:54:59,266 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:54:59,281 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states. [2019-08-05 10:54:59,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:54:59,290 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:54:59,291 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-05 10:54:59,293 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:54:59,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:54:59,299 INFO L82 PathProgramCache]: Analyzing trace with hash 889539531, now seen corresponding path program 1 times [2019-08-05 10:54:59,347 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:54:59,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:54:59,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:54:59,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:54:59,565 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 10:54:59,566 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:54:59,612 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:54:59,613 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 10:54:59,613 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 10:54:59,765 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 10:54:59,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:54:59,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 10:54:59,771 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:54:59,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:54:59,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:54:59,784 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 5 states. [2019-08-05 10:55:00,222 WARN L188 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 24 [2019-08-05 10:55:00,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:55:00,267 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2019-08-05 10:55:00,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:55:00,269 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-08-05 10:55:00,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:55:00,278 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:55:00,278 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:55:00,280 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:55:00,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:55:00,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2019-08-05 10:55:00,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:55:00,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-08-05 10:55:00,310 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2019-08-05 10:55:00,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:55:00,310 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-08-05 10:55:00,311 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:55:00,311 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2019-08-05 10:55:00,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:55:00,311 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:55:00,311 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-08-05 10:55:00,312 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:55:00,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:55:00,312 INFO L82 PathProgramCache]: Analyzing trace with hash 149049733, now seen corresponding path program 1 times [2019-08-05 10:55:00,313 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:55:00,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:55:00,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 10:55:00,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:55:00,468 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 10:55:00,469 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:55:00,500 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:55:00,501 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:55:00,501 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:24, output treesize:17 [2019-08-05 10:55:00,587 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:55:00,588 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:55:00,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:55:00,590 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:55:00,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:55:00,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:55:00,591 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 4 states. [2019-08-05 10:55:00,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:55:00,794 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2019-08-05 10:55:00,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:55:00,794 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-08-05 10:55:00,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:55:00,796 INFO L225 Difference]: With dead ends: 13 [2019-08-05 10:55:00,796 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 10:55:00,798 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:55:00,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 10:55:00,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 10:55:00,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:55:00,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2019-08-05 10:55:00,800 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 8 [2019-08-05 10:55:00,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:55:00,801 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-08-05 10:55:00,801 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:55:00,801 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2019-08-05 10:55:00,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:55:00,802 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:55:00,802 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2019-08-05 10:55:00,802 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:55:00,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:55:00,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1897191999, now seen corresponding path program 1 times [2019-08-05 10:55:00,804 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:55:01,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:55:01,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-05 10:55:01,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:55:01,086 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 10:55:01,086 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:55:01,170 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:55:01,202 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 10:55:01,202 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:55:01,219 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:55:01,225 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 10:55:01,225 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-05 10:55:01,252 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:55:01,254 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:55:01,254 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:33, output treesize:21 [2019-08-05 10:55:01,311 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 17 treesize of output 9 [2019-08-05 10:55:01,313 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:55:01,346 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:55:01,350 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 15 treesize of output 7 [2019-08-05 10:55:01,351 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:55:01,381 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:55:01,382 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 10:55:01,382 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:9 [2019-08-05 10:55:01,485 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:55:01,485 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:55:01,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:55:01,486 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:55:01,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:55:01,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:55:01,487 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 7 states. [2019-08-05 10:55:01,819 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-08-05 10:55:02,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:55:02,080 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2019-08-05 10:55:02,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:55:02,080 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2019-08-05 10:55:02,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:55:02,082 INFO L225 Difference]: With dead ends: 14 [2019-08-05 10:55:02,082 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 10:55:02,083 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:55:02,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 10:55:02,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-08-05 10:55:02,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:55:02,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-08-05 10:55:02,087 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2019-08-05 10:55:02,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:55:02,087 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-08-05 10:55:02,087 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:55:02,087 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-08-05 10:55:02,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:55:02,088 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:55:02,088 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1] [2019-08-05 10:55:02,088 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:55:02,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:55:02,089 INFO L82 PathProgramCache]: Analyzing trace with hash 2135429881, now seen corresponding path program 2 times [2019-08-05 10:55:02,090 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:55:02,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:55:02,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:55:02,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:55:02,165 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:55:02,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:55:02,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:55:02,166 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:55:02,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:55:02,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:55:02,167 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 3 states. [2019-08-05 10:55:02,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:55:02,188 INFO L93 Difference]: Finished difference Result 9 states and 8 transitions. [2019-08-05 10:55:02,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:55:02,189 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-08-05 10:55:02,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:55:02,190 INFO L225 Difference]: With dead ends: 9 [2019-08-05 10:55:02,190 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 10:55:02,191 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 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 10:55:02,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 10:55:02,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 10:55:02,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 10:55:02,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 10:55:02,192 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 12 [2019-08-05 10:55:02,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:55:02,193 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 10:55:02,193 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:55:02,193 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 10:55:02,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 10:55:02,198 INFO L202 PluginConnector]: Adding new model alternating_list_true-unreach-call_true-valid-memsafety.i_26.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:55:02 BoogieIcfgContainer [2019-08-05 10:55:02,199 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:55:02,201 INFO L168 Benchmark]: Toolchain (without parser) took 3517.38 ms. Allocated memory was 133.7 MB in the beginning and 170.4 MB in the end (delta: 36.7 MB). Free memory was 110.7 MB in the beginning and 61.7 MB in the end (delta: 49.0 MB). Peak memory consumption was 85.7 MB. Max. memory is 7.1 GB. [2019-08-05 10:55:02,202 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 133.7 MB. Free memory was 112.5 MB in the beginning and 112.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-08-05 10:55:02,203 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.11 ms. Allocated memory is still 133.7 MB. Free memory was 110.5 MB in the beginning and 108.6 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-08-05 10:55:02,203 INFO L168 Benchmark]: Boogie Preprocessor took 31.69 ms. Allocated memory is still 133.7 MB. Free memory was 108.6 MB in the beginning and 107.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:55:02,204 INFO L168 Benchmark]: RCFGBuilder took 424.97 ms. Allocated memory is still 133.7 MB. Free memory was 107.1 MB in the beginning and 91.4 MB in the end (delta: 15.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 7.1 GB. [2019-08-05 10:55:02,205 INFO L168 Benchmark]: TraceAbstraction took 3002.05 ms. Allocated memory was 133.7 MB in the beginning and 170.4 MB in the end (delta: 36.7 MB). Free memory was 91.2 MB in the beginning and 61.7 MB in the end (delta: 29.5 MB). Peak memory consumption was 66.2 MB. Max. memory is 7.1 GB. [2019-08-05 10:55:02,210 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.20 ms. Allocated memory is still 133.7 MB. Free memory was 112.5 MB in the beginning and 112.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 54.11 ms. Allocated memory is still 133.7 MB. Free memory was 110.5 MB in the beginning and 108.6 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 31.69 ms. Allocated memory is still 133.7 MB. Free memory was 108.6 MB in the beginning and 107.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 424.97 ms. Allocated memory is still 133.7 MB. Free memory was 107.1 MB in the beginning and 91.4 MB in the end (delta: 15.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3002.05 ms. Allocated memory was 133.7 MB in the beginning and 170.4 MB in the end (delta: 36.7 MB). Free memory was 91.2 MB in the beginning and 61.7 MB in the end (delta: 29.5 MB). Peak memory consumption was 66.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 201]: 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, 2.9s OverallTime, 4 OverallIterations, 3 TraceHistogramMax, 1.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 23 SDtfs, 16 SDslu, 22 SDs, 0 SdLazy, 67 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13occurred in iteration=3, 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, 4 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 36 NumberOfCodeBlocks, 36 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 32 ConstructedInterpolants, 2 QuantifiedInterpolants, 1932 SizeOfPredicates, 60 NumberOfNonLiveVariables, 640 ConjunctsInSsa, 107 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 10/14 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...