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/abstractInterpretation/regression/open/comp/recursive-CallABAB_count_incorrect.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:09:26,318 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:09:26,321 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:09:26,335 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:09:26,336 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:09:26,338 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:09:26,340 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:09:26,343 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:09:26,346 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:09:26,347 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:09:26,354 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:09:26,354 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:09:26,355 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:09:26,356 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:09:26,356 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:09:26,358 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:09:26,360 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:09:26,363 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:09:26,367 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:09:26,371 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:09:26,374 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:09:26,375 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:09:26,376 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:09:26,379 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:09:26,381 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:09:26,381 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:09:26,381 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:09:26,383 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:09:26,383 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:09:26,387 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:09:26,387 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:09:26,388 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:09:26,389 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:09:26,391 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:09:26,393 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:09:26,393 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:09:26,394 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:09:26,394 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:09:26,394 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:09:26,395 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:09:26,396 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:09:26,428 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:09:26,441 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:09:26,445 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:09:26,446 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:09:26,446 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:09:26,447 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/abstractInterpretation/regression/open/comp/recursive-CallABAB_count_incorrect.bpl [2019-08-05 11:09:26,447 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/abstractInterpretation/regression/open/comp/recursive-CallABAB_count_incorrect.bpl' [2019-08-05 11:09:26,474 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:09:26,475 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:09:26,476 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:09:26,476 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:09:26,476 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:09:26,492 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "recursive-CallABAB_count_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:09:26" (1/1) ... [2019-08-05 11:09:26,501 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "recursive-CallABAB_count_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:09:26" (1/1) ... [2019-08-05 11:09:26,513 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:09:26,514 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:09:26,514 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:09:26,514 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:09:26,525 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "recursive-CallABAB_count_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:09:26" (1/1) ... [2019-08-05 11:09:26,525 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "recursive-CallABAB_count_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:09:26" (1/1) ... [2019-08-05 11:09:26,526 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "recursive-CallABAB_count_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:09:26" (1/1) ... [2019-08-05 11:09:26,527 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "recursive-CallABAB_count_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:09:26" (1/1) ... [2019-08-05 11:09:26,530 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "recursive-CallABAB_count_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:09:26" (1/1) ... [2019-08-05 11:09:26,534 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "recursive-CallABAB_count_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:09:26" (1/1) ... [2019-08-05 11:09:26,535 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "recursive-CallABAB_count_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:09:26" (1/1) ... [2019-08-05 11:09:26,536 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:09:26,537 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:09:26,537 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:09:26,537 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:09:26,539 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "recursive-CallABAB_count_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:09:26" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 11:09:26,608 INFO L124 BoogieDeclarations]: Specification and implementation of procedure funA given in one single declaration [2019-08-05 11:09:26,609 INFO L130 BoogieDeclarations]: Found specification of procedure funA [2019-08-05 11:09:26,609 INFO L138 BoogieDeclarations]: Found implementation of procedure funA [2019-08-05 11:09:26,610 INFO L124 BoogieDeclarations]: Specification and implementation of procedure funB given in one single declaration [2019-08-05 11:09:26,610 INFO L130 BoogieDeclarations]: Found specification of procedure funB [2019-08-05 11:09:26,610 INFO L138 BoogieDeclarations]: Found implementation of procedure funB [2019-08-05 11:09:26,611 INFO L124 BoogieDeclarations]: Specification and implementation of procedure dispatch given in one single declaration [2019-08-05 11:09:26,611 INFO L130 BoogieDeclarations]: Found specification of procedure dispatch [2019-08-05 11:09:26,611 INFO L138 BoogieDeclarations]: Found implementation of procedure dispatch [2019-08-05 11:09:26,611 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-08-05 11:09:26,612 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 11:09:26,612 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 11:09:26,930 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 11:09:26,930 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 11:09:26,931 INFO L202 PluginConnector]: Adding new model recursive-CallABAB_count_incorrect.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:09:26 BoogieIcfgContainer [2019-08-05 11:09:26,932 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:09:26,933 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:09:26,934 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:09:26,946 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:09:26,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "recursive-CallABAB_count_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:09:26" (1/2) ... [2019-08-05 11:09:26,948 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@593b09 and model type recursive-CallABAB_count_incorrect.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:09:26, skipping insertion in model container [2019-08-05 11:09:26,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "recursive-CallABAB_count_incorrect.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:09:26" (2/2) ... [2019-08-05 11:09:26,956 INFO L109 eAbstractionObserver]: Analyzing ICFG recursive-CallABAB_count_incorrect.bpl [2019-08-05 11:09:26,969 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:09:26,992 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 11:09:27,014 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 11:09:27,045 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:09:27,046 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:09:27,046 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:09:27,047 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:09:27,047 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:09:27,047 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:09:27,047 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:09:27,047 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:09:27,047 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:09:27,073 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2019-08-05 11:09:27,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 11:09:27,086 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:27,087 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-05 11:09:27,091 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:27,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:27,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1402099980, now seen corresponding path program 1 times [2019-08-05 11:09:27,154 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:27,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:27,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:09:27,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:27,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:09:27,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:09:27,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 11:09:27,272 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:09:27,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:09:27,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:09:27,290 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2019-08-05 11:09:27,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:27,376 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2019-08-05 11:09:27,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:09:27,378 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-08-05 11:09:27,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:27,388 INFO L225 Difference]: With dead ends: 19 [2019-08-05 11:09:27,388 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 11:09:27,391 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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:09:27,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 11:09:27,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-05 11:09:27,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 11:09:27,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2019-08-05 11:09:27,439 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 6 [2019-08-05 11:09:27,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:27,441 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2019-08-05 11:09:27,442 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:09:27,442 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2019-08-05 11:09:27,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 11:09:27,447 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:27,447 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:09:27,448 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:27,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:27,449 INFO L82 PathProgramCache]: Analyzing trace with hash -971575734, now seen corresponding path program 1 times [2019-08-05 11:09:27,450 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:27,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:27,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:09:27,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:27,499 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:09:27,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:09:27,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 11:09:27,502 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:09:27,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:09:27,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:09:27,503 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand 3 states. [2019-08-05 11:09:27,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:27,584 INFO L93 Difference]: Finished difference Result 20 states and 25 transitions. [2019-08-05 11:09:27,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:09:27,585 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-08-05 11:09:27,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:27,586 INFO L225 Difference]: With dead ends: 20 [2019-08-05 11:09:27,587 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 11:09:27,588 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 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:09:27,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 11:09:27,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2019-08-05 11:09:27,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 11:09:27,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2019-08-05 11:09:27,595 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 14 [2019-08-05 11:09:27,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:27,595 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2019-08-05 11:09:27,596 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:09:27,596 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2019-08-05 11:09:27,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 11:09:27,597 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:27,597 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:09:27,598 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:27,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:27,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1721266229, now seen corresponding path program 1 times [2019-08-05 11:09:27,599 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:27,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:27,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 11:09:27,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:27,740 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:09:27,741 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:27,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 11:09:27,741 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:09:27,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:09:27,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:09:27,742 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand 6 states. [2019-08-05 11:09:28,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:28,321 INFO L93 Difference]: Finished difference Result 52 states and 72 transitions. [2019-08-05 11:09:28,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 11:09:28,322 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-08-05 11:09:28,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:28,325 INFO L225 Difference]: With dead ends: 52 [2019-08-05 11:09:28,326 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 11:09:28,326 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:09:28,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 11:09:28,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 27. [2019-08-05 11:09:28,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 11:09:28,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2019-08-05 11:09:28,337 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 14 [2019-08-05 11:09:28,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:28,338 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2019-08-05 11:09:28,338 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:09:28,338 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2019-08-05 11:09:28,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 11:09:28,340 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:28,340 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:09:28,340 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:28,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:28,341 INFO L82 PathProgramCache]: Analyzing trace with hash 413422601, now seen corresponding path program 1 times [2019-08-05 11:09:28,342 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:28,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:28,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:09:28,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:28,544 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 11:09:28,544 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:28,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 11:09:28,545 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:09:28,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:09:28,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:09:28,546 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand 7 states. [2019-08-05 11:09:28,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:28,742 INFO L93 Difference]: Finished difference Result 44 states and 60 transitions. [2019-08-05 11:09:28,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 11:09:28,742 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-08-05 11:09:28,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:28,745 INFO L225 Difference]: With dead ends: 44 [2019-08-05 11:09:28,746 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 11:09:28,746 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:09:28,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 11:09:28,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 33. [2019-08-05 11:09:28,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 11:09:28,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2019-08-05 11:09:28,758 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 22 [2019-08-05 11:09:28,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:28,759 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 42 transitions. [2019-08-05 11:09:28,759 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:09:28,759 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2019-08-05 11:09:28,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 11:09:28,760 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:28,761 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:09:28,761 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:28,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:28,762 INFO L82 PathProgramCache]: Analyzing trace with hash 244152903, now seen corresponding path program 2 times [2019-08-05 11:09:28,763 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:28,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:28,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 11:09:28,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:29,041 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-08-05 11:09:29,042 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:29,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 11:09:29,043 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 11:09:29,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 11:09:29,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:09:29,044 INFO L87 Difference]: Start difference. First operand 33 states and 42 transitions. Second operand 8 states. [2019-08-05 11:09:29,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:29,576 INFO L93 Difference]: Finished difference Result 50 states and 67 transitions. [2019-08-05 11:09:29,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 11:09:29,577 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2019-08-05 11:09:29,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:29,581 INFO L225 Difference]: With dead ends: 50 [2019-08-05 11:09:29,581 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 11:09:29,582 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:09:29,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 11:09:29,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 39. [2019-08-05 11:09:29,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 11:09:29,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 49 transitions. [2019-08-05 11:09:29,593 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 49 transitions. Word has length 30 [2019-08-05 11:09:29,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:29,593 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 49 transitions. [2019-08-05 11:09:29,593 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 11:09:29,594 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 49 transitions. [2019-08-05 11:09:29,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 11:09:29,595 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:29,595 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:09:29,596 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:29,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:29,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1386083079, now seen corresponding path program 3 times [2019-08-05 11:09:29,597 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:29,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:29,637 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 11:09:29,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:29,711 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-08-05 11:09:29,711 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:29,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 11:09:29,712 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:09:29,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:09:29,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:09:29,712 INFO L87 Difference]: Start difference. First operand 39 states and 49 transitions. Second operand 5 states. [2019-08-05 11:09:29,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:29,828 INFO L93 Difference]: Finished difference Result 57 states and 77 transitions. [2019-08-05 11:09:29,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:09:29,829 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2019-08-05 11:09:29,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:29,831 INFO L225 Difference]: With dead ends: 57 [2019-08-05 11:09:29,831 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 11:09:29,832 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:09:29,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 11:09:29,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 37. [2019-08-05 11:09:29,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 11:09:29,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 46 transitions. [2019-08-05 11:09:29,843 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 46 transitions. Word has length 38 [2019-08-05 11:09:29,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:29,843 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 46 transitions. [2019-08-05 11:09:29,843 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:09:29,843 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2019-08-05 11:09:29,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 11:09:29,845 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:29,845 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:09:29,845 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:29,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:29,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1994457733, now seen corresponding path program 4 times [2019-08-05 11:09:29,847 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:29,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:29,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 11:09:29,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:30,090 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-08-05 11:09:30,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:30,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:09:30,091 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:09:30,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:09:30,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:09:30,092 INFO L87 Difference]: Start difference. First operand 37 states and 46 transitions. Second operand 9 states. [2019-08-05 11:09:30,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:30,413 INFO L93 Difference]: Finished difference Result 68 states and 87 transitions. [2019-08-05 11:09:30,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 11:09:30,414 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 38 [2019-08-05 11:09:30,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:30,416 INFO L225 Difference]: With dead ends: 68 [2019-08-05 11:09:30,416 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 11:09:30,417 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:09:30,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 11:09:30,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 43. [2019-08-05 11:09:30,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 11:09:30,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 53 transitions. [2019-08-05 11:09:30,427 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 53 transitions. Word has length 38 [2019-08-05 11:09:30,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:30,428 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 53 transitions. [2019-08-05 11:09:30,428 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:09:30,428 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2019-08-05 11:09:30,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 11:09:30,430 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:30,430 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:09:30,430 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:30,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:30,431 INFO L82 PathProgramCache]: Analyzing trace with hash 257748163, now seen corresponding path program 5 times [2019-08-05 11:09:30,432 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:30,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:30,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:09:30,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:30,792 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-08-05 11:09:30,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:30,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 11:09:30,793 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 11:09:30,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 11:09:30,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:09:30,794 INFO L87 Difference]: Start difference. First operand 43 states and 53 transitions. Second operand 10 states. [2019-08-05 11:09:31,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:31,152 INFO L93 Difference]: Finished difference Result 74 states and 94 transitions. [2019-08-05 11:09:31,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 11:09:31,156 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 46 [2019-08-05 11:09:31,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:31,158 INFO L225 Difference]: With dead ends: 74 [2019-08-05 11:09:31,158 INFO L226 Difference]: Without dead ends: 73 [2019-08-05 11:09:31,159 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:09:31,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-05 11:09:31,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 49. [2019-08-05 11:09:31,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 11:09:31,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 60 transitions. [2019-08-05 11:09:31,169 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 60 transitions. Word has length 46 [2019-08-05 11:09:31,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:31,170 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 60 transitions. [2019-08-05 11:09:31,170 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 11:09:31,170 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 60 transitions. [2019-08-05 11:09:31,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:09:31,172 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:31,172 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:09:31,172 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:31,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:31,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1472149761, now seen corresponding path program 6 times [2019-08-05 11:09:31,174 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:31,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:31,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 11:09:31,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:31,389 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-08-05 11:09:31,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:31,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:09:31,390 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 11:09:31,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 11:09:31,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:09:31,391 INFO L87 Difference]: Start difference. First operand 49 states and 60 transitions. Second operand 11 states. [2019-08-05 11:09:31,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:31,777 INFO L93 Difference]: Finished difference Result 80 states and 101 transitions. [2019-08-05 11:09:31,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 11:09:31,778 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 54 [2019-08-05 11:09:31,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:31,779 INFO L225 Difference]: With dead ends: 80 [2019-08-05 11:09:31,780 INFO L226 Difference]: Without dead ends: 79 [2019-08-05 11:09:31,780 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=108, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:09:31,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-05 11:09:31,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 55. [2019-08-05 11:09:31,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 11:09:31,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 67 transitions. [2019-08-05 11:09:31,791 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 67 transitions. Word has length 54 [2019-08-05 11:09:31,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:31,792 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 67 transitions. [2019-08-05 11:09:31,792 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 11:09:31,792 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 67 transitions. [2019-08-05 11:09:31,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-05 11:09:31,795 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:31,795 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-08-05 11:09:31,795 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:31,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:31,796 INFO L82 PathProgramCache]: Analyzing trace with hash -74762173, now seen corresponding path program 7 times [2019-08-05 11:09:31,797 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:31,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:31,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 11:09:31,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:32,037 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 60 proven. 3 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-08-05 11:09:32,038 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:32,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:09:32,038 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:09:32,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:09:32,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:09:32,039 INFO L87 Difference]: Start difference. First operand 55 states and 67 transitions. Second operand 7 states. [2019-08-05 11:09:32,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:32,189 INFO L93 Difference]: Finished difference Result 89 states and 106 transitions. [2019-08-05 11:09:32,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:09:32,190 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 62 [2019-08-05 11:09:32,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:32,192 INFO L225 Difference]: With dead ends: 89 [2019-08-05 11:09:32,192 INFO L226 Difference]: Without dead ends: 65 [2019-08-05 11:09:32,193 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:09:32,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-05 11:09:32,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-08-05 11:09:32,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 11:09:32,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 76 transitions. [2019-08-05 11:09:32,202 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 76 transitions. Word has length 62 [2019-08-05 11:09:32,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:32,202 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 76 transitions. [2019-08-05 11:09:32,202 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:09:32,202 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2019-08-05 11:09:32,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-05 11:09:32,204 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:32,204 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:09:32,205 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:32,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:32,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1849301185, now seen corresponding path program 8 times [2019-08-05 11:09:32,206 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:32,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:32,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-05 11:09:32,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:32,414 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-08-05 11:09:32,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:32,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 11:09:32,415 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 11:09:32,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 11:09:32,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:09:32,416 INFO L87 Difference]: Start difference. First operand 65 states and 76 transitions. Second operand 12 states. [2019-08-05 11:09:32,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:32,698 INFO L93 Difference]: Finished difference Result 86 states and 103 transitions. [2019-08-05 11:09:32,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:09:32,701 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 62 [2019-08-05 11:09:32,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:32,702 INFO L225 Difference]: With dead ends: 86 [2019-08-05 11:09:32,702 INFO L226 Difference]: Without dead ends: 85 [2019-08-05 11:09:32,702 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=124, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:09:32,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-08-05 11:09:32,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 73. [2019-08-05 11:09:32,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 11:09:32,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 85 transitions. [2019-08-05 11:09:32,712 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 85 transitions. Word has length 62 [2019-08-05 11:09:32,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:32,713 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 85 transitions. [2019-08-05 11:09:32,713 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 11:09:32,713 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 85 transitions. [2019-08-05 11:09:32,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 11:09:32,715 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:32,715 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:09:32,715 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:32,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:32,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1053886595, now seen corresponding path program 9 times [2019-08-05 11:09:32,717 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:32,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:32,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 11:09:32,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:33,176 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-08-05 11:09:33,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:33,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 11:09:33,177 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 11:09:33,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 11:09:33,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:09:33,178 INFO L87 Difference]: Start difference. First operand 73 states and 85 transitions. Second operand 13 states. [2019-08-05 11:09:33,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:33,495 INFO L93 Difference]: Finished difference Result 94 states and 112 transitions. [2019-08-05 11:09:33,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 11:09:33,496 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 70 [2019-08-05 11:09:33,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:33,498 INFO L225 Difference]: With dead ends: 94 [2019-08-05 11:09:33,498 INFO L226 Difference]: Without dead ends: 93 [2019-08-05 11:09:33,499 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:09:33,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-08-05 11:09:33,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 81. [2019-08-05 11:09:33,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 11:09:33,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 94 transitions. [2019-08-05 11:09:33,530 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 94 transitions. Word has length 70 [2019-08-05 11:09:33,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:33,534 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 94 transitions. [2019-08-05 11:09:33,534 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 11:09:33,535 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 94 transitions. [2019-08-05 11:09:33,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-05 11:09:33,537 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:33,537 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:09:33,538 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:33,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:33,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1413977669, now seen corresponding path program 10 times [2019-08-05 11:09:33,543 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:33,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:33,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 11:09:33,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:34,093 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 0 proven. 146 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2019-08-05 11:09:34,093 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:34,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 11:09:34,094 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 11:09:34,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 11:09:34,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:09:34,095 INFO L87 Difference]: Start difference. First operand 81 states and 94 transitions. Second operand 14 states. [2019-08-05 11:09:34,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:34,449 INFO L93 Difference]: Finished difference Result 102 states and 121 transitions. [2019-08-05 11:09:34,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:09:34,449 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 78 [2019-08-05 11:09:34,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:34,451 INFO L225 Difference]: With dead ends: 102 [2019-08-05 11:09:34,451 INFO L226 Difference]: Without dead ends: 101 [2019-08-05 11:09:34,452 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=113, Invalid=159, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:09:34,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-08-05 11:09:34,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 89. [2019-08-05 11:09:34,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-08-05 11:09:34,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 103 transitions. [2019-08-05 11:09:34,464 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 103 transitions. Word has length 78 [2019-08-05 11:09:34,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:34,465 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 103 transitions. [2019-08-05 11:09:34,465 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 11:09:34,465 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 103 transitions. [2019-08-05 11:09:34,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-08-05 11:09:34,467 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:34,467 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1] [2019-08-05 11:09:34,467 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:34,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:34,468 INFO L82 PathProgramCache]: Analyzing trace with hash 740747773, now seen corresponding path program 11 times [2019-08-05 11:09:34,468 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:34,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:34,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 11:09:34,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:34,795 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 0 proven. 150 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2019-08-05 11:09:34,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:34,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 11:09:34,796 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:09:34,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:09:34,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:09:34,797 INFO L87 Difference]: Start difference. First operand 89 states and 103 transitions. Second operand 15 states. [2019-08-05 11:09:35,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:35,197 INFO L93 Difference]: Finished difference Result 110 states and 130 transitions. [2019-08-05 11:09:35,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 11:09:35,198 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 86 [2019-08-05 11:09:35,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:35,200 INFO L225 Difference]: With dead ends: 110 [2019-08-05 11:09:35,200 INFO L226 Difference]: Without dead ends: 109 [2019-08-05 11:09:35,201 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=178, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:09:35,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-08-05 11:09:35,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 97. [2019-08-05 11:09:35,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-08-05 11:09:35,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 112 transitions. [2019-08-05 11:09:35,210 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 112 transitions. Word has length 86 [2019-08-05 11:09:35,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:35,210 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 112 transitions. [2019-08-05 11:09:35,211 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:09:35,211 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 112 transitions. [2019-08-05 11:09:35,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-08-05 11:09:35,212 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:35,212 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:09:35,213 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:35,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:35,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1826327497, now seen corresponding path program 12 times [2019-08-05 11:09:35,214 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:35,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:35,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 11:09:35,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:35,398 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 75 proven. 10 refuted. 0 times theorem prover too weak. 348 trivial. 0 not checked. [2019-08-05 11:09:35,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:35,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 11:09:35,399 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:09:35,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:09:35,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:09:35,399 INFO L87 Difference]: Start difference. First operand 97 states and 112 transitions. Second operand 6 states. [2019-08-05 11:09:35,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:35,438 INFO L93 Difference]: Finished difference Result 165 states and 191 transitions. [2019-08-05 11:09:35,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 11:09:35,441 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-08-05 11:09:35,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:35,442 INFO L225 Difference]: With dead ends: 165 [2019-08-05 11:09:35,442 INFO L226 Difference]: Without dead ends: 97 [2019-08-05 11:09:35,443 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:09:35,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-08-05 11:09:35,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 65. [2019-08-05 11:09:35,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 11:09:35,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2019-08-05 11:09:35,451 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 94 [2019-08-05 11:09:35,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:35,452 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2019-08-05 11:09:35,452 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:09:35,452 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2019-08-05 11:09:35,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-08-05 11:09:35,454 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:35,454 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1] [2019-08-05 11:09:35,454 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:35,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:35,454 INFO L82 PathProgramCache]: Analyzing trace with hash 687710396, now seen corresponding path program 13 times [2019-08-05 11:09:35,455 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:35,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:35,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 11:09:35,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:36,181 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-08-05 11:09:36,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:36,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 11:09:36,182 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 11:09:36,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 11:09:36,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:09:36,182 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand 16 states. [2019-08-05 11:09:36,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:36,485 INFO L93 Difference]: Finished difference Result 118 states and 127 transitions. [2019-08-05 11:09:36,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:09:36,485 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 94 [2019-08-05 11:09:36,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:36,488 INFO L225 Difference]: With dead ends: 118 [2019-08-05 11:09:36,488 INFO L226 Difference]: Without dead ends: 117 [2019-08-05 11:09:36,489 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=144, Invalid=198, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:09:36,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-08-05 11:09:36,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 69. [2019-08-05 11:09:36,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 11:09:36,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2019-08-05 11:09:36,495 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 94 [2019-08-05 11:09:36,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:36,495 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2019-08-05 11:09:36,495 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 11:09:36,495 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2019-08-05 11:09:36,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-08-05 11:09:36,497 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:36,497 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1] [2019-08-05 11:09:36,497 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:36,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:36,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1657092602, now seen corresponding path program 14 times [2019-08-05 11:09:36,498 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:36,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:36,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-05 11:09:36,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:36,972 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2019-08-05 11:09:36,973 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:36,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:09:36,974 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:09:36,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:09:36,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=162, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:09:36,974 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand 17 states. [2019-08-05 11:09:37,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:37,293 INFO L93 Difference]: Finished difference Result 126 states and 135 transitions. [2019-08-05 11:09:37,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 11:09:37,293 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 102 [2019-08-05 11:09:37,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:37,295 INFO L225 Difference]: With dead ends: 126 [2019-08-05 11:09:37,296 INFO L226 Difference]: Without dead ends: 125 [2019-08-05 11:09:37,296 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=161, Invalid=219, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:09:37,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-08-05 11:09:37,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 73. [2019-08-05 11:09:37,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 11:09:37,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2019-08-05 11:09:37,303 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 102 [2019-08-05 11:09:37,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:37,303 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2019-08-05 11:09:37,303 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:09:37,303 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2019-08-05 11:09:37,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-08-05 11:09:37,305 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:37,305 INFO L399 BasicCegarLoop]: trace histogram [14, 13, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1] [2019-08-05 11:09:37,305 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:37,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:37,306 INFO L82 PathProgramCache]: Analyzing trace with hash 261451961, now seen corresponding path program 15 times [2019-08-05 11:09:37,307 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:37,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:37,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-05 11:09:37,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:37,742 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 254 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2019-08-05 11:09:37,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:37,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 11:09:37,743 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 11:09:37,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 11:09:37,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:09:37,744 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand 18 states. [2019-08-05 11:09:38,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:38,149 INFO L93 Difference]: Finished difference Result 134 states and 143 transitions. [2019-08-05 11:09:38,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:09:38,150 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 110 [2019-08-05 11:09:38,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:38,151 INFO L225 Difference]: With dead ends: 134 [2019-08-05 11:09:38,152 INFO L226 Difference]: Without dead ends: 133 [2019-08-05 11:09:38,152 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=179, Invalid=241, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:09:38,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-08-05 11:09:38,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 77. [2019-08-05 11:09:38,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 11:09:38,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2019-08-05 11:09:38,158 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 110 [2019-08-05 11:09:38,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:38,159 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2019-08-05 11:09:38,159 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 11:09:38,159 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2019-08-05 11:09:38,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-08-05 11:09:38,160 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:38,160 INFO L399 BasicCegarLoop]: trace histogram [15, 14, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1] [2019-08-05 11:09:38,161 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:38,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:38,161 INFO L82 PathProgramCache]: Analyzing trace with hash -920085769, now seen corresponding path program 16 times [2019-08-05 11:09:38,162 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:38,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-05 11:09:38,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-05 11:09:38,303 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-08-05 11:09:38,377 INFO L202 PluginConnector]: Adding new model recursive-CallABAB_count_incorrect.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:09:38 BoogieIcfgContainer [2019-08-05 11:09:38,378 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:09:38,380 INFO L168 Benchmark]: Toolchain (without parser) took 11904.28 ms. Allocated memory was 133.7 MB in the beginning and 290.5 MB in the end (delta: 156.8 MB). Free memory was 110.1 MB in the beginning and 101.6 MB in the end (delta: 8.5 MB). Peak memory consumption was 165.3 MB. Max. memory is 7.1 GB. [2019-08-05 11:09:38,383 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.17 ms. Allocated memory is still 133.7 MB. Free memory was 111.3 MB in the beginning and 111.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-08-05 11:09:38,383 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.57 ms. Allocated memory is still 133.7 MB. Free memory was 109.9 MB in the beginning and 108.3 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. [2019-08-05 11:09:38,385 INFO L168 Benchmark]: Boogie Preprocessor took 22.61 ms. Allocated memory is still 133.7 MB. Free memory was 108.3 MB in the beginning and 107.2 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-08-05 11:09:38,385 INFO L168 Benchmark]: RCFGBuilder took 394.95 ms. Allocated memory is still 133.7 MB. Free memory was 107.2 MB in the beginning and 96.1 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB. [2019-08-05 11:09:38,386 INFO L168 Benchmark]: TraceAbstraction took 11444.31 ms. Allocated memory was 133.7 MB in the beginning and 290.5 MB in the end (delta: 156.8 MB). Free memory was 95.9 MB in the beginning and 101.6 MB in the end (delta: -5.7 MB). Peak memory consumption was 151.1 MB. Max. memory is 7.1 GB. [2019-08-05 11:09:38,393 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.17 ms. Allocated memory is still 133.7 MB. Free memory was 111.3 MB in the beginning and 111.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 37.57 ms. Allocated memory is still 133.7 MB. Free memory was 109.9 MB in the beginning and 108.3 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 22.61 ms. Allocated memory is still 133.7 MB. Free memory was 108.3 MB in the beginning and 107.2 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 394.95 ms. Allocated memory is still 133.7 MB. Free memory was 107.2 MB in the beginning and 96.1 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11444.31 ms. Allocated memory was 133.7 MB in the beginning and 290.5 MB in the end (delta: 156.8 MB). Free memory was 95.9 MB in the beginning and 101.6 MB in the end (delta: -5.7 MB). Peak memory consumption was 151.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 16]: assertion can be violated assertion can be violated We found a FailurePath: [L13] g := 0; VAL [g=0] [L14] CALL call x := dispatch(20, 20); VAL [a=20, b=20, g=0, old(g)=0] [L23] COND FALSE !(a + b <= 0) [L29] g := g + 1; VAL [a=20, b=20, g=1, old(g)=0] [L30] COND FALSE !(a > b) VAL [a=20, b=20, g=1, old(g)=0] [L36] CALL call res := funB(a, b); VAL [a=20, b=20, g=1, old(g)=1] [L50] CALL call res := dispatch(a - 1, b - 2); VAL [a=19, b=18, g=1, old(g)=1] [L23] COND FALSE !(a + b <= 0) [L29] g := g + 1; VAL [a=19, b=18, g=2, old(g)=1] [L30] COND TRUE a > b VAL [a=19, b=18, g=2, old(g)=1] [L32] CALL call res := funA(a, b); VAL [a=19, b=18, g=2, old(g)=2] [L43] CALL call res := dispatch(a - 2, b - 1); VAL [a=17, b=17, g=2, old(g)=2] [L23] COND FALSE !(a + b <= 0) [L29] g := g + 1; VAL [a=17, b=17, g=3, old(g)=2] [L30] COND FALSE !(a > b) VAL [a=17, b=17, g=3, old(g)=2] [L36] CALL call res := funB(a, b); VAL [a=17, b=17, g=3, old(g)=3] [L50] CALL call res := dispatch(a - 1, b - 2); VAL [a=16, b=15, g=3, old(g)=3] [L23] COND FALSE !(a + b <= 0) [L29] g := g + 1; VAL [a=16, b=15, g=4, old(g)=3] [L30] COND TRUE a > b VAL [a=16, b=15, g=4, old(g)=3] [L32] CALL call res := funA(a, b); VAL [a=16, b=15, g=4, old(g)=4] [L43] CALL call res := dispatch(a - 2, b - 1); VAL [a=14, b=14, g=4, old(g)=4] [L23] COND FALSE !(a + b <= 0) [L29] g := g + 1; VAL [a=14, b=14, g=5, old(g)=4] [L30] COND FALSE !(a > b) VAL [a=14, b=14, g=5, old(g)=4] [L36] CALL call res := funB(a, b); VAL [a=14, b=14, g=5, old(g)=5] [L50] CALL call res := dispatch(a - 1, b - 2); VAL [a=13, b=12, g=5, old(g)=5] [L23] COND FALSE !(a + b <= 0) [L29] g := g + 1; VAL [a=13, b=12, g=6, old(g)=5] [L30] COND TRUE a > b VAL [a=13, b=12, g=6, old(g)=5] [L32] CALL call res := funA(a, b); VAL [a=13, b=12, g=6, old(g)=6] [L43] CALL call res := dispatch(a - 2, b - 1); VAL [a=11, b=11, g=6, old(g)=6] [L23] COND FALSE !(a + b <= 0) [L29] g := g + 1; VAL [a=11, b=11, g=7, old(g)=6] [L30] COND FALSE !(a > b) VAL [a=11, b=11, g=7, old(g)=6] [L36] CALL call res := funB(a, b); VAL [a=11, b=11, g=7, old(g)=7] [L50] CALL call res := dispatch(a - 1, b - 2); VAL [a=10, b=9, g=7, old(g)=7] [L23] COND FALSE !(a + b <= 0) [L29] g := g + 1; VAL [a=10, b=9, g=8, old(g)=7] [L30] COND TRUE a > b VAL [a=10, b=9, g=8, old(g)=7] [L32] CALL call res := funA(a, b); VAL [a=10, b=9, g=8, old(g)=8] [L43] CALL call res := dispatch(a - 2, b - 1); VAL [a=8, b=8, g=8, old(g)=8] [L23] COND FALSE !(a + b <= 0) [L29] g := g + 1; VAL [a=8, b=8, g=9, old(g)=8] [L30] COND FALSE !(a > b) VAL [a=8, b=8, g=9, old(g)=8] [L36] CALL call res := funB(a, b); VAL [a=8, b=8, g=9, old(g)=9] [L50] CALL call res := dispatch(a - 1, b - 2); VAL [a=7, b=6, g=9, old(g)=9] [L23] COND FALSE !(a + b <= 0) [L29] g := g + 1; VAL [a=7, b=6, g=10, old(g)=9] [L30] COND TRUE a > b VAL [a=7, b=6, g=10, old(g)=9] [L32] CALL call res := funA(a, b); VAL [a=7, b=6, g=10, old(g)=10] [L43] CALL call res := dispatch(a - 2, b - 1); VAL [a=5, b=5, g=10, old(g)=10] [L23] COND FALSE !(a + b <= 0) [L29] g := g + 1; VAL [a=5, b=5, g=11, old(g)=10] [L30] COND FALSE !(a > b) VAL [a=5, b=5, g=11, old(g)=10] [L36] CALL call res := funB(a, b); VAL [a=5, b=5, g=11, old(g)=11] [L50] CALL call res := dispatch(a - 1, b - 2); VAL [a=4, b=3, g=11, old(g)=11] [L23] COND FALSE !(a + b <= 0) [L29] g := g + 1; VAL [a=4, b=3, g=12, old(g)=11] [L30] COND TRUE a > b VAL [a=4, b=3, g=12, old(g)=11] [L32] CALL call res := funA(a, b); VAL [a=4, b=3, g=12, old(g)=12] [L43] CALL call res := dispatch(a - 2, b - 1); VAL [a=2, b=2, g=12, old(g)=12] [L23] COND FALSE !(a + b <= 0) [L29] g := g + 1; VAL [a=2, b=2, g=13, old(g)=12] [L30] COND FALSE !(a > b) VAL [a=2, b=2, g=13, old(g)=12] [L36] CALL call res := funB(a, b); VAL [a=2, b=2, g=13, old(g)=13] [L50] CALL call res := dispatch(a - 1, b - 2); VAL [a=1, b=0, g=13, old(g)=13] [L23] COND FALSE !(a + b <= 0) [L29] g := g + 1; VAL [a=1, b=0, g=14, old(g)=13] [L30] COND TRUE a > b VAL [a=1, b=0, g=14, old(g)=13] [L32] CALL call res := funA(a, b); VAL [a=1, b=0, g=14, old(g)=14] [L43] CALL call res := dispatch(a - 2, b - 1); VAL [a=-1, b=-1, g=14, old(g)=14] [L23] COND TRUE a + b <= 0 [L25] res := a + b; VAL [a=-1, b=-1, g=14, old(g)=14, res=-2] [L43] RET call res := dispatch(a - 2, b - 1); VAL [a=1, b=0, g=14, old(g)=14, res=-2] [L32] RET call res := funA(a, b); VAL [a=1, b=0, g=14, old(g)=13, res=-2] [L50] RET call res := dispatch(a - 1, b - 2); VAL [a=2, b=2, g=14, old(g)=13, res=-2] [L36] RET call res := funB(a, b); VAL [a=2, b=2, g=14, old(g)=12, res=-2] [L43] RET call res := dispatch(a - 2, b - 1); VAL [a=4, b=3, g=14, old(g)=12, res=-2] [L32] RET call res := funA(a, b); VAL [a=4, b=3, g=14, old(g)=11, res=-2] [L50] RET call res := dispatch(a - 1, b - 2); VAL [a=5, b=5, g=14, old(g)=11, res=-2] [L36] RET call res := funB(a, b); VAL [a=5, b=5, g=14, old(g)=10, res=-2] [L43] RET call res := dispatch(a - 2, b - 1); VAL [a=7, b=6, g=14, old(g)=10, res=-2] [L32] RET call res := funA(a, b); VAL [a=7, b=6, g=14, old(g)=9, res=-2] [L50] RET call res := dispatch(a - 1, b - 2); VAL [a=8, b=8, g=14, old(g)=9, res=-2] [L36] RET call res := funB(a, b); VAL [a=8, b=8, g=14, old(g)=8, res=-2] [L43] RET call res := dispatch(a - 2, b - 1); VAL [a=10, b=9, g=14, old(g)=8, res=-2] [L32] RET call res := funA(a, b); VAL [a=10, b=9, g=14, old(g)=7, res=-2] [L50] RET call res := dispatch(a - 1, b - 2); VAL [a=11, b=11, g=14, old(g)=7, res=-2] [L36] RET call res := funB(a, b); VAL [a=11, b=11, g=14, old(g)=6, res=-2] [L43] RET call res := dispatch(a - 2, b - 1); VAL [a=13, b=12, g=14, old(g)=6, res=-2] [L32] RET call res := funA(a, b); VAL [a=13, b=12, g=14, old(g)=5, res=-2] [L50] RET call res := dispatch(a - 1, b - 2); VAL [a=14, b=14, g=14, old(g)=5, res=-2] [L36] RET call res := funB(a, b); VAL [a=14, b=14, g=14, old(g)=4, res=-2] [L43] RET call res := dispatch(a - 2, b - 1); VAL [a=16, b=15, g=14, old(g)=4, res=-2] [L32] RET call res := funA(a, b); VAL [a=16, b=15, g=14, old(g)=3, res=-2] [L50] RET call res := dispatch(a - 1, b - 2); VAL [a=17, b=17, g=14, old(g)=3, res=-2] [L36] RET call res := funB(a, b); VAL [a=17, b=17, g=14, old(g)=2, res=-2] [L43] RET call res := dispatch(a - 2, b - 1); VAL [a=19, b=18, g=14, old(g)=2, res=-2] [L32] RET call res := funA(a, b); VAL [a=19, b=18, g=14, old(g)=1, res=-2] [L50] RET call res := dispatch(a - 1, b - 2); VAL [a=20, b=20, g=14, old(g)=1, res=-2] [L36] RET call res := funB(a, b); VAL [a=20, b=20, g=14, old(g)=0, res=-2] [L14] RET call x := dispatch(20, 20); VAL [g=14, x=-2] [L16] assert g <= 13; VAL [g=14, x=-2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 17 locations, 1 error locations. UNSAFE Result, 11.3s OverallTime, 19 OverallIterations, 15 TraceHistogramMax, 5.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 272 SDtfs, 524 SDslu, 706 SDs, 0 SdLazy, 1237 SolverSat, 1012 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1041 GetRequests, 857 SyntacticMatches, 1 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 4.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=97occurred in iteration=14, 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.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 360 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 1138 NumberOfCodeBlocks, 1138 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1002 ConstructedInterpolants, 0 QuantifiedInterpolants, 280710 SizeOfPredicates, 2 NumberOfNonLiveVariables, 3306 ConjunctsInSsa, 541 ConjunctsInUnsatCore, 18 InterpolantComputations, 2 PerfectInterpolantSequences, 1828/3142 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...