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/real-life/threadpooling_product.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-04 21:21:39,505 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-04 21:21:39,507 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-04 21:21:39,519 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-04 21:21:39,519 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-04 21:21:39,520 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-04 21:21:39,522 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-04 21:21:39,524 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-04 21:21:39,525 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-04 21:21:39,526 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-04 21:21:39,527 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-04 21:21:39,528 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-04 21:21:39,528 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-04 21:21:39,529 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-04 21:21:39,530 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-04 21:21:39,531 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-04 21:21:39,532 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-04 21:21:39,533 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-04 21:21:39,535 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-04 21:21:39,537 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-04 21:21:39,539 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-04 21:21:39,540 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-04 21:21:39,542 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-04 21:21:39,543 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-04 21:21:39,545 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-04 21:21:39,545 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-04 21:21:39,546 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-04 21:21:39,547 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-04 21:21:39,547 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-04 21:21:39,548 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-04 21:21:39,549 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-04 21:21:39,550 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-04 21:21:39,550 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-04 21:21:39,551 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-04 21:21:39,552 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-04 21:21:39,553 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-04 21:21:39,553 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-04 21:21:39,554 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-04 21:21:39,554 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-04 21:21:39,558 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-04 21:21:39,559 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-04 21:21:39,611 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-04 21:21:39,628 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-04 21:21:39,632 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-04 21:21:39,634 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-04 21:21:39,634 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-04 21:21:39,635 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_product.bpl [2019-08-04 21:21:39,635 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_product.bpl' [2019-08-04 21:21:39,680 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-04 21:21:39,681 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-04 21:21:39,682 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-04 21:21:39,682 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-04 21:21:39,682 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-04 21:21:39,699 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:21:39" (1/1) ... [2019-08-04 21:21:39,709 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:21:39" (1/1) ... [2019-08-04 21:21:39,714 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-04 21:21:39,715 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-04 21:21:39,715 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-04 21:21:39,717 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-04 21:21:39,718 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-04 21:21:39,718 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-04 21:21:39,718 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-04 21:21:39,730 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:21:39" (1/1) ... [2019-08-04 21:21:39,730 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:21:39" (1/1) ... [2019-08-04 21:21:39,731 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:21:39" (1/1) ... [2019-08-04 21:21:39,731 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:21:39" (1/1) ... [2019-08-04 21:21:39,735 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:21:39" (1/1) ... [2019-08-04 21:21:39,737 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:21:39" (1/1) ... [2019-08-04 21:21:39,738 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:21:39" (1/1) ... [2019-08-04 21:21:39,740 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-04 21:21:39,740 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-04 21:21:39,741 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-04 21:21:39,741 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-04 21:21:39,742 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:21:39" (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-04 21:21:39,811 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2019-08-04 21:21:39,812 INFO L130 BoogieDeclarations]: Found specification of procedure product [2019-08-04 21:21:39,812 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2019-08-04 21:21:40,199 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint productFINAL: assume true; [2019-08-04 21:21:40,201 INFO L275 CfgBuilder]: Using library mode [2019-08-04 21:21:40,202 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-04 21:21:40,203 INFO L202 PluginConnector]: Adding new model threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 09:21:40 BoogieIcfgContainer [2019-08-04 21:21:40,203 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-04 21:21:40,204 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-04 21:21:40,205 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-04 21:21:40,208 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-04 21:21:40,208 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:21:39" (1/2) ... [2019-08-04 21:21:40,209 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36c1dec7 and model type threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 09:21:40, skipping insertion in model container [2019-08-04 21:21:40,209 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 09:21:40" (2/2) ... [2019-08-04 21:21:40,211 INFO L109 eAbstractionObserver]: Analyzing ICFG threadpooling_product.bpl [2019-08-04 21:21:40,221 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-04 21:21:40,228 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-08-04 21:21:40,244 INFO L252 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-08-04 21:21:40,269 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-04 21:21:40,270 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-04 21:21:40,270 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-04 21:21:40,271 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-04 21:21:40,271 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-04 21:21:40,271 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-04 21:21:40,271 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-04 21:21:40,272 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-04 21:21:40,272 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-04 21:21:40,287 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2019-08-04 21:21:40,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-04 21:21:40,295 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:40,296 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-04 21:21:40,299 INFO L418 AbstractCegarLoop]: === Iteration 1 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:40,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:40,305 INFO L82 PathProgramCache]: Analyzing trace with hash 28755683, now seen corresponding path program 1 times [2019-08-04 21:21:40,351 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:40,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:40,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-04 21:21:40,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:40,534 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-04 21:21:40,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:21:40,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-04 21:21:40,542 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-04 21:21:40,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-04 21:21:40,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-04 21:21:40,557 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 5 states. [2019-08-04 21:21:41,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:41,154 INFO L93 Difference]: Finished difference Result 47 states and 83 transitions. [2019-08-04 21:21:41,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-04 21:21:41,156 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-04 21:21:41,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:41,168 INFO L225 Difference]: With dead ends: 47 [2019-08-04 21:21:41,168 INFO L226 Difference]: Without dead ends: 47 [2019-08-04 21:21:41,170 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-08-04 21:21:41,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-04 21:21:41,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 30. [2019-08-04 21:21:41,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-04 21:21:41,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 49 transitions. [2019-08-04 21:21:41,208 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 49 transitions. Word has length 5 [2019-08-04 21:21:41,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:41,208 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 49 transitions. [2019-08-04 21:21:41,209 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-04 21:21:41,209 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 49 transitions. [2019-08-04 21:21:41,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-04 21:21:41,209 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:41,210 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-04 21:21:41,210 INFO L418 AbstractCegarLoop]: === Iteration 2 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:41,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:41,211 INFO L82 PathProgramCache]: Analyzing trace with hash 28971747, now seen corresponding path program 1 times [2019-08-04 21:21:41,212 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:41,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:41,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-04 21:21:41,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:41,315 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-04 21:21:41,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:21:41,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-04 21:21:41,319 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-04 21:21:41,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-04 21:21:41,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-04 21:21:41,320 INFO L87 Difference]: Start difference. First operand 30 states and 49 transitions. Second operand 5 states. [2019-08-04 21:21:41,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:41,712 INFO L93 Difference]: Finished difference Result 55 states and 97 transitions. [2019-08-04 21:21:41,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-04 21:21:41,713 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-04 21:21:41,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:41,714 INFO L225 Difference]: With dead ends: 55 [2019-08-04 21:21:41,715 INFO L226 Difference]: Without dead ends: 55 [2019-08-04 21:21:41,716 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-08-04 21:21:41,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-04 21:21:41,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 38. [2019-08-04 21:21:41,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-04 21:21:41,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 63 transitions. [2019-08-04 21:21:41,724 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 63 transitions. Word has length 5 [2019-08-04 21:21:41,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:41,724 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 63 transitions. [2019-08-04 21:21:41,724 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-04 21:21:41,724 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 63 transitions. [2019-08-04 21:21:41,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-04 21:21:41,725 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:41,726 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:21:41,726 INFO L418 AbstractCegarLoop]: === Iteration 3 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:41,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:41,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1864688358, now seen corresponding path program 1 times [2019-08-04 21:21:41,728 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:41,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:41,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-04 21:21:41,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:41,985 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-04 21:21:41,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:21:41,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-04 21:21:41,986 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-04 21:21:41,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-04 21:21:41,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-04 21:21:41,987 INFO L87 Difference]: Start difference. First operand 38 states and 63 transitions. Second operand 6 states. [2019-08-04 21:21:42,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:42,472 INFO L93 Difference]: Finished difference Result 65 states and 115 transitions. [2019-08-04 21:21:42,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-04 21:21:42,476 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2019-08-04 21:21:42,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:42,477 INFO L225 Difference]: With dead ends: 65 [2019-08-04 21:21:42,479 INFO L226 Difference]: Without dead ends: 65 [2019-08-04 21:21:42,480 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:21:42,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-04 21:21:42,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 45. [2019-08-04 21:21:42,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-04 21:21:42,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 77 transitions. [2019-08-04 21:21:42,495 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 77 transitions. Word has length 7 [2019-08-04 21:21:42,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:42,495 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 77 transitions. [2019-08-04 21:21:42,495 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-04 21:21:42,496 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 77 transitions. [2019-08-04 21:21:42,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-04 21:21:42,496 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:42,497 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-08-04 21:21:42,497 INFO L418 AbstractCegarLoop]: === Iteration 4 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:42,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:42,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1865765160, now seen corresponding path program 1 times [2019-08-04 21:21:42,499 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:42,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:42,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-04 21:21:42,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:42,542 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:21:42,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:21:42,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-04 21:21:42,543 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-04 21:21:42,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-04 21:21:42,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-04 21:21:42,544 INFO L87 Difference]: Start difference. First operand 45 states and 77 transitions. Second operand 4 states. [2019-08-04 21:21:42,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:42,633 INFO L93 Difference]: Finished difference Result 45 states and 72 transitions. [2019-08-04 21:21:42,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-04 21:21:42,640 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-08-04 21:21:42,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:42,641 INFO L225 Difference]: With dead ends: 45 [2019-08-04 21:21:42,642 INFO L226 Difference]: Without dead ends: 45 [2019-08-04 21:21:42,642 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-04 21:21:42,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-04 21:21:42,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-04 21:21:42,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-04 21:21:42,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 72 transitions. [2019-08-04 21:21:42,650 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 72 transitions. Word has length 7 [2019-08-04 21:21:42,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:42,651 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 72 transitions. [2019-08-04 21:21:42,651 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-04 21:21:42,651 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 72 transitions. [2019-08-04 21:21:42,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-04 21:21:42,652 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:42,652 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:21:42,652 INFO L418 AbstractCegarLoop]: === Iteration 5 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:42,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:42,653 INFO L82 PathProgramCache]: Analyzing trace with hash 2072633864, now seen corresponding path program 1 times [2019-08-04 21:21:42,654 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:42,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:42,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-04 21:21:42,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:42,699 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:21:42,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:21:42,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-04 21:21:42,700 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-04 21:21:42,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-04 21:21:42,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-04 21:21:42,701 INFO L87 Difference]: Start difference. First operand 45 states and 72 transitions. Second operand 4 states. [2019-08-04 21:21:42,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:42,773 INFO L93 Difference]: Finished difference Result 45 states and 66 transitions. [2019-08-04 21:21:42,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-04 21:21:42,775 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-08-04 21:21:42,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:42,776 INFO L225 Difference]: With dead ends: 45 [2019-08-04 21:21:42,776 INFO L226 Difference]: Without dead ends: 45 [2019-08-04 21:21:42,776 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-04 21:21:42,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-04 21:21:42,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-04 21:21:42,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-04 21:21:42,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 66 transitions. [2019-08-04 21:21:42,782 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 66 transitions. Word has length 7 [2019-08-04 21:21:42,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:42,782 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 66 transitions. [2019-08-04 21:21:42,782 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-04 21:21:42,783 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 66 transitions. [2019-08-04 21:21:42,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-04 21:21:42,783 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:42,783 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:21:42,784 INFO L418 AbstractCegarLoop]: === Iteration 6 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:42,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:42,784 INFO L82 PathProgramCache]: Analyzing trace with hash 2071833542, now seen corresponding path program 1 times [2019-08-04 21:21:42,785 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:42,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:42,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-04 21:21:42,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:42,888 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-04 21:21:42,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:21:42,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-04 21:21:42,889 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-04 21:21:42,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-04 21:21:42,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-04 21:21:42,891 INFO L87 Difference]: Start difference. First operand 45 states and 66 transitions. Second operand 6 states. [2019-08-04 21:21:43,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:43,449 INFO L93 Difference]: Finished difference Result 69 states and 102 transitions. [2019-08-04 21:21:43,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-04 21:21:43,449 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2019-08-04 21:21:43,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:43,450 INFO L225 Difference]: With dead ends: 69 [2019-08-04 21:21:43,450 INFO L226 Difference]: Without dead ends: 69 [2019-08-04 21:21:43,451 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:21:43,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-04 21:21:43,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 53. [2019-08-04 21:21:43,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-04 21:21:43,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 77 transitions. [2019-08-04 21:21:43,457 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 77 transitions. Word has length 7 [2019-08-04 21:21:43,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:43,457 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 77 transitions. [2019-08-04 21:21:43,457 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-04 21:21:43,457 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 77 transitions. [2019-08-04 21:21:43,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-04 21:21:43,458 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:43,458 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:21:43,459 INFO L418 AbstractCegarLoop]: === Iteration 7 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:43,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:43,459 INFO L82 PathProgramCache]: Analyzing trace with hash 101966393, now seen corresponding path program 1 times [2019-08-04 21:21:43,460 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:43,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:43,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-04 21:21:43,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:43,559 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:21:43,560 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:21:43,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-04 21:21:43,560 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-04 21:21:43,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-04 21:21:43,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:21:43,562 INFO L87 Difference]: Start difference. First operand 53 states and 77 transitions. Second operand 7 states. [2019-08-04 21:21:44,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:44,026 INFO L93 Difference]: Finished difference Result 128 states and 191 transitions. [2019-08-04 21:21:44,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-04 21:21:44,027 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2019-08-04 21:21:44,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:44,028 INFO L225 Difference]: With dead ends: 128 [2019-08-04 21:21:44,028 INFO L226 Difference]: Without dead ends: 128 [2019-08-04 21:21:44,029 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-08-04 21:21:44,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-08-04 21:21:44,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 91. [2019-08-04 21:21:44,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-08-04 21:21:44,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 144 transitions. [2019-08-04 21:21:44,038 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 144 transitions. Word has length 10 [2019-08-04 21:21:44,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:44,039 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 144 transitions. [2019-08-04 21:21:44,039 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-04 21:21:44,039 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 144 transitions. [2019-08-04 21:21:44,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-04 21:21:44,040 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:44,040 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:21:44,040 INFO L418 AbstractCegarLoop]: === Iteration 8 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:44,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:44,041 INFO L82 PathProgramCache]: Analyzing trace with hash -176034432, now seen corresponding path program 1 times [2019-08-04 21:21:44,042 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:44,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:44,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-04 21:21:44,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:44,142 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:21:44,142 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:21:44,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-04 21:21:44,143 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-04 21:21:44,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-04 21:21:44,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:21:44,144 INFO L87 Difference]: Start difference. First operand 91 states and 144 transitions. Second operand 7 states. [2019-08-04 21:21:44,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:44,554 INFO L93 Difference]: Finished difference Result 214 states and 347 transitions. [2019-08-04 21:21:44,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-04 21:21:44,555 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2019-08-04 21:21:44,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:44,557 INFO L225 Difference]: With dead ends: 214 [2019-08-04 21:21:44,557 INFO L226 Difference]: Without dead ends: 214 [2019-08-04 21:21:44,558 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-08-04 21:21:44,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-08-04 21:21:44,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 160. [2019-08-04 21:21:44,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-08-04 21:21:44,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 265 transitions. [2019-08-04 21:21:44,572 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 265 transitions. Word has length 10 [2019-08-04 21:21:44,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:44,572 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 265 transitions. [2019-08-04 21:21:44,572 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-04 21:21:44,573 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 265 transitions. [2019-08-04 21:21:44,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-04 21:21:44,574 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:44,574 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:21:44,574 INFO L418 AbstractCegarLoop]: === Iteration 9 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:44,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:44,575 INFO L82 PathProgramCache]: Analyzing trace with hash -184622601, now seen corresponding path program 1 times [2019-08-04 21:21:44,576 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:44,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:44,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-04 21:21:44,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:44,666 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:21:44,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:21:44,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-04 21:21:44,668 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-04 21:21:44,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-04 21:21:44,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:21:44,669 INFO L87 Difference]: Start difference. First operand 160 states and 265 transitions. Second operand 7 states. [2019-08-04 21:21:45,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:45,142 INFO L93 Difference]: Finished difference Result 196 states and 313 transitions. [2019-08-04 21:21:45,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-04 21:21:45,142 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2019-08-04 21:21:45,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:45,145 INFO L225 Difference]: With dead ends: 196 [2019-08-04 21:21:45,145 INFO L226 Difference]: Without dead ends: 196 [2019-08-04 21:21:45,146 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2019-08-04 21:21:45,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-08-04 21:21:45,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 157. [2019-08-04 21:21:45,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-08-04 21:21:45,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 259 transitions. [2019-08-04 21:21:45,161 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 259 transitions. Word has length 10 [2019-08-04 21:21:45,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:45,162 INFO L475 AbstractCegarLoop]: Abstraction has 157 states and 259 transitions. [2019-08-04 21:21:45,162 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-04 21:21:45,162 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 259 transitions. [2019-08-04 21:21:45,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-04 21:21:45,163 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:45,163 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:21:45,164 INFO L418 AbstractCegarLoop]: === Iteration 10 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:45,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:45,164 INFO L82 PathProgramCache]: Analyzing trace with hash -973282432, now seen corresponding path program 1 times [2019-08-04 21:21:45,165 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:45,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:45,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-04 21:21:45,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:45,263 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:21:45,263 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:21:45,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-04 21:21:45,264 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-04 21:21:45,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-04 21:21:45,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:21:45,264 INFO L87 Difference]: Start difference. First operand 157 states and 259 transitions. Second operand 7 states. [2019-08-04 21:21:45,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:45,696 INFO L93 Difference]: Finished difference Result 285 states and 468 transitions. [2019-08-04 21:21:45,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-04 21:21:45,696 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2019-08-04 21:21:45,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:45,699 INFO L225 Difference]: With dead ends: 285 [2019-08-04 21:21:45,699 INFO L226 Difference]: Without dead ends: 285 [2019-08-04 21:21:45,700 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2019-08-04 21:21:45,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-08-04 21:21:45,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 223. [2019-08-04 21:21:45,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-08-04 21:21:45,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 375 transitions. [2019-08-04 21:21:45,710 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 375 transitions. Word has length 10 [2019-08-04 21:21:45,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:45,710 INFO L475 AbstractCegarLoop]: Abstraction has 223 states and 375 transitions. [2019-08-04 21:21:45,710 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-04 21:21:45,711 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 375 transitions. [2019-08-04 21:21:45,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-04 21:21:45,712 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:45,712 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:21:45,712 INFO L418 AbstractCegarLoop]: === Iteration 11 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:45,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:45,713 INFO L82 PathProgramCache]: Analyzing trace with hash -981870601, now seen corresponding path program 1 times [2019-08-04 21:21:45,713 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:45,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:45,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-04 21:21:45,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:46,123 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:21:46,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:21:46,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-04 21:21:46,124 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-04 21:21:46,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-04 21:21:46,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:21:46,125 INFO L87 Difference]: Start difference. First operand 223 states and 375 transitions. Second operand 8 states. [2019-08-04 21:21:46,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:46,846 INFO L93 Difference]: Finished difference Result 314 states and 518 transitions. [2019-08-04 21:21:46,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-04 21:21:46,846 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2019-08-04 21:21:46,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:46,850 INFO L225 Difference]: With dead ends: 314 [2019-08-04 21:21:46,850 INFO L226 Difference]: Without dead ends: 314 [2019-08-04 21:21:46,850 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-08-04 21:21:46,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-08-04 21:21:46,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 256. [2019-08-04 21:21:46,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-08-04 21:21:46,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 433 transitions. [2019-08-04 21:21:46,860 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 433 transitions. Word has length 10 [2019-08-04 21:21:46,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:46,861 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 433 transitions. [2019-08-04 21:21:46,861 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-04 21:21:46,861 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 433 transitions. [2019-08-04 21:21:46,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-04 21:21:46,870 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:46,870 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:21:46,870 INFO L418 AbstractCegarLoop]: === Iteration 12 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:46,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:46,871 INFO L82 PathProgramCache]: Analyzing trace with hash -981869319, now seen corresponding path program 1 times [2019-08-04 21:21:46,872 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:46,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:46,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-04 21:21:46,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:47,011 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:21:47,012 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:21:47,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-04 21:21:47,012 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-04 21:21:47,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-04 21:21:47,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:21:47,013 INFO L87 Difference]: Start difference. First operand 256 states and 433 transitions. Second operand 7 states. [2019-08-04 21:21:47,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:47,295 INFO L93 Difference]: Finished difference Result 316 states and 518 transitions. [2019-08-04 21:21:47,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-04 21:21:47,295 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2019-08-04 21:21:47,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:47,297 INFO L225 Difference]: With dead ends: 316 [2019-08-04 21:21:47,297 INFO L226 Difference]: Without dead ends: 316 [2019-08-04 21:21:47,298 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-08-04 21:21:47,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2019-08-04 21:21:47,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 259. [2019-08-04 21:21:47,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-08-04 21:21:47,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 433 transitions. [2019-08-04 21:21:47,306 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 433 transitions. Word has length 10 [2019-08-04 21:21:47,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:47,306 INFO L475 AbstractCegarLoop]: Abstraction has 259 states and 433 transitions. [2019-08-04 21:21:47,306 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-04 21:21:47,306 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 433 transitions. [2019-08-04 21:21:47,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-04 21:21:47,307 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:47,308 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:21:47,308 INFO L418 AbstractCegarLoop]: === Iteration 13 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:47,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:47,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1101306322, now seen corresponding path program 1 times [2019-08-04 21:21:47,309 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:47,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:47,318 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-04 21:21:47,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:47,401 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:21:47,401 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:21:47,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-04 21:21:47,402 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-04 21:21:47,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-04 21:21:47,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:21:47,403 INFO L87 Difference]: Start difference. First operand 259 states and 433 transitions. Second operand 7 states. [2019-08-04 21:21:48,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:48,056 INFO L93 Difference]: Finished difference Result 436 states and 717 transitions. [2019-08-04 21:21:48,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-04 21:21:48,057 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2019-08-04 21:21:48,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:48,060 INFO L225 Difference]: With dead ends: 436 [2019-08-04 21:21:48,060 INFO L226 Difference]: Without dead ends: 436 [2019-08-04 21:21:48,061 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-08-04 21:21:48,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2019-08-04 21:21:48,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 314. [2019-08-04 21:21:48,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-08-04 21:21:48,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 529 transitions. [2019-08-04 21:21:48,070 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 529 transitions. Word has length 10 [2019-08-04 21:21:48,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:48,070 INFO L475 AbstractCegarLoop]: Abstraction has 314 states and 529 transitions. [2019-08-04 21:21:48,070 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-04 21:21:48,070 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 529 transitions. [2019-08-04 21:21:48,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-04 21:21:48,071 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:48,072 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:21:48,072 INFO L418 AbstractCegarLoop]: === Iteration 14 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:48,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:48,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1417035270, now seen corresponding path program 2 times [2019-08-04 21:21:48,077 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:48,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:48,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-04 21:21:48,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:48,294 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:21:48,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:21:48,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-04 21:21:48,295 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-04 21:21:48,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-04 21:21:48,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:21:48,296 INFO L87 Difference]: Start difference. First operand 314 states and 529 transitions. Second operand 7 states. [2019-08-04 21:21:48,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:48,628 INFO L93 Difference]: Finished difference Result 409 states and 671 transitions. [2019-08-04 21:21:48,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-04 21:21:48,638 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-08-04 21:21:48,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:48,641 INFO L225 Difference]: With dead ends: 409 [2019-08-04 21:21:48,641 INFO L226 Difference]: Without dead ends: 409 [2019-08-04 21:21:48,641 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2019-08-04 21:21:48,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2019-08-04 21:21:48,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 343. [2019-08-04 21:21:48,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-08-04 21:21:48,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 575 transitions. [2019-08-04 21:21:48,651 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 575 transitions. Word has length 13 [2019-08-04 21:21:48,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:48,651 INFO L475 AbstractCegarLoop]: Abstraction has 343 states and 575 transitions. [2019-08-04 21:21:48,651 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-04 21:21:48,651 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 575 transitions. [2019-08-04 21:21:48,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-04 21:21:48,652 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:48,652 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:21:48,652 INFO L418 AbstractCegarLoop]: === Iteration 15 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:48,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:48,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1130446276, now seen corresponding path program 1 times [2019-08-04 21:21:48,665 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:48,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:48,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-04 21:21:48,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:48,751 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:21:48,752 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:21:48,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-04 21:21:48,752 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-04 21:21:48,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-04 21:21:48,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:21:48,753 INFO L87 Difference]: Start difference. First operand 343 states and 575 transitions. Second operand 7 states. [2019-08-04 21:21:49,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:49,179 INFO L93 Difference]: Finished difference Result 500 states and 828 transitions. [2019-08-04 21:21:49,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-04 21:21:49,180 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-08-04 21:21:49,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:49,182 INFO L225 Difference]: With dead ends: 500 [2019-08-04 21:21:49,182 INFO L226 Difference]: Without dead ends: 500 [2019-08-04 21:21:49,183 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-08-04 21:21:49,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2019-08-04 21:21:49,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 357. [2019-08-04 21:21:49,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2019-08-04 21:21:49,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 600 transitions. [2019-08-04 21:21:49,196 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 600 transitions. Word has length 13 [2019-08-04 21:21:49,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:49,197 INFO L475 AbstractCegarLoop]: Abstraction has 357 states and 600 transitions. [2019-08-04 21:21:49,197 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-04 21:21:49,197 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 600 transitions. [2019-08-04 21:21:49,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-04 21:21:49,197 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:49,198 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:21:49,198 INFO L418 AbstractCegarLoop]: === Iteration 16 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:49,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:49,200 INFO L82 PathProgramCache]: Analyzing trace with hash -86605091, now seen corresponding path program 1 times [2019-08-04 21:21:49,201 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:49,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:49,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-04 21:21:49,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:49,279 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:21:49,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:21:49,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-04 21:21:49,281 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-04 21:21:49,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-04 21:21:49,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:21:49,282 INFO L87 Difference]: Start difference. First operand 357 states and 600 transitions. Second operand 7 states. [2019-08-04 21:21:51,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:51,388 INFO L93 Difference]: Finished difference Result 509 states and 848 transitions. [2019-08-04 21:21:51,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-04 21:21:51,388 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-08-04 21:21:51,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:51,392 INFO L225 Difference]: With dead ends: 509 [2019-08-04 21:21:51,392 INFO L226 Difference]: Without dead ends: 509 [2019-08-04 21:21:51,393 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2019-08-04 21:21:51,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2019-08-04 21:21:51,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 413. [2019-08-04 21:21:51,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2019-08-04 21:21:51,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 704 transitions. [2019-08-04 21:21:51,408 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 704 transitions. Word has length 13 [2019-08-04 21:21:51,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:51,409 INFO L475 AbstractCegarLoop]: Abstraction has 413 states and 704 transitions. [2019-08-04 21:21:51,409 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-04 21:21:51,409 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 704 transitions. [2019-08-04 21:21:51,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-04 21:21:51,414 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:51,414 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:21:51,415 INFO L418 AbstractCegarLoop]: === Iteration 17 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:51,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:51,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1761298639, now seen corresponding path program 2 times [2019-08-04 21:21:51,417 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:51,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:51,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-04 21:21:51,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:51,902 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:21:51,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:21:51,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-04 21:21:51,904 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-04 21:21:51,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-04 21:21:51,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:21:51,904 INFO L87 Difference]: Start difference. First operand 413 states and 704 transitions. Second operand 7 states. [2019-08-04 21:21:52,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:52,741 INFO L93 Difference]: Finished difference Result 490 states and 816 transitions. [2019-08-04 21:21:52,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-04 21:21:52,742 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-08-04 21:21:52,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:52,744 INFO L225 Difference]: With dead ends: 490 [2019-08-04 21:21:52,745 INFO L226 Difference]: Without dead ends: 490 [2019-08-04 21:21:52,745 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2019-08-04 21:21:52,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2019-08-04 21:21:52,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 389. [2019-08-04 21:21:52,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2019-08-04 21:21:52,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 660 transitions. [2019-08-04 21:21:52,757 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 660 transitions. Word has length 13 [2019-08-04 21:21:52,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:52,757 INFO L475 AbstractCegarLoop]: Abstraction has 389 states and 660 transitions. [2019-08-04 21:21:52,758 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-04 21:21:52,758 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 660 transitions. [2019-08-04 21:21:52,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-04 21:21:52,759 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:52,759 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:21:52,759 INFO L418 AbstractCegarLoop]: === Iteration 18 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:52,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:52,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1752710470, now seen corresponding path program 2 times [2019-08-04 21:21:52,760 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:52,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:52,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-04 21:21:52,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:52,889 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:21:52,889 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:21:52,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-04 21:21:52,890 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-04 21:21:52,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-04 21:21:52,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:21:52,893 INFO L87 Difference]: Start difference. First operand 389 states and 660 transitions. Second operand 7 states. [2019-08-04 21:21:53,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:53,411 INFO L93 Difference]: Finished difference Result 480 states and 798 transitions. [2019-08-04 21:21:53,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-04 21:21:53,412 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-08-04 21:21:53,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:53,415 INFO L225 Difference]: With dead ends: 480 [2019-08-04 21:21:53,415 INFO L226 Difference]: Without dead ends: 480 [2019-08-04 21:21:53,415 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2019-08-04 21:21:53,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2019-08-04 21:21:53,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 357. [2019-08-04 21:21:53,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2019-08-04 21:21:53,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 603 transitions. [2019-08-04 21:21:53,424 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 603 transitions. Word has length 13 [2019-08-04 21:21:53,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:53,425 INFO L475 AbstractCegarLoop]: Abstraction has 357 states and 603 transitions. [2019-08-04 21:21:53,425 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-04 21:21:53,425 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 603 transitions. [2019-08-04 21:21:53,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-04 21:21:53,426 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:53,426 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:21:53,426 INFO L418 AbstractCegarLoop]: === Iteration 19 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:53,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:53,426 INFO L82 PathProgramCache]: Analyzing trace with hash 275962246, now seen corresponding path program 2 times [2019-08-04 21:21:53,427 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:53,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:53,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-04 21:21:53,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:53,557 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:21:53,557 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:21:53,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-04 21:21:53,558 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-04 21:21:53,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-04 21:21:53,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:21:53,558 INFO L87 Difference]: Start difference. First operand 357 states and 603 transitions. Second operand 7 states. [2019-08-04 21:21:54,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:54,108 INFO L93 Difference]: Finished difference Result 538 states and 902 transitions. [2019-08-04 21:21:54,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-04 21:21:54,108 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-08-04 21:21:54,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:54,113 INFO L225 Difference]: With dead ends: 538 [2019-08-04 21:21:54,113 INFO L226 Difference]: Without dead ends: 538 [2019-08-04 21:21:54,113 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2019-08-04 21:21:54,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2019-08-04 21:21:54,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 437. [2019-08-04 21:21:54,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2019-08-04 21:21:54,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 744 transitions. [2019-08-04 21:21:54,123 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 744 transitions. Word has length 13 [2019-08-04 21:21:54,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:54,123 INFO L475 AbstractCegarLoop]: Abstraction has 437 states and 744 transitions. [2019-08-04 21:21:54,124 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-04 21:21:54,124 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 744 transitions. [2019-08-04 21:21:54,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-04 21:21:54,124 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:54,125 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:21:54,125 INFO L418 AbstractCegarLoop]: === Iteration 20 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:54,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:54,125 INFO L82 PathProgramCache]: Analyzing trace with hash 267374077, now seen corresponding path program 1 times [2019-08-04 21:21:54,126 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:54,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:54,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-04 21:21:54,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:54,258 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:21:54,259 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:21:54,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-04 21:21:54,259 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-04 21:21:54,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-04 21:21:54,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:21:54,260 INFO L87 Difference]: Start difference. First operand 437 states and 744 transitions. Second operand 7 states. [2019-08-04 21:21:54,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:54,610 INFO L93 Difference]: Finished difference Result 556 states and 930 transitions. [2019-08-04 21:21:54,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-04 21:21:54,610 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-08-04 21:21:54,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:54,614 INFO L225 Difference]: With dead ends: 556 [2019-08-04 21:21:54,614 INFO L226 Difference]: Without dead ends: 556 [2019-08-04 21:21:54,615 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2019-08-04 21:21:54,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2019-08-04 21:21:54,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 450. [2019-08-04 21:21:54,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2019-08-04 21:21:54,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 763 transitions. [2019-08-04 21:21:54,624 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 763 transitions. Word has length 13 [2019-08-04 21:21:54,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:54,625 INFO L475 AbstractCegarLoop]: Abstraction has 450 states and 763 transitions. [2019-08-04 21:21:54,625 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-04 21:21:54,625 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 763 transitions. [2019-08-04 21:21:54,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-04 21:21:54,625 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:54,626 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:21:54,626 INFO L418 AbstractCegarLoop]: === Iteration 21 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:54,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:54,626 INFO L82 PathProgramCache]: Analyzing trace with hash 2115277807, now seen corresponding path program 2 times [2019-08-04 21:21:54,627 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:54,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:54,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-04 21:21:54,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:55,067 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:21:55,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:21:55,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-04 21:21:55,068 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-04 21:21:55,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-04 21:21:55,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:21:55,069 INFO L87 Difference]: Start difference. First operand 450 states and 763 transitions. Second operand 7 states. [2019-08-04 21:21:55,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:55,415 INFO L93 Difference]: Finished difference Result 588 states and 975 transitions. [2019-08-04 21:21:55,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-04 21:21:55,416 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-08-04 21:21:55,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:55,419 INFO L225 Difference]: With dead ends: 588 [2019-08-04 21:21:55,419 INFO L226 Difference]: Without dead ends: 588 [2019-08-04 21:21:55,420 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2019-08-04 21:21:55,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2019-08-04 21:21:55,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 482. [2019-08-04 21:21:55,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2019-08-04 21:21:55,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 815 transitions. [2019-08-04 21:21:55,427 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 815 transitions. Word has length 13 [2019-08-04 21:21:55,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:55,428 INFO L475 AbstractCegarLoop]: Abstraction has 482 states and 815 transitions. [2019-08-04 21:21:55,428 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-04 21:21:55,428 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 815 transitions. [2019-08-04 21:21:55,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-04 21:21:55,428 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:55,429 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:21:55,429 INFO L418 AbstractCegarLoop]: === Iteration 22 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:55,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:55,429 INFO L82 PathProgramCache]: Analyzing trace with hash -229856780, now seen corresponding path program 1 times [2019-08-04 21:21:55,430 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:55,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:55,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-04 21:21:55,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:55,509 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:21:55,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:21:55,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-04 21:21:55,510 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-04 21:21:55,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-04 21:21:55,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:21:55,511 INFO L87 Difference]: Start difference. First operand 482 states and 815 transitions. Second operand 7 states. [2019-08-04 21:21:56,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:56,001 INFO L93 Difference]: Finished difference Result 611 states and 1013 transitions. [2019-08-04 21:21:56,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-04 21:21:56,003 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-08-04 21:21:56,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:56,006 INFO L225 Difference]: With dead ends: 611 [2019-08-04 21:21:56,006 INFO L226 Difference]: Without dead ends: 611 [2019-08-04 21:21:56,007 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-08-04 21:21:56,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2019-08-04 21:21:56,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 465. [2019-08-04 21:21:56,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2019-08-04 21:21:56,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 783 transitions. [2019-08-04 21:21:56,015 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 783 transitions. Word has length 13 [2019-08-04 21:21:56,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:56,015 INFO L475 AbstractCegarLoop]: Abstraction has 465 states and 783 transitions. [2019-08-04 21:21:56,015 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-04 21:21:56,015 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 783 transitions. [2019-08-04 21:21:56,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-04 21:21:56,016 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:56,016 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:21:56,016 INFO L418 AbstractCegarLoop]: === Iteration 23 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:56,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:56,017 INFO L82 PathProgramCache]: Analyzing trace with hash -238444949, now seen corresponding path program 1 times [2019-08-04 21:21:56,018 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:56,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:56,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-04 21:21:56,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:56,170 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:21:56,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:21:56,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-04 21:21:56,171 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-04 21:21:56,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-04 21:21:56,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:21:56,171 INFO L87 Difference]: Start difference. First operand 465 states and 783 transitions. Second operand 7 states. [2019-08-04 21:21:56,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:56,436 INFO L93 Difference]: Finished difference Result 546 states and 901 transitions. [2019-08-04 21:21:56,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-04 21:21:56,437 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-08-04 21:21:56,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:56,440 INFO L225 Difference]: With dead ends: 546 [2019-08-04 21:21:56,441 INFO L226 Difference]: Without dead ends: 546 [2019-08-04 21:21:56,441 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-08-04 21:21:56,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2019-08-04 21:21:56,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 438. [2019-08-04 21:21:56,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2019-08-04 21:21:56,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 735 transitions. [2019-08-04 21:21:56,448 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 735 transitions. Word has length 13 [2019-08-04 21:21:56,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:56,449 INFO L475 AbstractCegarLoop]: Abstraction has 438 states and 735 transitions. [2019-08-04 21:21:56,449 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-04 21:21:56,449 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 735 transitions. [2019-08-04 21:21:56,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-04 21:21:56,449 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:56,449 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:21:56,450 INFO L418 AbstractCegarLoop]: === Iteration 24 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:56,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:56,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1844731974, now seen corresponding path program 2 times [2019-08-04 21:21:56,451 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:56,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:56,456 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-04 21:21:56,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:56,514 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:21:56,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:21:56,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-04 21:21:56,515 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-04 21:21:56,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-04 21:21:56,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:21:56,516 INFO L87 Difference]: Start difference. First operand 438 states and 735 transitions. Second operand 7 states. [2019-08-04 21:21:56,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:56,799 INFO L93 Difference]: Finished difference Result 547 states and 899 transitions. [2019-08-04 21:21:56,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-04 21:21:56,800 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-08-04 21:21:56,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:56,803 INFO L225 Difference]: With dead ends: 547 [2019-08-04 21:21:56,804 INFO L226 Difference]: Without dead ends: 547 [2019-08-04 21:21:56,804 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2019-08-04 21:21:56,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2019-08-04 21:21:56,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 432. [2019-08-04 21:21:56,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2019-08-04 21:21:56,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 721 transitions. [2019-08-04 21:21:56,812 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 721 transitions. Word has length 13 [2019-08-04 21:21:56,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:56,812 INFO L475 AbstractCegarLoop]: Abstraction has 432 states and 721 transitions. [2019-08-04 21:21:56,812 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-04 21:21:56,812 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 721 transitions. [2019-08-04 21:21:56,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-04 21:21:56,813 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:56,813 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:21:56,813 INFO L418 AbstractCegarLoop]: === Iteration 25 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:56,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:56,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1301349131, now seen corresponding path program 1 times [2019-08-04 21:21:56,815 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:56,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:56,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-04 21:21:56,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:56,986 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:21:56,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:21:56,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-04 21:21:56,987 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-04 21:21:56,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-04 21:21:56,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:21:56,987 INFO L87 Difference]: Start difference. First operand 432 states and 721 transitions. Second operand 9 states. [2019-08-04 21:21:57,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:57,431 INFO L93 Difference]: Finished difference Result 655 states and 1088 transitions. [2019-08-04 21:21:57,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-04 21:21:57,432 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-08-04 21:21:57,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:57,435 INFO L225 Difference]: With dead ends: 655 [2019-08-04 21:21:57,435 INFO L226 Difference]: Without dead ends: 655 [2019-08-04 21:21:57,436 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=251, Unknown=0, NotChecked=0, Total=380 [2019-08-04 21:21:57,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2019-08-04 21:21:57,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 314. [2019-08-04 21:21:57,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-08-04 21:21:57,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 530 transitions. [2019-08-04 21:21:57,442 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 530 transitions. Word has length 15 [2019-08-04 21:21:57,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:57,442 INFO L475 AbstractCegarLoop]: Abstraction has 314 states and 530 transitions. [2019-08-04 21:21:57,442 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-04 21:21:57,442 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 530 transitions. [2019-08-04 21:21:57,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-04 21:21:57,443 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:57,443 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:21:57,443 INFO L418 AbstractCegarLoop]: === Iteration 26 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:57,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:57,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1365577919, now seen corresponding path program 1 times [2019-08-04 21:21:57,444 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:57,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:57,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-04 21:21:57,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:57,578 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:21:57,579 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:21:57,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-04 21:21:57,579 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-04 21:21:57,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-04 21:21:57,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-08-04 21:21:57,580 INFO L87 Difference]: Start difference. First operand 314 states and 530 transitions. Second operand 12 states. [2019-08-04 21:21:58,690 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 29 [2019-08-04 21:22:00,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:00,558 INFO L93 Difference]: Finished difference Result 587 states and 969 transitions. [2019-08-04 21:22:00,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-04 21:22:00,559 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2019-08-04 21:22:00,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:00,562 INFO L225 Difference]: With dead ends: 587 [2019-08-04 21:22:00,562 INFO L226 Difference]: Without dead ends: 587 [2019-08-04 21:22:00,563 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=287, Invalid=835, Unknown=0, NotChecked=0, Total=1122 [2019-08-04 21:22:00,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2019-08-04 21:22:00,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 421. [2019-08-04 21:22:00,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-08-04 21:22:00,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 720 transitions. [2019-08-04 21:22:00,570 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 720 transitions. Word has length 15 [2019-08-04 21:22:00,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:00,570 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 720 transitions. [2019-08-04 21:22:00,571 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-04 21:22:00,571 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 720 transitions. [2019-08-04 21:22:00,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-04 21:22:00,571 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:00,572 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-08-04 21:22:00,572 INFO L418 AbstractCegarLoop]: === Iteration 27 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:00,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:00,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1365577149, now seen corresponding path program 1 times [2019-08-04 21:22:00,573 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:00,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:00,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-04 21:22:00,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:00,703 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:00,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:00,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-04 21:22:00,704 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-04 21:22:00,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-04 21:22:00,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:22:00,705 INFO L87 Difference]: Start difference. First operand 421 states and 720 transitions. Second operand 8 states. [2019-08-04 21:22:01,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:01,108 INFO L93 Difference]: Finished difference Result 466 states and 779 transitions. [2019-08-04 21:22:01,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-04 21:22:01,108 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2019-08-04 21:22:01,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:01,111 INFO L225 Difference]: With dead ends: 466 [2019-08-04 21:22:01,111 INFO L226 Difference]: Without dead ends: 466 [2019-08-04 21:22:01,112 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2019-08-04 21:22:01,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2019-08-04 21:22:01,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 421. [2019-08-04 21:22:01,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-08-04 21:22:01,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 716 transitions. [2019-08-04 21:22:01,119 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 716 transitions. Word has length 15 [2019-08-04 21:22:01,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:01,119 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 716 transitions. [2019-08-04 21:22:01,119 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-04 21:22:01,119 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 716 transitions. [2019-08-04 21:22:01,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-04 21:22:01,120 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:01,120 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:01,121 INFO L418 AbstractCegarLoop]: === Iteration 28 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:01,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:01,121 INFO L82 PathProgramCache]: Analyzing trace with hash -57530837, now seen corresponding path program 1 times [2019-08-04 21:22:01,122 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:01,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:01,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-04 21:22:01,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:01,228 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:01,228 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:01,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-04 21:22:01,228 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-04 21:22:01,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-04 21:22:01,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:22:01,229 INFO L87 Difference]: Start difference. First operand 421 states and 716 transitions. Second operand 9 states. [2019-08-04 21:22:01,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:01,671 INFO L93 Difference]: Finished difference Result 546 states and 922 transitions. [2019-08-04 21:22:01,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-04 21:22:01,672 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-08-04 21:22:01,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:01,675 INFO L225 Difference]: With dead ends: 546 [2019-08-04 21:22:01,675 INFO L226 Difference]: Without dead ends: 546 [2019-08-04 21:22:01,675 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=251, Unknown=0, NotChecked=0, Total=380 [2019-08-04 21:22:01,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2019-08-04 21:22:01,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 270. [2019-08-04 21:22:01,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2019-08-04 21:22:01,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 459 transitions. [2019-08-04 21:22:01,680 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 459 transitions. Word has length 15 [2019-08-04 21:22:01,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:01,681 INFO L475 AbstractCegarLoop]: Abstraction has 270 states and 459 transitions. [2019-08-04 21:22:01,681 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-04 21:22:01,681 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 459 transitions. [2019-08-04 21:22:01,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-04 21:22:01,682 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:01,682 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:01,682 INFO L418 AbstractCegarLoop]: === Iteration 29 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:01,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:01,682 INFO L82 PathProgramCache]: Analyzing trace with hash -992157619, now seen corresponding path program 1 times [2019-08-04 21:22:01,683 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:01,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:01,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-04 21:22:01,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:01,832 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:01,833 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:01,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-04 21:22:01,833 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-04 21:22:01,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-04 21:22:01,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:22:01,834 INFO L87 Difference]: Start difference. First operand 270 states and 459 transitions. Second operand 9 states. [2019-08-04 21:22:02,393 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 18 [2019-08-04 21:22:02,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:02,497 INFO L93 Difference]: Finished difference Result 409 states and 684 transitions. [2019-08-04 21:22:02,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-04 21:22:02,497 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-08-04 21:22:02,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:02,500 INFO L225 Difference]: With dead ends: 409 [2019-08-04 21:22:02,500 INFO L226 Difference]: Without dead ends: 409 [2019-08-04 21:22:02,500 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2019-08-04 21:22:02,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2019-08-04 21:22:02,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 291. [2019-08-04 21:22:02,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-08-04 21:22:02,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 497 transitions. [2019-08-04 21:22:02,505 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 497 transitions. Word has length 18 [2019-08-04 21:22:02,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:02,505 INFO L475 AbstractCegarLoop]: Abstraction has 291 states and 497 transitions. [2019-08-04 21:22:02,506 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-04 21:22:02,506 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 497 transitions. [2019-08-04 21:22:02,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-04 21:22:02,506 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:02,506 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:02,507 INFO L418 AbstractCegarLoop]: === Iteration 30 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:02,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:02,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1270158444, now seen corresponding path program 1 times [2019-08-04 21:22:02,508 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:02,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:02,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-04 21:22:02,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:02,620 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:02,620 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:02,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-04 21:22:02,621 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-04 21:22:02,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-04 21:22:02,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:22:02,621 INFO L87 Difference]: Start difference. First operand 291 states and 497 transitions. Second operand 9 states. [2019-08-04 21:22:03,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:03,215 INFO L93 Difference]: Finished difference Result 379 states and 635 transitions. [2019-08-04 21:22:03,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-04 21:22:03,216 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-08-04 21:22:03,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:03,218 INFO L225 Difference]: With dead ends: 379 [2019-08-04 21:22:03,218 INFO L226 Difference]: Without dead ends: 379 [2019-08-04 21:22:03,219 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2019-08-04 21:22:03,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2019-08-04 21:22:03,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 308. [2019-08-04 21:22:03,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2019-08-04 21:22:03,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 522 transitions. [2019-08-04 21:22:03,223 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 522 transitions. Word has length 18 [2019-08-04 21:22:03,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:03,224 INFO L475 AbstractCegarLoop]: Abstraction has 308 states and 522 transitions. [2019-08-04 21:22:03,224 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-04 21:22:03,224 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 522 transitions. [2019-08-04 21:22:03,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-04 21:22:03,225 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:03,225 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:03,225 INFO L418 AbstractCegarLoop]: === Iteration 31 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:03,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:03,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1278746613, now seen corresponding path program 1 times [2019-08-04 21:22:03,226 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:03,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:03,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-04 21:22:03,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:03,335 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:03,335 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:03,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-04 21:22:03,335 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-04 21:22:03,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-04 21:22:03,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:22:03,336 INFO L87 Difference]: Start difference. First operand 308 states and 522 transitions. Second operand 9 states. [2019-08-04 21:22:03,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:03,832 INFO L93 Difference]: Finished difference Result 412 states and 690 transitions. [2019-08-04 21:22:03,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-04 21:22:03,832 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-08-04 21:22:03,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:03,835 INFO L225 Difference]: With dead ends: 412 [2019-08-04 21:22:03,835 INFO L226 Difference]: Without dead ends: 412 [2019-08-04 21:22:03,835 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2019-08-04 21:22:03,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2019-08-04 21:22:03,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 306. [2019-08-04 21:22:03,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2019-08-04 21:22:03,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 520 transitions. [2019-08-04 21:22:03,840 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 520 transitions. Word has length 18 [2019-08-04 21:22:03,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:03,840 INFO L475 AbstractCegarLoop]: Abstraction has 306 states and 520 transitions. [2019-08-04 21:22:03,840 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-04 21:22:03,840 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 520 transitions. [2019-08-04 21:22:03,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-04 21:22:03,841 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:03,841 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:03,841 INFO L418 AbstractCegarLoop]: === Iteration 32 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:03,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:03,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1502173349, now seen corresponding path program 2 times [2019-08-04 21:22:03,842 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:03,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:03,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-04 21:22:03,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:03,938 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:03,939 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:03,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-04 21:22:03,939 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-04 21:22:03,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-04 21:22:03,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:22:03,940 INFO L87 Difference]: Start difference. First operand 306 states and 520 transitions. Second operand 9 states. [2019-08-04 21:22:04,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:04,529 INFO L93 Difference]: Finished difference Result 453 states and 750 transitions. [2019-08-04 21:22:04,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-04 21:22:04,530 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-08-04 21:22:04,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:04,532 INFO L225 Difference]: With dead ends: 453 [2019-08-04 21:22:04,532 INFO L226 Difference]: Without dead ends: 453 [2019-08-04 21:22:04,533 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=253, Unknown=0, NotChecked=0, Total=380 [2019-08-04 21:22:04,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2019-08-04 21:22:04,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 261. [2019-08-04 21:22:04,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-08-04 21:22:04,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 439 transitions. [2019-08-04 21:22:04,538 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 439 transitions. Word has length 18 [2019-08-04 21:22:04,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:04,538 INFO L475 AbstractCegarLoop]: Abstraction has 261 states and 439 transitions. [2019-08-04 21:22:04,538 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-04 21:22:04,538 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 439 transitions. [2019-08-04 21:22:04,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-04 21:22:04,539 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:04,539 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:04,539 INFO L418 AbstractCegarLoop]: === Iteration 33 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:04,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:04,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1224172524, now seen corresponding path program 2 times [2019-08-04 21:22:04,540 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:04,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:04,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-04 21:22:04,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:04,966 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:04,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:04,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-04 21:22:04,967 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-04 21:22:04,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-04 21:22:04,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:22:04,967 INFO L87 Difference]: Start difference. First operand 261 states and 439 transitions. Second operand 9 states. [2019-08-04 21:22:05,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:05,467 INFO L93 Difference]: Finished difference Result 334 states and 543 transitions. [2019-08-04 21:22:05,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-04 21:22:05,468 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-08-04 21:22:05,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:05,469 INFO L225 Difference]: With dead ends: 334 [2019-08-04 21:22:05,470 INFO L226 Difference]: Without dead ends: 334 [2019-08-04 21:22:05,471 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=135, Invalid=327, Unknown=0, NotChecked=0, Total=462 [2019-08-04 21:22:05,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-08-04 21:22:05,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 253. [2019-08-04 21:22:05,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-08-04 21:22:05,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 423 transitions. [2019-08-04 21:22:05,474 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 423 transitions. Word has length 18 [2019-08-04 21:22:05,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:05,474 INFO L475 AbstractCegarLoop]: Abstraction has 253 states and 423 transitions. [2019-08-04 21:22:05,475 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-04 21:22:05,475 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 423 transitions. [2019-08-04 21:22:05,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-04 21:22:05,475 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:05,475 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:05,476 INFO L418 AbstractCegarLoop]: === Iteration 34 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:05,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:05,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1215584355, now seen corresponding path program 2 times [2019-08-04 21:22:05,476 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:05,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:05,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-04 21:22:05,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:05,544 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:05,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:05,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-04 21:22:05,545 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-04 21:22:05,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-04 21:22:05,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:22:05,545 INFO L87 Difference]: Start difference. First operand 253 states and 423 transitions. Second operand 9 states. [2019-08-04 21:22:06,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:06,079 INFO L93 Difference]: Finished difference Result 372 states and 609 transitions. [2019-08-04 21:22:06,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-04 21:22:06,079 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-08-04 21:22:06,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:06,082 INFO L225 Difference]: With dead ends: 372 [2019-08-04 21:22:06,082 INFO L226 Difference]: Without dead ends: 372 [2019-08-04 21:22:06,082 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462 [2019-08-04 21:22:06,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2019-08-04 21:22:06,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 234. [2019-08-04 21:22:06,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-08-04 21:22:06,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 390 transitions. [2019-08-04 21:22:06,086 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 390 transitions. Word has length 18 [2019-08-04 21:22:06,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:06,086 INFO L475 AbstractCegarLoop]: Abstraction has 234 states and 390 transitions. [2019-08-04 21:22:06,086 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-04 21:22:06,086 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 390 transitions. [2019-08-04 21:22:06,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-04 21:22:06,087 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:06,087 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:06,087 INFO L418 AbstractCegarLoop]: === Iteration 35 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:06,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:06,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1467012, now seen corresponding path program 1 times [2019-08-04 21:22:06,088 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:06,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:06,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-04 21:22:06,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:06,211 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:06,212 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:06,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-04 21:22:06,212 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-04 21:22:06,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-04 21:22:06,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:22:06,213 INFO L87 Difference]: Start difference. First operand 234 states and 390 transitions. Second operand 9 states. [2019-08-04 21:22:06,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:06,794 INFO L93 Difference]: Finished difference Result 352 states and 576 transitions. [2019-08-04 21:22:06,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-04 21:22:06,795 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-08-04 21:22:06,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:06,797 INFO L225 Difference]: With dead ends: 352 [2019-08-04 21:22:06,797 INFO L226 Difference]: Without dead ends: 352 [2019-08-04 21:22:06,797 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=149, Invalid=357, Unknown=0, NotChecked=0, Total=506 [2019-08-04 21:22:06,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2019-08-04 21:22:06,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 219. [2019-08-04 21:22:06,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-08-04 21:22:06,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 365 transitions. [2019-08-04 21:22:06,801 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 365 transitions. Word has length 18 [2019-08-04 21:22:06,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:06,801 INFO L475 AbstractCegarLoop]: Abstraction has 219 states and 365 transitions. [2019-08-04 21:22:06,801 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-04 21:22:06,801 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 365 transitions. [2019-08-04 21:22:06,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-04 21:22:06,801 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:06,802 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:06,802 INFO L418 AbstractCegarLoop]: === Iteration 36 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:06,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:06,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1846436718, now seen corresponding path program 2 times [2019-08-04 21:22:06,803 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:06,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:06,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-04 21:22:06,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:06,845 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:06,846 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:06,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-04 21:22:06,846 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-04 21:22:06,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-04 21:22:06,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:22:06,847 INFO L87 Difference]: Start difference. First operand 219 states and 365 transitions. Second operand 9 states. [2019-08-04 21:22:07,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:07,512 INFO L93 Difference]: Finished difference Result 284 states and 461 transitions. [2019-08-04 21:22:07,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-04 21:22:07,512 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-08-04 21:22:07,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:07,514 INFO L225 Difference]: With dead ends: 284 [2019-08-04 21:22:07,515 INFO L226 Difference]: Without dead ends: 284 [2019-08-04 21:22:07,515 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=170, Invalid=382, Unknown=0, NotChecked=0, Total=552 [2019-08-04 21:22:07,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-08-04 21:22:07,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 135. [2019-08-04 21:22:07,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-08-04 21:22:07,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 219 transitions. [2019-08-04 21:22:07,518 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 219 transitions. Word has length 18 [2019-08-04 21:22:07,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:07,518 INFO L475 AbstractCegarLoop]: Abstraction has 135 states and 219 transitions. [2019-08-04 21:22:07,518 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-04 21:22:07,519 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 219 transitions. [2019-08-04 21:22:07,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-04 21:22:07,519 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:07,519 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:07,519 INFO L418 AbstractCegarLoop]: === Iteration 37 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:07,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:07,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1837848549, now seen corresponding path program 1 times [2019-08-04 21:22:07,520 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:07,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:07,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-04 21:22:07,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:07,584 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:07,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:07,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-04 21:22:07,584 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-04 21:22:07,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-04 21:22:07,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:22:07,585 INFO L87 Difference]: Start difference. First operand 135 states and 219 transitions. Second operand 9 states. [2019-08-04 21:22:08,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:08,258 INFO L93 Difference]: Finished difference Result 176 states and 282 transitions. [2019-08-04 21:22:08,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-04 21:22:08,258 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-08-04 21:22:08,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:08,260 INFO L225 Difference]: With dead ends: 176 [2019-08-04 21:22:08,260 INFO L226 Difference]: Without dead ends: 176 [2019-08-04 21:22:08,260 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=287, Unknown=0, NotChecked=0, Total=420 [2019-08-04 21:22:08,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-08-04 21:22:08,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 98. [2019-08-04 21:22:08,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-08-04 21:22:08,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 155 transitions. [2019-08-04 21:22:08,263 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 155 transitions. Word has length 18 [2019-08-04 21:22:08,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:08,263 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 155 transitions. [2019-08-04 21:22:08,263 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-04 21:22:08,264 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 155 transitions. [2019-08-04 21:22:08,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-04 21:22:08,264 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:08,264 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:08,264 INFO L418 AbstractCegarLoop]: === Iteration 38 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:08,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:08,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1672170852, now seen corresponding path program 1 times [2019-08-04 21:22:08,265 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:08,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:08,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-04 21:22:08,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:08,365 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:08,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:08,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-04 21:22:08,366 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-04 21:22:08,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-04 21:22:08,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:22:08,366 INFO L87 Difference]: Start difference. First operand 98 states and 155 transitions. Second operand 9 states. [2019-08-04 21:22:08,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:08,980 INFO L93 Difference]: Finished difference Result 208 states and 326 transitions. [2019-08-04 21:22:08,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-04 21:22:08,980 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-08-04 21:22:08,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:08,982 INFO L225 Difference]: With dead ends: 208 [2019-08-04 21:22:08,982 INFO L226 Difference]: Without dead ends: 208 [2019-08-04 21:22:08,982 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=253, Unknown=0, NotChecked=0, Total=380 [2019-08-04 21:22:08,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-08-04 21:22:08,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 114. [2019-08-04 21:22:08,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-08-04 21:22:08,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 182 transitions. [2019-08-04 21:22:08,984 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 182 transitions. Word has length 18 [2019-08-04 21:22:08,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:08,985 INFO L475 AbstractCegarLoop]: Abstraction has 114 states and 182 transitions. [2019-08-04 21:22:08,985 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-04 21:22:08,985 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 182 transitions. [2019-08-04 21:22:08,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-04 21:22:08,985 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:08,985 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:08,985 INFO L418 AbstractCegarLoop]: === Iteration 39 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:08,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:08,986 INFO L82 PathProgramCache]: Analyzing trace with hash 589747428, now seen corresponding path program 2 times [2019-08-04 21:22:08,986 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:08,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:08,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-04 21:22:08,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:09,055 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:09,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:09,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-04 21:22:09,056 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-04 21:22:09,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-04 21:22:09,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:22:09,056 INFO L87 Difference]: Start difference. First operand 114 states and 182 transitions. Second operand 9 states. [2019-08-04 21:22:09,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:09,635 INFO L93 Difference]: Finished difference Result 177 states and 278 transitions. [2019-08-04 21:22:09,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-04 21:22:09,635 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-08-04 21:22:09,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:09,636 INFO L225 Difference]: With dead ends: 177 [2019-08-04 21:22:09,636 INFO L226 Difference]: Without dead ends: 177 [2019-08-04 21:22:09,637 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462 [2019-08-04 21:22:09,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-08-04 21:22:09,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 123. [2019-08-04 21:22:09,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-08-04 21:22:09,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 199 transitions. [2019-08-04 21:22:09,640 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 199 transitions. Word has length 18 [2019-08-04 21:22:09,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:09,640 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 199 transitions. [2019-08-04 21:22:09,640 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-04 21:22:09,640 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 199 transitions. [2019-08-04 21:22:09,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-04 21:22:09,640 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:09,641 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:09,641 INFO L418 AbstractCegarLoop]: === Iteration 40 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:09,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:09,641 INFO L82 PathProgramCache]: Analyzing trace with hash 581159259, now seen corresponding path program 1 times [2019-08-04 21:22:09,642 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:09,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:09,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-04 21:22:09,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:09,755 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:09,755 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:09,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-04 21:22:09,756 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-04 21:22:09,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-04 21:22:09,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:22:09,757 INFO L87 Difference]: Start difference. First operand 123 states and 199 transitions. Second operand 9 states. [2019-08-04 21:22:10,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:10,191 INFO L93 Difference]: Finished difference Result 161 states and 251 transitions. [2019-08-04 21:22:10,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-04 21:22:10,191 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-08-04 21:22:10,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:10,193 INFO L225 Difference]: With dead ends: 161 [2019-08-04 21:22:10,193 INFO L226 Difference]: Without dead ends: 161 [2019-08-04 21:22:10,193 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2019-08-04 21:22:10,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-08-04 21:22:10,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 116. [2019-08-04 21:22:10,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-08-04 21:22:10,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 188 transitions. [2019-08-04 21:22:10,196 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 188 transitions. Word has length 18 [2019-08-04 21:22:10,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:10,196 INFO L475 AbstractCegarLoop]: Abstraction has 116 states and 188 transitions. [2019-08-04 21:22:10,196 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-04 21:22:10,196 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 188 transitions. [2019-08-04 21:22:10,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-04 21:22:10,197 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:10,197 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:10,197 INFO L418 AbstractCegarLoop]: === Iteration 41 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:10,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:10,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1655319964, now seen corresponding path program 3 times [2019-08-04 21:22:10,198 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:10,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:10,203 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-04 21:22:10,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:10,534 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:10,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:10,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-04 21:22:10,535 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-04 21:22:10,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-04 21:22:10,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:22:10,535 INFO L87 Difference]: Start difference. First operand 116 states and 188 transitions. Second operand 9 states. [2019-08-04 21:22:11,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:11,108 INFO L93 Difference]: Finished difference Result 163 states and 258 transitions. [2019-08-04 21:22:11,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-04 21:22:11,108 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-08-04 21:22:11,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:11,109 INFO L225 Difference]: With dead ends: 163 [2019-08-04 21:22:11,109 INFO L226 Difference]: Without dead ends: 163 [2019-08-04 21:22:11,110 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=133, Invalid=287, Unknown=0, NotChecked=0, Total=420 [2019-08-04 21:22:11,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-08-04 21:22:11,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 108. [2019-08-04 21:22:11,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-08-04 21:22:11,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 173 transitions. [2019-08-04 21:22:11,112 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 173 transitions. Word has length 18 [2019-08-04 21:22:11,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:11,113 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 173 transitions. [2019-08-04 21:22:11,113 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-04 21:22:11,113 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 173 transitions. [2019-08-04 21:22:11,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-04 21:22:11,113 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:11,113 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:11,114 INFO L418 AbstractCegarLoop]: === Iteration 42 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:11,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:11,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1646731795, now seen corresponding path program 2 times [2019-08-04 21:22:11,114 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:11,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:11,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-04 21:22:11,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:11,212 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:11,212 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:11,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-04 21:22:11,212 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-04 21:22:11,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-04 21:22:11,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:22:11,213 INFO L87 Difference]: Start difference. First operand 108 states and 173 transitions. Second operand 9 states. [2019-08-04 21:22:11,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:11,815 INFO L93 Difference]: Finished difference Result 155 states and 243 transitions. [2019-08-04 21:22:11,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-04 21:22:11,815 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-08-04 21:22:11,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:11,817 INFO L225 Difference]: With dead ends: 155 [2019-08-04 21:22:11,817 INFO L226 Difference]: Without dead ends: 155 [2019-08-04 21:22:11,817 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=251, Unknown=0, NotChecked=0, Total=380 [2019-08-04 21:22:11,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-08-04 21:22:11,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 107. [2019-08-04 21:22:11,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-04 21:22:11,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 171 transitions. [2019-08-04 21:22:11,820 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 171 transitions. Word has length 18 [2019-08-04 21:22:11,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:11,821 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 171 transitions. [2019-08-04 21:22:11,821 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-04 21:22:11,821 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 171 transitions. [2019-08-04 21:22:11,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-04 21:22:11,821 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:11,821 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:11,822 INFO L418 AbstractCegarLoop]: === Iteration 43 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:11,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:11,822 INFO L82 PathProgramCache]: Analyzing trace with hash -800331771, now seen corresponding path program 3 times [2019-08-04 21:22:11,823 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:11,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:11,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-04 21:22:11,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:11,878 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:11,878 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:11,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-04 21:22:11,878 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-04 21:22:11,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-04 21:22:11,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:22:11,879 INFO L87 Difference]: Start difference. First operand 107 states and 171 transitions. Second operand 9 states. [2019-08-04 21:22:12,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:12,335 INFO L93 Difference]: Finished difference Result 142 states and 225 transitions. [2019-08-04 21:22:12,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-04 21:22:12,336 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-08-04 21:22:12,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:12,337 INFO L225 Difference]: With dead ends: 142 [2019-08-04 21:22:12,337 INFO L226 Difference]: Without dead ends: 142 [2019-08-04 21:22:12,338 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2019-08-04 21:22:12,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-08-04 21:22:12,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 79. [2019-08-04 21:22:12,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-04 21:22:12,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 124 transitions. [2019-08-04 21:22:12,340 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 124 transitions. Word has length 18 [2019-08-04 21:22:12,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:12,341 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 124 transitions. [2019-08-04 21:22:12,341 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-04 21:22:12,341 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 124 transitions. [2019-08-04 21:22:12,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-04 21:22:12,341 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:12,341 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:12,341 INFO L418 AbstractCegarLoop]: === Iteration 44 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:12,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:12,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1512966418, now seen corresponding path program 1 times [2019-08-04 21:22:12,342 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:12,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:12,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-04 21:22:12,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:12,480 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:12,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:12,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-04 21:22:12,481 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-04 21:22:12,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-04 21:22:12,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:22:12,482 INFO L87 Difference]: Start difference. First operand 79 states and 124 transitions. Second operand 9 states. [2019-08-04 21:22:12,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:12,855 INFO L93 Difference]: Finished difference Result 136 states and 213 transitions. [2019-08-04 21:22:12,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-04 21:22:12,856 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-08-04 21:22:12,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:12,857 INFO L225 Difference]: With dead ends: 136 [2019-08-04 21:22:12,857 INFO L226 Difference]: Without dead ends: 136 [2019-08-04 21:22:12,857 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2019-08-04 21:22:12,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-08-04 21:22:12,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 59. [2019-08-04 21:22:12,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-04 21:22:12,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 90 transitions. [2019-08-04 21:22:12,859 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 90 transitions. Word has length 18 [2019-08-04 21:22:12,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:12,859 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 90 transitions. [2019-08-04 21:22:12,860 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-04 21:22:12,860 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 90 transitions. [2019-08-04 21:22:12,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-04 21:22:12,860 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:12,860 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:12,860 INFO L418 AbstractCegarLoop]: === Iteration 45 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:12,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:12,861 INFO L82 PathProgramCache]: Analyzing trace with hash 748951862, now seen corresponding path program 2 times [2019-08-04 21:22:12,861 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:12,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:12,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-04 21:22:12,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:13,014 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:13,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:13,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-04 21:22:13,015 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-04 21:22:13,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-04 21:22:13,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:22:13,015 INFO L87 Difference]: Start difference. First operand 59 states and 90 transitions. Second operand 9 states. [2019-08-04 21:22:13,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:13,557 INFO L93 Difference]: Finished difference Result 125 states and 198 transitions. [2019-08-04 21:22:13,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-04 21:22:13,557 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-08-04 21:22:13,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:13,558 INFO L225 Difference]: With dead ends: 125 [2019-08-04 21:22:13,558 INFO L226 Difference]: Without dead ends: 125 [2019-08-04 21:22:13,559 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2019-08-04 21:22:13,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-08-04 21:22:13,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 45. [2019-08-04 21:22:13,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-04 21:22:13,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 68 transitions. [2019-08-04 21:22:13,561 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 68 transitions. Word has length 18 [2019-08-04 21:22:13,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:13,561 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 68 transitions. [2019-08-04 21:22:13,561 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-04 21:22:13,561 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 68 transitions. [2019-08-04 21:22:13,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-04 21:22:13,561 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:13,562 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:13,562 INFO L418 AbstractCegarLoop]: === Iteration 46 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:13,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:13,562 INFO L82 PathProgramCache]: Analyzing trace with hash 740363693, now seen corresponding path program 1 times [2019-08-04 21:22:13,562 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:13,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:13,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-04 21:22:13,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:13,610 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:13,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:13,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-04 21:22:13,611 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-04 21:22:13,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-04 21:22:13,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:22:13,612 INFO L87 Difference]: Start difference. First operand 45 states and 68 transitions. Second operand 9 states. [2019-08-04 21:22:14,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:14,049 INFO L93 Difference]: Finished difference Result 96 states and 151 transitions. [2019-08-04 21:22:14,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-04 21:22:14,050 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-08-04 21:22:14,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:14,050 INFO L225 Difference]: With dead ends: 96 [2019-08-04 21:22:14,050 INFO L226 Difference]: Without dead ends: 0 [2019-08-04 21:22:14,051 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2019-08-04 21:22:14,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-04 21:22:14,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-04 21:22:14,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-04 21:22:14,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-04 21:22:14,052 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2019-08-04 21:22:14,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:14,052 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-04 21:22:14,052 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-04 21:22:14,052 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-04 21:22:14,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-04 21:22:14,057 INFO L202 PluginConnector]: Adding new model threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 09:22:14 BoogieIcfgContainer [2019-08-04 21:22:14,057 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-04 21:22:14,059 INFO L168 Benchmark]: Toolchain (without parser) took 34377.77 ms. Allocated memory was 140.5 MB in the beginning and 390.1 MB in the end (delta: 249.6 MB). Free memory was 110.0 MB in the beginning and 86.4 MB in the end (delta: 23.6 MB). Peak memory consumption was 273.2 MB. Max. memory is 7.1 GB. [2019-08-04 21:22:14,060 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 140.5 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-04 21:22:14,061 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.68 ms. Allocated memory is still 140.5 MB. Free memory was 109.8 MB in the beginning and 108.0 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-08-04 21:22:14,061 INFO L168 Benchmark]: Boogie Preprocessor took 21.90 ms. Allocated memory is still 140.5 MB. Free memory was 108.0 MB in the beginning and 106.9 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-08-04 21:22:14,062 INFO L168 Benchmark]: RCFGBuilder took 462.77 ms. Allocated memory is still 140.5 MB. Free memory was 106.9 MB in the beginning and 94.0 MB in the end (delta: 12.9 MB). Peak memory consumption was 12.9 MB. Max. memory is 7.1 GB. [2019-08-04 21:22:14,063 INFO L168 Benchmark]: TraceAbstraction took 33852.74 ms. Allocated memory was 140.5 MB in the beginning and 390.1 MB in the end (delta: 249.6 MB). Free memory was 93.8 MB in the beginning and 86.4 MB in the end (delta: 7.4 MB). Peak memory consumption was 256.9 MB. Max. memory is 7.1 GB. [2019-08-04 21:22:14,066 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.23 ms. Allocated memory is still 140.5 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 35.68 ms. Allocated memory is still 140.5 MB. Free memory was 109.8 MB in the beginning and 108.0 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 21.90 ms. Allocated memory is still 140.5 MB. Free memory was 108.0 MB in the beginning and 106.9 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 462.77 ms. Allocated memory is still 140.5 MB. Free memory was 106.9 MB in the beginning and 94.0 MB in the end (delta: 12.9 MB). Peak memory consumption was 12.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 33852.74 ms. Allocated memory was 140.5 MB in the beginning and 390.1 MB in the end (delta: 249.6 MB). Free memory was 93.8 MB in the beginning and 86.4 MB in the end (delta: 7.4 MB). Peak memory consumption was 256.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 45]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 94]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 85]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 74]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 22 locations, 4 error locations. SAFE Result, 33.7s OverallTime, 46 OverallIterations, 2 TraceHistogramMax, 26.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1467 SDtfs, 4199 SDslu, 2721 SDs, 0 SdLazy, 13716 SolverSat, 1096 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 15.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 991 GetRequests, 327 SyntacticMatches, 0 SemanticMatches, 664 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1592 ImplicationChecksByTransitivity, 13.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=482occurred in iteration=21, 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.3s AutomataMinimizationTime, 46 MinimizatonAttempts, 4120 StatesRemovedByMinimization, 43 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 635 NumberOfCodeBlocks, 635 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 589 ConstructedInterpolants, 19 QuantifiedInterpolants, 44690 SizeOfPredicates, 164 NumberOfNonLiveVariables, 1882 ConjunctsInSsa, 339 ConjunctsInUnsatCore, 46 InterpolantComputations, 6 PerfectInterpolantSequences, 9/260 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...