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_36.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:59:57,362 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:59:57,365 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:59:57,382 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:59:57,382 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:59:57,384 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:59:57,386 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:59:57,389 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:59:57,392 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:59:57,394 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:59:57,396 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:59:57,396 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:59:57,397 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:59:57,398 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:59:57,400 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:59:57,408 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:59:57,409 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:59:57,409 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:59:57,411 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:59:57,413 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:59:57,414 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:59:57,415 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:59:57,416 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:59:57,417 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:59:57,419 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:59:57,419 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:59:57,419 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:59:57,420 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:59:57,420 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:59:57,421 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:59:57,421 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:59:57,422 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:59:57,423 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:59:57,424 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:59:57,424 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:59:57,425 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:59:57,425 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:59:57,426 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:59:57,426 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:59:57,427 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:59:57,428 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:59:57,456 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:59:57,471 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:59:57,474 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:59:57,476 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:59:57,476 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:59:57,477 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_36.bpl [2019-08-05 10:59:57,478 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_36.bpl' [2019-08-05 10:59:57,534 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:59:57,536 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:59:57,537 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:59:57,537 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:59:57,537 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:59:57,555 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "alternating_list_true-unreach-call_true-valid-memsafety.i_36.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:59:57" (1/1) ... [2019-08-05 10:59:57,582 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "alternating_list_true-unreach-call_true-valid-memsafety.i_36.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:59:57" (1/1) ... [2019-08-05 10:59:57,597 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:59:57,598 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:59:57,598 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:59:57,598 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:59:57,609 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "alternating_list_true-unreach-call_true-valid-memsafety.i_36.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:59:57" (1/1) ... [2019-08-05 10:59:57,609 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "alternating_list_true-unreach-call_true-valid-memsafety.i_36.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:59:57" (1/1) ... [2019-08-05 10:59:57,614 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "alternating_list_true-unreach-call_true-valid-memsafety.i_36.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:59:57" (1/1) ... [2019-08-05 10:59:57,614 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "alternating_list_true-unreach-call_true-valid-memsafety.i_36.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:59:57" (1/1) ... [2019-08-05 10:59:57,625 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "alternating_list_true-unreach-call_true-valid-memsafety.i_36.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:59:57" (1/1) ... [2019-08-05 10:59:57,629 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "alternating_list_true-unreach-call_true-valid-memsafety.i_36.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:59:57" (1/1) ... [2019-08-05 10:59:57,633 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "alternating_list_true-unreach-call_true-valid-memsafety.i_36.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:59:57" (1/1) ... [2019-08-05 10:59:57,641 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:59:57,641 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:59:57,642 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:59:57,642 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:59:57,643 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "alternating_list_true-unreach-call_true-valid-memsafety.i_36.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:59:57" (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:59:57,713 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-08-05 10:59:57,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 10:59:57,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 10:59:58,191 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 10:59:58,192 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 10:59:58,193 INFO L202 PluginConnector]: Adding new model alternating_list_true-unreach-call_true-valid-memsafety.i_36.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:59:58 BoogieIcfgContainer [2019-08-05 10:59:58,193 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:59:58,194 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:59:58,194 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:59:58,197 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:59:58,198 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "alternating_list_true-unreach-call_true-valid-memsafety.i_36.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:59:57" (1/2) ... [2019-08-05 10:59:58,199 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@315b8308 and model type alternating_list_true-unreach-call_true-valid-memsafety.i_36.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:59:58, skipping insertion in model container [2019-08-05 10:59:58,199 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "alternating_list_true-unreach-call_true-valid-memsafety.i_36.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:59:58" (2/2) ... [2019-08-05 10:59:58,201 INFO L109 eAbstractionObserver]: Analyzing ICFG alternating_list_true-unreach-call_true-valid-memsafety.i_36.bpl [2019-08-05 10:59:58,211 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:59:58,219 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:59:58,236 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:59:58,264 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:59:58,265 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:59:58,265 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:59:58,266 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:59:58,266 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:59:58,266 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:59:58,266 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:59:58,267 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:59:58,267 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:59:58,284 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states. [2019-08-05 10:59:58,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:59:58,297 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:58,298 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:59:58,301 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:58,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:58,308 INFO L82 PathProgramCache]: Analyzing trace with hash 148998095, now seen corresponding path program 1 times [2019-08-05 10:59:58,355 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:58,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:58,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:59:58,461 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:58,559 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:59:58,560 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:59:58,579 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:59:58,579 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:59:58,580 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-08-05 10:59:58,639 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:59:58,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:59:58,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 10:59:58,645 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:59:58,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:59:58,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:59:58,658 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 5 states. [2019-08-05 10:59:59,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:59,104 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2019-08-05 10:59:59,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:59:59,106 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-08-05 10:59:59,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:59,130 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:59:59,130 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:59:59,132 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 10:59:59,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:59:59,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2019-08-05 10:59:59,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:59:59,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2019-08-05 10:59:59,165 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 8 [2019-08-05 10:59:59,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:59,166 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2019-08-05 10:59:59,166 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:59:59,166 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2019-08-05 10:59:59,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:59:59,167 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:59,167 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:59:59,168 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:59,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:59,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1453301129, now seen corresponding path program 1 times [2019-08-05 10:59:59,169 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:59,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:59,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 10:59:59,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:59,355 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:59:59,356 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:59:59,410 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:59:59,411 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 10:59:59,412 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2019-08-05 10:59:59,769 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:59:59,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:59:59,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-08-05 10:59:59,771 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:59:59,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:59:59,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:59:59,772 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand 6 states. [2019-08-05 10:59:59,977 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 19 [2019-08-05 11:00:00,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:00,294 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2019-08-05 11:00:00,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:00:00,299 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-08-05 11:00:00,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:00,300 INFO L225 Difference]: With dead ends: 17 [2019-08-05 11:00:00,300 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 11:00:00,301 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:00:00,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 11:00:00,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 11:00:00,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 11:00:00,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2019-08-05 11:00:00,304 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 10 [2019-08-05 11:00:00,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:00,305 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2019-08-05 11:00:00,305 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:00:00,305 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2019-08-05 11:00:00,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 11:00:00,306 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:00,306 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:00:00,307 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:00,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:00,307 INFO L82 PathProgramCache]: Analyzing trace with hash 2085806019, now seen corresponding path program 1 times [2019-08-05 11:00:00,308 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:00,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:00,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-05 11:00:00,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:00,502 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:00:00,503 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:00,531 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:00:00,531 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:00:00,532 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-08-05 11:00:00,643 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:00:00,644 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-08-05 11:00:00,645 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:00,654 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:00:00,662 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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:00:00,663 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:00,680 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:00:00,682 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:00:00,682 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:21 [2019-08-05 11:00:00,783 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-08-05 11:00:00,784 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:00,845 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:00:00,847 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-08-05 11:00:00,847 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:31 [2019-08-05 11:00:00,895 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:00:00,898 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-08-05 11:00:00,898 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:00,924 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:00:00,926 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:00:00,927 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:38, output treesize:3 [2019-08-05 11:00:00,951 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 11:00:00,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:00,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 11:00:00,953 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:00:00,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:00:00,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:00:00,954 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand 6 states. [2019-08-05 11:00:01,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:01,085 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2019-08-05 11:00:01,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 11:00:01,086 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2019-08-05 11:00:01,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:01,087 INFO L225 Difference]: With dead ends: 17 [2019-08-05 11:00:01,087 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 11:00:01,088 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:00:01,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 11:00:01,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 11:00:01,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 11:00:01,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2019-08-05 11:00:01,091 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 12 [2019-08-05 11:00:01,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:01,092 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-08-05 11:00:01,092 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:00:01,092 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2019-08-05 11:00:01,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 11:00:01,093 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:01,093 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:00:01,093 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:01,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:01,094 INFO L82 PathProgramCache]: Analyzing trace with hash -895823363, now seen corresponding path program 1 times [2019-08-05 11:00:01,095 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:01,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:01,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 11:00:01,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:01,366 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:00:01,367 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:01,420 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:00:01,420 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:00:01,421 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 11:00:01,546 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:00:01,578 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:00:01,579 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 29 [2019-08-05 11:00:01,580 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:01,861 WARN L188 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 24 [2019-08-05 11:00:01,862 INFO L567 ElimStorePlain]: treesize reduction 9, result has 80.4 percent of original size [2019-08-05 11:00:01,873 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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:00:01,874 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:01,922 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:00:01,923 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:00:01,924 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:36 [2019-08-05 11:00:02,036 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-08-05 11:00:02,037 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:02,062 INFO L567 ElimStorePlain]: treesize reduction 8, result has 73.3 percent of original size [2019-08-05 11:00:02,074 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 11:00:02,075 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:02,111 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:00:02,112 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:00:02,113 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:36, output treesize:11 [2019-08-05 11:00:02,186 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 11:00:02,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:02,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:00:02,187 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 11:00:02,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 11:00:02,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:00:02,188 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand 8 states. [2019-08-05 11:00:02,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:02,583 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2019-08-05 11:00:02,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 11:00:02,583 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-08-05 11:00:02,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:02,585 INFO L225 Difference]: With dead ends: 23 [2019-08-05 11:00:02,585 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 11:00:02,586 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:00:02,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 11:00:02,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 19. [2019-08-05 11:00:02,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 11:00:02,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2019-08-05 11:00:02,590 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 14 [2019-08-05 11:00:02,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:02,590 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2019-08-05 11:00:02,590 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 11:00:02,590 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2019-08-05 11:00:02,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 11:00:02,591 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:02,591 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:00:02,591 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:02,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:02,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1892740041, now seen corresponding path program 2 times [2019-08-05 11:00:02,593 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:02,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:02,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 11:00:02,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:02,908 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:00:02,909 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:02,936 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:00:02,946 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 11:00:02,947 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:02,981 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:00:02,982 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:00:02,982 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:36, output treesize:14 [2019-08-05 11:00:03,061 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:00:03,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:03,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:00:03,062 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:00:03,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:00:03,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:00:03,063 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand 9 states. [2019-08-05 11:00:03,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:03,432 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2019-08-05 11:00:03,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 11:00:03,435 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2019-08-05 11:00:03,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:03,436 INFO L225 Difference]: With dead ends: 29 [2019-08-05 11:00:03,436 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 11:00:03,436 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:00:03,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 11:00:03,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2019-08-05 11:00:03,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 11:00:03,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2019-08-05 11:00:03,440 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 16 [2019-08-05 11:00:03,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:03,440 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2019-08-05 11:00:03,440 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:00:03,440 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2019-08-05 11:00:03,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 11:00:03,441 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:03,441 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2019-08-05 11:00:03,441 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:03,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:03,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1821269431, now seen corresponding path program 2 times [2019-08-05 11:00:03,442 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:03,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:03,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:00:03,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:03,531 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 11:00:03,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:00:03,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 11:00:03,532 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:00:03,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:00:03,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:00:03,533 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 3 states. [2019-08-05 11:00:03,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:03,553 INFO L93 Difference]: Finished difference Result 9 states and 8 transitions. [2019-08-05 11:00:03,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:00:03,553 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-08-05 11:00:03,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:03,554 INFO L225 Difference]: With dead ends: 9 [2019-08-05 11:00:03,554 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 11:00:03,554 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 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:00:03,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 11:00:03,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 11:00:03,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 11:00:03,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 11:00:03,555 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 16 [2019-08-05 11:00:03,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:03,555 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 11:00:03,555 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:00:03,555 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 11:00:03,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 11:00:03,560 INFO L202 PluginConnector]: Adding new model alternating_list_true-unreach-call_true-valid-memsafety.i_36.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:00:03 BoogieIcfgContainer [2019-08-05 11:00:03,560 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:00:03,562 INFO L168 Benchmark]: Toolchain (without parser) took 6025.67 ms. Allocated memory was 134.7 MB in the beginning and 197.7 MB in the end (delta: 62.9 MB). Free memory was 111.4 MB in the beginning and 52.8 MB in the end (delta: 58.6 MB). Peak memory consumption was 121.5 MB. Max. memory is 7.1 GB. [2019-08-05 11:00:03,563 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 134.7 MB. Free memory is still 113.1 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 11:00:03,564 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.41 ms. Allocated memory is still 134.7 MB. Free memory was 111.4 MB in the beginning and 109.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-08-05 11:00:03,565 INFO L168 Benchmark]: Boogie Preprocessor took 43.40 ms. Allocated memory is still 134.7 MB. Free memory was 109.3 MB in the beginning and 108.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-05 11:00:03,565 INFO L168 Benchmark]: RCFGBuilder took 551.80 ms. Allocated memory is still 134.7 MB. Free memory was 108.0 MB in the beginning and 90.5 MB in the end (delta: 17.5 MB). Peak memory consumption was 17.5 MB. Max. memory is 7.1 GB. [2019-08-05 11:00:03,566 INFO L168 Benchmark]: TraceAbstraction took 5365.69 ms. Allocated memory was 134.7 MB in the beginning and 197.7 MB in the end (delta: 62.9 MB). Free memory was 90.5 MB in the beginning and 52.8 MB in the end (delta: 37.7 MB). Peak memory consumption was 100.6 MB. Max. memory is 7.1 GB. [2019-08-05 11:00:03,570 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 134.7 MB. Free memory is still 113.1 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 60.41 ms. Allocated memory is still 134.7 MB. Free memory was 111.4 MB in the beginning and 109.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.40 ms. Allocated memory is still 134.7 MB. Free memory was 109.3 MB in the beginning and 108.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 551.80 ms. Allocated memory is still 134.7 MB. Free memory was 108.0 MB in the beginning and 90.5 MB in the end (delta: 17.5 MB). Peak memory consumption was 17.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5365.69 ms. Allocated memory was 134.7 MB in the beginning and 197.7 MB in the end (delta: 62.9 MB). Free memory was 90.5 MB in the beginning and 52.8 MB in the end (delta: 37.7 MB). Peak memory consumption was 100.6 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, 5.3s OverallTime, 6 OverallIterations, 3 TraceHistogramMax, 1.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 36 SDtfs, 30 SDslu, 73 SDs, 0 SdLazy, 256 SolverSat, 51 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23occurred in iteration=5, 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, 6 MinimizatonAttempts, 7 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 76 NumberOfCodeBlocks, 76 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 70 ConstructedInterpolants, 14 QuantifiedInterpolants, 8766 SizeOfPredicates, 107 NumberOfNonLiveVariables, 1352 ConjunctsInSsa, 226 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 22/34 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...