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_WithProcedures.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:08:14,385 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:08:14,387 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:08:14,399 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:08:14,400 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:08:14,401 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:08:14,402 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:08:14,404 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:08:14,405 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:08:14,406 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:08:14,407 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:08:14,407 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:08:14,408 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:08:14,409 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:08:14,409 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:08:14,411 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:08:14,411 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:08:14,412 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:08:14,414 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:08:14,416 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:08:14,418 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:08:14,419 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:08:14,420 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:08:14,421 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:08:14,423 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:08:14,423 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:08:14,423 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:08:14,424 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:08:14,425 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:08:14,426 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:08:14,426 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:08:14,427 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:08:14,428 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:08:14,428 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:08:14,429 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:08:14,430 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:08:14,430 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:08:14,431 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:08:14,431 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:08:14,432 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:08:14,433 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:08:14,460 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:08:14,475 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:08:14,478 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:08:14,480 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:08:14,481 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:08:14,482 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_product_WithProcedures.bpl [2019-08-05 10:08:14,482 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_product_WithProcedures.bpl' [2019-08-05 10:08:14,534 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:08:14,536 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:08:14,536 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:08:14,536 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:08:14,537 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:08:14,553 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:08:14" (1/1) ... [2019-08-05 10:08:14,564 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:08:14" (1/1) ... [2019-08-05 10:08:14,575 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:08:14,576 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:08:14,576 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:08:14,576 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:08:14,586 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:08:14" (1/1) ... [2019-08-05 10:08:14,587 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:08:14" (1/1) ... [2019-08-05 10:08:14,588 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:08:14" (1/1) ... [2019-08-05 10:08:14,588 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:08:14" (1/1) ... [2019-08-05 10:08:14,597 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:08:14" (1/1) ... [2019-08-05 10:08:14,601 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:08:14" (1/1) ... [2019-08-05 10:08:14,602 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:08:14" (1/1) ... [2019-08-05 10:08:14,610 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:08:14,611 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:08:14,611 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:08:14,611 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:08:14,614 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:08:14" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 10:08:14,682 INFO L130 BoogieDeclarations]: Found specification of procedure l0l1 [2019-08-05 10:08:14,682 INFO L138 BoogieDeclarations]: Found implementation of procedure l0l1 [2019-08-05 10:08:14,682 INFO L130 BoogieDeclarations]: Found specification of procedure l1l0 [2019-08-05 10:08:14,683 INFO L138 BoogieDeclarations]: Found implementation of procedure l1l0 [2019-08-05 10:08:14,683 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 10:08:14,683 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 10:08:14,683 INFO L130 BoogieDeclarations]: Found specification of procedure l0l0 [2019-08-05 10:08:14,683 INFO L138 BoogieDeclarations]: Found implementation of procedure l0l0 [2019-08-05 10:08:14,684 INFO L130 BoogieDeclarations]: Found specification of procedure l1l1 [2019-08-05 10:08:14,684 INFO L138 BoogieDeclarations]: Found implementation of procedure l1l1 [2019-08-05 10:08:15,143 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 10:08:15,143 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 10:08:15,144 INFO L202 PluginConnector]: Adding new model threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:08:15 BoogieIcfgContainer [2019-08-05 10:08:15,145 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:08:15,146 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:08:15,146 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:08:15,149 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:08:15,149 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:08:14" (1/2) ... [2019-08-05 10:08:15,151 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fa37748 and model type threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:08:15, skipping insertion in model container [2019-08-05 10:08:15,151 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:08:15" (2/2) ... [2019-08-05 10:08:15,153 INFO L109 eAbstractionObserver]: Analyzing ICFG threadpooling_product_WithProcedures.bpl [2019-08-05 10:08:15,162 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:08:15,169 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-08-05 10:08:15,185 INFO L252 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-08-05 10:08:15,211 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:08:15,212 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:08:15,212 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:08:15,213 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:08:15,213 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:08:15,213 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:08:15,213 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:08:15,213 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:08:15,214 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:08:15,230 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states. [2019-08-05 10:08:15,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:08:15,240 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:08:15,241 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:08:15,244 INFO L418 AbstractCegarLoop]: === Iteration 1 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:08:15,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:08:15,250 INFO L82 PathProgramCache]: Analyzing trace with hash 441427311, now seen corresponding path program 1 times [2019-08-05 10:08:15,296 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:08:15,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:08:15,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:08:15,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:08:15,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:08:15,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:08:15,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:08:15,589 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:08:15,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:08:15,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:08:15,604 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 5 states. [2019-08-05 10:08:16,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:08:16,525 INFO L93 Difference]: Finished difference Result 86 states and 122 transitions. [2019-08-05 10:08:16,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:08:16,527 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-08-05 10:08:16,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:08:16,536 INFO L225 Difference]: With dead ends: 86 [2019-08-05 10:08:16,537 INFO L226 Difference]: Without dead ends: 86 [2019-08-05 10:08:16,540 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:08:16,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-08-05 10:08:16,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 52. [2019-08-05 10:08:16,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:08:16,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 71 transitions. [2019-08-05 10:08:16,581 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 71 transitions. Word has length 7 [2019-08-05 10:08:16,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:08:16,582 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 71 transitions. [2019-08-05 10:08:16,582 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:08:16,582 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2019-08-05 10:08:16,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:08:16,583 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:08:16,584 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:08:16,584 INFO L418 AbstractCegarLoop]: === Iteration 2 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:08:16,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:08:16,585 INFO L82 PathProgramCache]: Analyzing trace with hash 450963827, now seen corresponding path program 1 times [2019-08-05 10:08:16,586 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:08:16,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:08:16,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:08:16,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:08:16,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:08:16,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:08:16,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:08:16,904 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:08:16,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:08:16,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:08:16,905 INFO L87 Difference]: Start difference. First operand 52 states and 71 transitions. Second operand 5 states. [2019-08-05 10:08:17,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:08:17,480 INFO L93 Difference]: Finished difference Result 99 states and 141 transitions. [2019-08-05 10:08:17,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:08:17,483 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-08-05 10:08:17,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:08:17,485 INFO L225 Difference]: With dead ends: 99 [2019-08-05 10:08:17,485 INFO L226 Difference]: Without dead ends: 99 [2019-08-05 10:08:17,486 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:08:17,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-08-05 10:08:17,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 65. [2019-08-05 10:08:17,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 10:08:17,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 90 transitions. [2019-08-05 10:08:17,497 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 90 transitions. Word has length 7 [2019-08-05 10:08:17,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:08:17,497 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 90 transitions. [2019-08-05 10:08:17,498 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:08:17,498 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 90 transitions. [2019-08-05 10:08:17,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:08:17,499 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:08:17,499 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:08:17,500 INFO L418 AbstractCegarLoop]: === Iteration 3 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:08:17,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:08:17,500 INFO L82 PathProgramCache]: Analyzing trace with hash -617229569, now seen corresponding path program 1 times [2019-08-05 10:08:17,501 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:08:17,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:08:17,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:08:17,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:08:17,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:08:17,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:08:17,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 10:08:17,740 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:08:17,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:08:17,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:08:17,741 INFO L87 Difference]: Start difference. First operand 65 states and 90 transitions. Second operand 6 states. [2019-08-05 10:08:18,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:08:18,543 INFO L93 Difference]: Finished difference Result 119 states and 169 transitions. [2019-08-05 10:08:18,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:08:18,545 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-08-05 10:08:18,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:08:18,547 INFO L225 Difference]: With dead ends: 119 [2019-08-05 10:08:18,547 INFO L226 Difference]: Without dead ends: 119 [2019-08-05 10:08:18,548 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:08:18,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-08-05 10:08:18,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 81. [2019-08-05 10:08:18,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 10:08:18,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 113 transitions. [2019-08-05 10:08:18,560 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 113 transitions. Word has length 10 [2019-08-05 10:08:18,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:08:18,560 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 113 transitions. [2019-08-05 10:08:18,561 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:08:18,561 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 113 transitions. [2019-08-05 10:08:18,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:08:18,562 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:08:18,562 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:08:18,563 INFO L418 AbstractCegarLoop]: === Iteration 4 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:08:18,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:08:18,563 INFO L82 PathProgramCache]: Analyzing trace with hash 2116843270, now seen corresponding path program 1 times [2019-08-05 10:08:18,564 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:08:18,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:08:18,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:08:18,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:08:18,668 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:08:18,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:08:18,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:08:18,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:08:18,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:08:18,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:08:18,670 INFO L87 Difference]: Start difference. First operand 81 states and 113 transitions. Second operand 4 states. [2019-08-05 10:08:18,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:08:18,814 INFO L93 Difference]: Finished difference Result 77 states and 104 transitions. [2019-08-05 10:08:18,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:08:18,817 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-08-05 10:08:18,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:08:18,818 INFO L225 Difference]: With dead ends: 77 [2019-08-05 10:08:18,818 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 10:08:18,819 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:08:18,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 10:08:18,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-08-05 10:08:18,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 10:08:18,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 104 transitions. [2019-08-05 10:08:18,827 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 104 transitions. Word has length 10 [2019-08-05 10:08:18,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:08:18,827 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 104 transitions. [2019-08-05 10:08:18,827 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:08:18,827 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 104 transitions. [2019-08-05 10:08:18,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:08:18,828 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:08:18,829 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:08:18,829 INFO L418 AbstractCegarLoop]: === Iteration 5 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:08:18,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:08:18,829 INFO L82 PathProgramCache]: Analyzing trace with hash -3707729, now seen corresponding path program 1 times [2019-08-05 10:08:18,830 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:08:18,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:08:18,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:08:18,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:08:19,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:08:19,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:08:19,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 10:08:19,088 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:08:19,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:08:19,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:08:19,089 INFO L87 Difference]: Start difference. First operand 77 states and 104 transitions. Second operand 6 states. [2019-08-05 10:08:19,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:08:19,396 INFO L93 Difference]: Finished difference Result 129 states and 176 transitions. [2019-08-05 10:08:19,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:08:19,396 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-08-05 10:08:19,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:08:19,398 INFO L225 Difference]: With dead ends: 129 [2019-08-05 10:08:19,399 INFO L226 Difference]: Without dead ends: 129 [2019-08-05 10:08:19,399 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:08:19,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-08-05 10:08:19,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 94. [2019-08-05 10:08:19,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-08-05 10:08:19,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 126 transitions. [2019-08-05 10:08:19,408 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 126 transitions. Word has length 10 [2019-08-05 10:08:19,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:08:19,408 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 126 transitions. [2019-08-05 10:08:19,409 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:08:19,409 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 126 transitions. [2019-08-05 10:08:19,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:08:19,412 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:08:19,412 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:08:19,413 INFO L418 AbstractCegarLoop]: === Iteration 6 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:08:19,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:08:19,413 INFO L82 PathProgramCache]: Analyzing trace with hash -700443962, now seen corresponding path program 1 times [2019-08-05 10:08:19,414 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:08:19,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:08:19,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 10:08:19,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:08:19,808 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-05 10:08:19,808 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:08:19,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:08:19,808 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:08:19,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:08:19,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:08:19,809 INFO L87 Difference]: Start difference. First operand 94 states and 126 transitions. Second operand 7 states. [2019-08-05 10:08:20,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:08:20,388 INFO L93 Difference]: Finished difference Result 177 states and 245 transitions. [2019-08-05 10:08:20,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:08:20,391 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2019-08-05 10:08:20,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:08:20,392 INFO L225 Difference]: With dead ends: 177 [2019-08-05 10:08:20,392 INFO L226 Difference]: Without dead ends: 177 [2019-08-05 10:08:20,393 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:08:20,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-08-05 10:08:20,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 132. [2019-08-05 10:08:20,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-08-05 10:08:20,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 185 transitions. [2019-08-05 10:08:20,407 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 185 transitions. Word has length 14 [2019-08-05 10:08:20,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:08:20,407 INFO L475 AbstractCegarLoop]: Abstraction has 132 states and 185 transitions. [2019-08-05 10:08:20,408 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:08:20,408 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 185 transitions. [2019-08-05 10:08:20,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:08:20,409 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:08:20,409 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:08:20,410 INFO L418 AbstractCegarLoop]: === Iteration 7 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:08:20,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:08:20,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1055436978, now seen corresponding path program 1 times [2019-08-05 10:08:20,411 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:08:20,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:08:20,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 10:08:20,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:08:20,649 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-05 10:08:20,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:08:20,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:08:20,650 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:08:20,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:08:20,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:08:20,651 INFO L87 Difference]: Start difference. First operand 132 states and 185 transitions. Second operand 7 states. [2019-08-05 10:08:21,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:08:21,271 INFO L93 Difference]: Finished difference Result 225 states and 316 transitions. [2019-08-05 10:08:21,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:08:21,272 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2019-08-05 10:08:21,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:08:21,275 INFO L225 Difference]: With dead ends: 225 [2019-08-05 10:08:21,275 INFO L226 Difference]: Without dead ends: 225 [2019-08-05 10:08:21,276 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:08:21,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2019-08-05 10:08:21,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 159. [2019-08-05 10:08:21,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-08-05 10:08:21,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 224 transitions. [2019-08-05 10:08:21,297 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 224 transitions. Word has length 14 [2019-08-05 10:08:21,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:08:21,298 INFO L475 AbstractCegarLoop]: Abstraction has 159 states and 224 transitions. [2019-08-05 10:08:21,298 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:08:21,301 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 224 transitions. [2019-08-05 10:08:21,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:08:21,304 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:08:21,304 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:08:21,305 INFO L418 AbstractCegarLoop]: === Iteration 8 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:08:21,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:08:21,305 INFO L82 PathProgramCache]: Analyzing trace with hash -680785956, now seen corresponding path program 1 times [2019-08-05 10:08:21,308 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:08:21,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:08:21,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 10:08:21,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:08:21,529 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-05 10:08:21,529 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:08:21,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:08:21,530 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:08:21,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:08:21,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:08:21,531 INFO L87 Difference]: Start difference. First operand 159 states and 224 transitions. Second operand 7 states. [2019-08-05 10:08:22,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:08:22,119 INFO L93 Difference]: Finished difference Result 298 states and 420 transitions. [2019-08-05 10:08:22,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:08:22,120 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2019-08-05 10:08:22,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:08:22,122 INFO L225 Difference]: With dead ends: 298 [2019-08-05 10:08:22,122 INFO L226 Difference]: Without dead ends: 298 [2019-08-05 10:08:22,123 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:08:22,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-08-05 10:08:22,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 189. [2019-08-05 10:08:22,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-08-05 10:08:22,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 270 transitions. [2019-08-05 10:08:22,139 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 270 transitions. Word has length 14 [2019-08-05 10:08:22,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:08:22,139 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 270 transitions. [2019-08-05 10:08:22,139 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:08:22,140 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 270 transitions. [2019-08-05 10:08:22,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:08:22,141 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:08:22,141 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:08:22,141 INFO L418 AbstractCegarLoop]: === Iteration 9 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:08:22,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:08:22,142 INFO L82 PathProgramCache]: Analyzing trace with hash -718236170, now seen corresponding path program 1 times [2019-08-05 10:08:22,143 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:08:22,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:08:22,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 10:08:22,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:08:22,261 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-05 10:08:22,262 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:08:22,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:08:22,262 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:08:22,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:08:22,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:08:22,263 INFO L87 Difference]: Start difference. First operand 189 states and 270 transitions. Second operand 7 states. [2019-08-05 10:08:23,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:08:23,139 INFO L93 Difference]: Finished difference Result 431 states and 632 transitions. [2019-08-05 10:08:23,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:08:23,143 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2019-08-05 10:08:23,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:08:23,146 INFO L225 Difference]: With dead ends: 431 [2019-08-05 10:08:23,146 INFO L226 Difference]: Without dead ends: 431 [2019-08-05 10:08:23,147 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:08:23,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2019-08-05 10:08:23,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 288. [2019-08-05 10:08:23,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-08-05 10:08:23,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 422 transitions. [2019-08-05 10:08:23,159 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 422 transitions. Word has length 14 [2019-08-05 10:08:23,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:08:23,159 INFO L475 AbstractCegarLoop]: Abstraction has 288 states and 422 transitions. [2019-08-05 10:08:23,159 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:08:23,159 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 422 transitions. [2019-08-05 10:08:23,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:08:23,161 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:08:23,161 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:08:23,161 INFO L418 AbstractCegarLoop]: === Iteration 10 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:08:23,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:08:23,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1073229186, now seen corresponding path program 1 times [2019-08-05 10:08:23,162 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:08:23,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:08:23,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 10:08:23,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:08:23,316 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-05 10:08:23,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:08:23,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:08:23,317 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:08:23,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:08:23,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:08:23,318 INFO L87 Difference]: Start difference. First operand 288 states and 422 transitions. Second operand 7 states. [2019-08-05 10:08:23,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:08:23,927 INFO L93 Difference]: Finished difference Result 546 states and 804 transitions. [2019-08-05 10:08:23,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:08:23,928 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2019-08-05 10:08:23,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:08:23,931 INFO L225 Difference]: With dead ends: 546 [2019-08-05 10:08:23,931 INFO L226 Difference]: Without dead ends: 546 [2019-08-05 10:08:23,932 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:08:23,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2019-08-05 10:08:23,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 342. [2019-08-05 10:08:23,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2019-08-05 10:08:23,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 503 transitions. [2019-08-05 10:08:23,944 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 503 transitions. Word has length 14 [2019-08-05 10:08:23,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:08:23,945 INFO L475 AbstractCegarLoop]: Abstraction has 342 states and 503 transitions. [2019-08-05 10:08:23,945 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:08:23,945 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 503 transitions. [2019-08-05 10:08:23,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:08:23,946 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:08:23,946 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:08:23,946 INFO L418 AbstractCegarLoop]: === Iteration 11 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:08:23,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:08:23,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1801721143, now seen corresponding path program 1 times [2019-08-05 10:08:23,948 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:08:23,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:08:23,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 10:08:23,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:08:24,060 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-05 10:08:24,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:08:24,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:08:24,061 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:08:24,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:08:24,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:08:24,062 INFO L87 Difference]: Start difference. First operand 342 states and 503 transitions. Second operand 7 states. [2019-08-05 10:08:25,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:08:25,503 INFO L93 Difference]: Finished difference Result 789 states and 1158 transitions. [2019-08-05 10:08:25,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:08:25,504 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2019-08-05 10:08:25,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:08:25,508 INFO L225 Difference]: With dead ends: 789 [2019-08-05 10:08:25,508 INFO L226 Difference]: Without dead ends: 789 [2019-08-05 10:08:25,509 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:08:25,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2019-08-05 10:08:25,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 495. [2019-08-05 10:08:25,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2019-08-05 10:08:25,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 734 transitions. [2019-08-05 10:08:25,527 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 734 transitions. Word has length 14 [2019-08-05 10:08:25,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:08:25,527 INFO L475 AbstractCegarLoop]: Abstraction has 495 states and 734 transitions. [2019-08-05 10:08:25,527 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:08:25,527 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 734 transitions. [2019-08-05 10:08:25,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:08:25,529 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:08:25,529 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:08:25,531 INFO L418 AbstractCegarLoop]: === Iteration 12 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:08:25,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:08:25,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1090415723, now seen corresponding path program 1 times [2019-08-05 10:08:25,532 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:08:25,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:08:25,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 10:08:25,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:08:25,787 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:08:25,787 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:08:25,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:08:25,787 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:08:25,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:08:25,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:08:25,788 INFO L87 Difference]: Start difference. First operand 495 states and 734 transitions. Second operand 7 states. [2019-08-05 10:08:27,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:08:27,894 INFO L93 Difference]: Finished difference Result 1041 states and 1552 transitions. [2019-08-05 10:08:27,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:08:27,896 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-08-05 10:08:27,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:08:27,901 INFO L225 Difference]: With dead ends: 1041 [2019-08-05 10:08:27,902 INFO L226 Difference]: Without dead ends: 1041 [2019-08-05 10:08:27,902 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 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-05 10:08:27,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states. [2019-08-05 10:08:27,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 693. [2019-08-05 10:08:27,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 693 states. [2019-08-05 10:08:27,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 1050 transitions. [2019-08-05 10:08:27,939 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 1050 transitions. Word has length 18 [2019-08-05 10:08:27,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:08:27,940 INFO L475 AbstractCegarLoop]: Abstraction has 693 states and 1050 transitions. [2019-08-05 10:08:27,940 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:08:27,940 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 1050 transitions. [2019-08-05 10:08:27,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:08:27,947 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:08:27,947 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:08:27,948 INFO L418 AbstractCegarLoop]: === Iteration 13 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:08:27,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:08:27,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1151545451, now seen corresponding path program 2 times [2019-08-05 10:08:27,949 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:08:27,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:08:27,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 10:08:27,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:08:28,380 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:08:28,381 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:08:28,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:08:28,381 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:08:28,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:08:28,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:08:28,382 INFO L87 Difference]: Start difference. First operand 693 states and 1050 transitions. Second operand 7 states. [2019-08-05 10:08:29,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:08:29,153 INFO L93 Difference]: Finished difference Result 996 states and 1494 transitions. [2019-08-05 10:08:29,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:08:29,153 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-08-05 10:08:29,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:08:29,159 INFO L225 Difference]: With dead ends: 996 [2019-08-05 10:08:29,159 INFO L226 Difference]: Without dead ends: 996 [2019-08-05 10:08:29,160 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 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-05 10:08:29,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 996 states. [2019-08-05 10:08:29,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 996 to 717. [2019-08-05 10:08:29,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 717 states. [2019-08-05 10:08:29,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 1088 transitions. [2019-08-05 10:08:29,182 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 1088 transitions. Word has length 18 [2019-08-05 10:08:29,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:08:29,182 INFO L475 AbstractCegarLoop]: Abstraction has 717 states and 1088 transitions. [2019-08-05 10:08:29,183 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:08:29,183 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 1088 transitions. [2019-08-05 10:08:29,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:08:29,184 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:08:29,184 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:08:29,185 INFO L418 AbstractCegarLoop]: === Iteration 14 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:08:29,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:08:29,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1506538467, now seen corresponding path program 2 times [2019-08-05 10:08:29,186 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:08:29,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:08:29,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 10:08:29,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:08:29,321 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:08:29,321 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:08:29,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:08:29,322 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:08:29,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:08:29,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:08:29,323 INFO L87 Difference]: Start difference. First operand 717 states and 1088 transitions. Second operand 7 states. [2019-08-05 10:08:30,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:08:30,110 INFO L93 Difference]: Finished difference Result 1044 states and 1565 transitions. [2019-08-05 10:08:30,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:08:30,111 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-08-05 10:08:30,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:08:30,117 INFO L225 Difference]: With dead ends: 1044 [2019-08-05 10:08:30,117 INFO L226 Difference]: Without dead ends: 1044 [2019-08-05 10:08:30,117 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 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-05 10:08:30,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1044 states. [2019-08-05 10:08:30,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1044 to 783. [2019-08-05 10:08:30,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2019-08-05 10:08:30,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1186 transitions. [2019-08-05 10:08:30,156 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1186 transitions. Word has length 18 [2019-08-05 10:08:30,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:08:30,156 INFO L475 AbstractCegarLoop]: Abstraction has 783 states and 1186 transitions. [2019-08-05 10:08:30,157 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:08:30,157 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1186 transitions. [2019-08-05 10:08:30,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:08:30,158 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:08:30,158 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:08:30,158 INFO L418 AbstractCegarLoop]: === Iteration 15 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:08:30,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:08:30,159 INFO L82 PathProgramCache]: Analyzing trace with hash -594057576, now seen corresponding path program 1 times [2019-08-05 10:08:30,160 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:08:30,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:08:30,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 10:08:30,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:08:30,269 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-05 10:08:30,269 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:08:30,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:08:30,270 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:08:30,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:08:30,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:08:30,271 INFO L87 Difference]: Start difference. First operand 783 states and 1186 transitions. Second operand 7 states. [2019-08-05 10:08:30,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:08:30,675 INFO L93 Difference]: Finished difference Result 1030 states and 1540 transitions. [2019-08-05 10:08:30,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:08:30,676 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-08-05 10:08:30,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:08:30,680 INFO L225 Difference]: With dead ends: 1030 [2019-08-05 10:08:30,680 INFO L226 Difference]: Without dead ends: 1030 [2019-08-05 10:08:30,681 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 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-05 10:08:30,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1030 states. [2019-08-05 10:08:30,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1030 to 755. [2019-08-05 10:08:30,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 755 states. [2019-08-05 10:08:30,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 1140 transitions. [2019-08-05 10:08:30,704 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 1140 transitions. Word has length 18 [2019-08-05 10:08:30,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:08:30,704 INFO L475 AbstractCegarLoop]: Abstraction has 755 states and 1140 transitions. [2019-08-05 10:08:30,705 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:08:30,705 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 1140 transitions. [2019-08-05 10:08:30,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:08:30,706 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:08:30,706 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:08:30,707 INFO L418 AbstractCegarLoop]: === Iteration 16 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:08:30,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:08:30,707 INFO L82 PathProgramCache]: Analyzing trace with hash -949050592, now seen corresponding path program 1 times [2019-08-05 10:08:30,708 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:08:30,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:08:30,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 10:08:30,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:08:30,857 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-05 10:08:30,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:08:30,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:08:30,858 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:08:30,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:08:30,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:08:30,859 INFO L87 Difference]: Start difference. First operand 755 states and 1140 transitions. Second operand 7 states. [2019-08-05 10:08:31,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:08:31,324 INFO L93 Difference]: Finished difference Result 1116 states and 1666 transitions. [2019-08-05 10:08:31,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:08:31,324 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-08-05 10:08:31,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:08:31,330 INFO L225 Difference]: With dead ends: 1116 [2019-08-05 10:08:31,330 INFO L226 Difference]: Without dead ends: 1116 [2019-08-05 10:08:31,331 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:08:31,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2019-08-05 10:08:31,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 713. [2019-08-05 10:08:31,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 713 states. [2019-08-05 10:08:31,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 1072 transitions. [2019-08-05 10:08:31,352 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 1072 transitions. Word has length 18 [2019-08-05 10:08:31,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:08:31,352 INFO L475 AbstractCegarLoop]: Abstraction has 713 states and 1072 transitions. [2019-08-05 10:08:31,352 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:08:31,353 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 1072 transitions. [2019-08-05 10:08:31,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:08:31,354 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:08:31,354 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:08:31,355 INFO L418 AbstractCegarLoop]: === Iteration 17 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:08:31,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:08:31,355 INFO L82 PathProgramCache]: Analyzing trace with hash -574399570, now seen corresponding path program 1 times [2019-08-05 10:08:31,356 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:08:31,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:08:31,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 10:08:31,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:08:31,805 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:08:31,806 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:08:31,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:08:31,806 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:08:31,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:08:31,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:08:31,807 INFO L87 Difference]: Start difference. First operand 713 states and 1072 transitions. Second operand 7 states. [2019-08-05 10:08:32,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:08:32,302 INFO L93 Difference]: Finished difference Result 1003 states and 1496 transitions. [2019-08-05 10:08:32,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:08:32,302 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-08-05 10:08:32,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:08:32,308 INFO L225 Difference]: With dead ends: 1003 [2019-08-05 10:08:32,309 INFO L226 Difference]: Without dead ends: 1003 [2019-08-05 10:08:32,309 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:08:32,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2019-08-05 10:08:32,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 711. [2019-08-05 10:08:32,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 711 states. [2019-08-05 10:08:32,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 1064 transitions. [2019-08-05 10:08:32,329 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 1064 transitions. Word has length 18 [2019-08-05 10:08:32,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:08:32,329 INFO L475 AbstractCegarLoop]: Abstraction has 711 states and 1064 transitions. [2019-08-05 10:08:32,329 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:08:32,329 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 1064 transitions. [2019-08-05 10:08:32,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:08:32,331 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:08:32,331 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:08:32,331 INFO L418 AbstractCegarLoop]: === Iteration 18 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:08:32,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:08:32,332 INFO L82 PathProgramCache]: Analyzing trace with hash 331727805, now seen corresponding path program 2 times [2019-08-05 10:08:32,332 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:08:32,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:08:32,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 10:08:32,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:08:32,728 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:08:32,729 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:08:32,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:08:32,730 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:08:32,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:08:32,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:08:32,731 INFO L87 Difference]: Start difference. First operand 711 states and 1064 transitions. Second operand 7 states. [2019-08-05 10:08:33,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:08:33,332 INFO L93 Difference]: Finished difference Result 1008 states and 1498 transitions. [2019-08-05 10:08:33,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:08:33,332 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-08-05 10:08:33,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:08:33,336 INFO L225 Difference]: With dead ends: 1008 [2019-08-05 10:08:33,336 INFO L226 Difference]: Without dead ends: 1008 [2019-08-05 10:08:33,337 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:08:33,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1008 states. [2019-08-05 10:08:33,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1008 to 701. [2019-08-05 10:08:33,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 701 states. [2019-08-05 10:08:33,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 1048 transitions. [2019-08-05 10:08:33,354 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 1048 transitions. Word has length 18 [2019-08-05 10:08:33,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:08:33,354 INFO L475 AbstractCegarLoop]: Abstraction has 701 states and 1048 transitions. [2019-08-05 10:08:33,354 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:08:33,354 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 1048 transitions. [2019-08-05 10:08:33,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:08:33,356 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:08:33,356 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:08:33,356 INFO L418 AbstractCegarLoop]: === Iteration 19 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:08:33,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:08:33,357 INFO L82 PathProgramCache]: Analyzing trace with hash -23265211, now seen corresponding path program 1 times [2019-08-05 10:08:33,357 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:08:33,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:08:33,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 10:08:33,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:08:33,470 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:08:33,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:08:33,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:08:33,471 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:08:33,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:08:33,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:08:33,472 INFO L87 Difference]: Start difference. First operand 701 states and 1048 transitions. Second operand 7 states. [2019-08-05 10:08:33,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:08:33,982 INFO L93 Difference]: Finished difference Result 935 states and 1385 transitions. [2019-08-05 10:08:33,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:08:33,990 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-08-05 10:08:33,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:08:33,995 INFO L225 Difference]: With dead ends: 935 [2019-08-05 10:08:33,995 INFO L226 Difference]: Without dead ends: 935 [2019-08-05 10:08:33,995 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 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-05 10:08:33,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2019-08-05 10:08:34,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 742. [2019-08-05 10:08:34,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 742 states. [2019-08-05 10:08:34,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 1108 transitions. [2019-08-05 10:08:34,011 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 1108 transitions. Word has length 18 [2019-08-05 10:08:34,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:08:34,012 INFO L475 AbstractCegarLoop]: Abstraction has 742 states and 1108 transitions. [2019-08-05 10:08:34,012 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:08:34,012 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 1108 transitions. [2019-08-05 10:08:34,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:08:34,013 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:08:34,013 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:08:34,014 INFO L418 AbstractCegarLoop]: === Iteration 20 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:08:34,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:08:34,014 INFO L82 PathProgramCache]: Analyzing trace with hash -84394939, now seen corresponding path program 2 times [2019-08-05 10:08:34,015 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:08:34,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:08:34,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 10:08:34,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:08:34,172 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:08:34,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:08:34,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:08:34,173 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:08:34,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:08:34,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:08:34,173 INFO L87 Difference]: Start difference. First operand 742 states and 1108 transitions. Second operand 7 states. [2019-08-05 10:08:35,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:08:35,180 INFO L93 Difference]: Finished difference Result 1002 states and 1473 transitions. [2019-08-05 10:08:35,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:08:35,183 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-08-05 10:08:35,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:08:35,187 INFO L225 Difference]: With dead ends: 1002 [2019-08-05 10:08:35,187 INFO L226 Difference]: Without dead ends: 1002 [2019-08-05 10:08:35,187 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:08:35,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002 states. [2019-08-05 10:08:35,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002 to 804. [2019-08-05 10:08:35,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2019-08-05 10:08:35,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1196 transitions. [2019-08-05 10:08:35,203 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1196 transitions. Word has length 18 [2019-08-05 10:08:35,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:08:35,204 INFO L475 AbstractCegarLoop]: Abstraction has 804 states and 1196 transitions. [2019-08-05 10:08:35,204 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:08:35,204 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1196 transitions. [2019-08-05 10:08:35,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:08:35,205 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:08:35,205 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:08:35,206 INFO L418 AbstractCegarLoop]: === Iteration 21 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:08:35,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:08:35,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1150088966, now seen corresponding path program 1 times [2019-08-05 10:08:35,207 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:08:35,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:08:35,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 10:08:35,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:08:35,333 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-05 10:08:35,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:08:35,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:08:35,334 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:08:35,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:08:35,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:08:35,335 INFO L87 Difference]: Start difference. First operand 804 states and 1196 transitions. Second operand 7 states. [2019-08-05 10:08:36,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:08:36,229 INFO L93 Difference]: Finished difference Result 1007 states and 1494 transitions. [2019-08-05 10:08:36,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:08:36,229 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-08-05 10:08:36,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:08:36,233 INFO L225 Difference]: With dead ends: 1007 [2019-08-05 10:08:36,233 INFO L226 Difference]: Without dead ends: 1007 [2019-08-05 10:08:36,234 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:08:36,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1007 states. [2019-08-05 10:08:36,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1007 to 767. [2019-08-05 10:08:36,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 767 states. [2019-08-05 10:08:36,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 1138 transitions. [2019-08-05 10:08:36,248 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 1138 transitions. Word has length 18 [2019-08-05 10:08:36,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:08:36,248 INFO L475 AbstractCegarLoop]: Abstraction has 767 states and 1138 transitions. [2019-08-05 10:08:36,248 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:08:36,249 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 1138 transitions. [2019-08-05 10:08:36,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:08:36,250 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:08:36,250 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:08:36,250 INFO L418 AbstractCegarLoop]: === Iteration 22 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:08:36,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:08:36,251 INFO L82 PathProgramCache]: Analyzing trace with hash -269928001, now seen corresponding path program 2 times [2019-08-05 10:08:36,251 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:08:36,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:08:36,269 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 10:08:36,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:08:36,397 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:08:36,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:08:36,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:08:36,398 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:08:36,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:08:36,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:08:36,399 INFO L87 Difference]: Start difference. First operand 767 states and 1138 transitions. Second operand 7 states. [2019-08-05 10:08:36,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:08:36,861 INFO L93 Difference]: Finished difference Result 1093 states and 1618 transitions. [2019-08-05 10:08:36,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:08:36,863 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-08-05 10:08:36,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:08:36,867 INFO L225 Difference]: With dead ends: 1093 [2019-08-05 10:08:36,867 INFO L226 Difference]: Without dead ends: 1093 [2019-08-05 10:08:36,867 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 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-05 10:08:36,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1093 states. [2019-08-05 10:08:36,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1093 to 785. [2019-08-05 10:08:36,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2019-08-05 10:08:36,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 1162 transitions. [2019-08-05 10:08:36,885 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 1162 transitions. Word has length 18 [2019-08-05 10:08:36,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:08:36,885 INFO L475 AbstractCegarLoop]: Abstraction has 785 states and 1162 transitions. [2019-08-05 10:08:36,885 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:08:36,885 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 1162 transitions. [2019-08-05 10:08:36,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:08:36,887 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:08:36,887 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:08:36,888 INFO L418 AbstractCegarLoop]: === Iteration 23 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:08:36,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:08:36,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1192962470, now seen corresponding path program 1 times [2019-08-05 10:08:36,889 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:08:36,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:08:36,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:08:36,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:08:37,046 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:08:37,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:08:37,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:08:37,047 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:08:37,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:08:37,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:08:37,048 INFO L87 Difference]: Start difference. First operand 785 states and 1162 transitions. Second operand 4 states. [2019-08-05 10:08:37,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:08:37,095 INFO L93 Difference]: Finished difference Result 719 states and 1028 transitions. [2019-08-05 10:08:37,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:08:37,096 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-08-05 10:08:37,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:08:37,098 INFO L225 Difference]: With dead ends: 719 [2019-08-05 10:08:37,098 INFO L226 Difference]: Without dead ends: 719 [2019-08-05 10:08:37,098 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:08:37,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2019-08-05 10:08:37,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 719. [2019-08-05 10:08:37,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 719 states. [2019-08-05 10:08:37,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 1028 transitions. [2019-08-05 10:08:37,111 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 1028 transitions. Word has length 21 [2019-08-05 10:08:37,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:08:37,111 INFO L475 AbstractCegarLoop]: Abstraction has 719 states and 1028 transitions. [2019-08-05 10:08:37,111 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:08:37,111 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 1028 transitions. [2019-08-05 10:08:37,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:08:37,113 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:08:37,113 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:08:37,113 INFO L418 AbstractCegarLoop]: === Iteration 24 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:08:37,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:08:37,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1410780444, now seen corresponding path program 1 times [2019-08-05 10:08:37,114 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:08:37,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:08:37,151 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 10:08:37,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:08:37,303 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:08:37,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:08:37,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:08:37,304 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:08:37,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:08:37,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:08:37,305 INFO L87 Difference]: Start difference. First operand 719 states and 1028 transitions. Second operand 10 states. [2019-08-05 10:08:38,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:08:38,235 INFO L93 Difference]: Finished difference Result 1055 states and 1506 transitions. [2019-08-05 10:08:38,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:08:38,236 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2019-08-05 10:08:38,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:08:38,240 INFO L225 Difference]: With dead ends: 1055 [2019-08-05 10:08:38,240 INFO L226 Difference]: Without dead ends: 1055 [2019-08-05 10:08:38,241 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=195, Invalid=455, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:08:38,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1055 states. [2019-08-05 10:08:38,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1055 to 509. [2019-08-05 10:08:38,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 509 states. [2019-08-05 10:08:38,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 735 transitions. [2019-08-05 10:08:38,253 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 735 transitions. Word has length 21 [2019-08-05 10:08:38,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:08:38,253 INFO L475 AbstractCegarLoop]: Abstraction has 509 states and 735 transitions. [2019-08-05 10:08:38,253 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:08:38,253 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 735 transitions. [2019-08-05 10:08:38,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:08:38,255 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:08:38,255 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:08:38,255 INFO L418 AbstractCegarLoop]: === Iteration 25 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:08:38,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:08:38,256 INFO L82 PathProgramCache]: Analyzing trace with hash 517147244, now seen corresponding path program 1 times [2019-08-05 10:08:38,256 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:08:38,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:08:38,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 10:08:38,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:08:39,127 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-05 10:08:39,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:08:39,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:08:39,128 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:08:39,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:08:39,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:08:39,129 INFO L87 Difference]: Start difference. First operand 509 states and 735 transitions. Second operand 9 states. [2019-08-05 10:08:40,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:08:40,382 INFO L93 Difference]: Finished difference Result 753 states and 1073 transitions. [2019-08-05 10:08:40,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:08:40,383 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-08-05 10:08:40,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:08:40,387 INFO L225 Difference]: With dead ends: 753 [2019-08-05 10:08:40,387 INFO L226 Difference]: Without dead ends: 753 [2019-08-05 10:08:40,388 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:08:40,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2019-08-05 10:08:40,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 565. [2019-08-05 10:08:40,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 565 states. [2019-08-05 10:08:40,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 822 transitions. [2019-08-05 10:08:40,400 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 822 transitions. Word has length 21 [2019-08-05 10:08:40,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:08:40,401 INFO L475 AbstractCegarLoop]: Abstraction has 565 states and 822 transitions. [2019-08-05 10:08:40,401 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:08:40,401 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 822 transitions. [2019-08-05 10:08:40,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:08:40,402 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:08:40,403 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:08:40,403 INFO L418 AbstractCegarLoop]: === Iteration 26 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:08:40,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:08:40,403 INFO L82 PathProgramCache]: Analyzing trace with hash 939989868, now seen corresponding path program 1 times [2019-08-05 10:08:40,404 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:08:40,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:08:40,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 10:08:40,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:08:40,865 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:08:40,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:08:40,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:08:40,865 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:08:40,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:08:40,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:08:40,866 INFO L87 Difference]: Start difference. First operand 565 states and 822 transitions. Second operand 9 states. [2019-08-05 10:08:41,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:08:41,398 INFO L93 Difference]: Finished difference Result 723 states and 1046 transitions. [2019-08-05 10:08:41,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:08:41,399 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-08-05 10:08:41,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:08:41,402 INFO L225 Difference]: With dead ends: 723 [2019-08-05 10:08:41,402 INFO L226 Difference]: Without dead ends: 723 [2019-08-05 10:08:41,403 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=129, Invalid=251, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:08:41,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2019-08-05 10:08:41,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 392. [2019-08-05 10:08:41,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2019-08-05 10:08:41,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 575 transitions. [2019-08-05 10:08:41,411 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 575 transitions. Word has length 21 [2019-08-05 10:08:41,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:08:41,412 INFO L475 AbstractCegarLoop]: Abstraction has 392 states and 575 transitions. [2019-08-05 10:08:41,412 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:08:41,412 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 575 transitions. [2019-08-05 10:08:41,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:08:41,413 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:08:41,414 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:08:41,414 INFO L418 AbstractCegarLoop]: === Iteration 27 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:08:41,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:08:41,414 INFO L82 PathProgramCache]: Analyzing trace with hash 521348607, now seen corresponding path program 1 times [2019-08-05 10:08:41,415 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:08:41,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:08:41,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 10:08:41,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:08:41,760 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:08:41,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:08:41,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:08:41,761 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:08:41,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:08:41,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:08:41,762 INFO L87 Difference]: Start difference. First operand 392 states and 575 transitions. Second operand 9 states. [2019-08-05 10:08:42,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:08:42,397 INFO L93 Difference]: Finished difference Result 479 states and 691 transitions. [2019-08-05 10:08:42,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:08:42,400 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-08-05 10:08:42,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:08:42,403 INFO L225 Difference]: With dead ends: 479 [2019-08-05 10:08:42,403 INFO L226 Difference]: Without dead ends: 479 [2019-08-05 10:08:42,404 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:08:42,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2019-08-05 10:08:42,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 379. [2019-08-05 10:08:42,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2019-08-05 10:08:42,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 557 transitions. [2019-08-05 10:08:42,412 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 557 transitions. Word has length 25 [2019-08-05 10:08:42,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:08:42,413 INFO L475 AbstractCegarLoop]: Abstraction has 379 states and 557 transitions. [2019-08-05 10:08:42,413 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:08:42,413 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 557 transitions. [2019-08-05 10:08:42,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:08:42,415 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:08:42,415 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:08:42,415 INFO L418 AbstractCegarLoop]: === Iteration 28 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:08:42,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:08:42,416 INFO L82 PathProgramCache]: Analyzing trace with hash 460218879, now seen corresponding path program 2 times [2019-08-05 10:08:42,416 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:08:42,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:08:42,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 10:08:42,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:08:42,610 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:08:42,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:08:42,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:08:42,611 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:08:42,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:08:42,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:08:42,611 INFO L87 Difference]: Start difference. First operand 379 states and 557 transitions. Second operand 9 states. [2019-08-05 10:08:43,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:08:43,236 INFO L93 Difference]: Finished difference Result 469 states and 676 transitions. [2019-08-05 10:08:43,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:08:43,237 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-08-05 10:08:43,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:08:43,240 INFO L225 Difference]: With dead ends: 469 [2019-08-05 10:08:43,240 INFO L226 Difference]: Without dead ends: 469 [2019-08-05 10:08:43,240 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=251, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:08:43,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2019-08-05 10:08:43,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 377. [2019-08-05 10:08:43,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-08-05 10:08:43,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 554 transitions. [2019-08-05 10:08:43,247 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 554 transitions. Word has length 25 [2019-08-05 10:08:43,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:08:43,247 INFO L475 AbstractCegarLoop]: Abstraction has 377 states and 554 transitions. [2019-08-05 10:08:43,247 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:08:43,247 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 554 transitions. [2019-08-05 10:08:43,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:08:43,249 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:08:43,249 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:08:43,249 INFO L418 AbstractCegarLoop]: === Iteration 29 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:08:43,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:08:43,249 INFO L82 PathProgramCache]: Analyzing trace with hash 105225863, now seen corresponding path program 1 times [2019-08-05 10:08:43,250 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:08:43,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:08:43,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 10:08:43,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:08:44,084 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:08:44,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:08:44,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:08:44,085 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:08:44,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:08:44,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:08:44,085 INFO L87 Difference]: Start difference. First operand 377 states and 554 transitions. Second operand 9 states. [2019-08-05 10:08:44,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:08:44,919 INFO L93 Difference]: Finished difference Result 488 states and 703 transitions. [2019-08-05 10:08:44,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:08:44,920 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-08-05 10:08:44,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:08:44,922 INFO L225 Difference]: With dead ends: 488 [2019-08-05 10:08:44,923 INFO L226 Difference]: Without dead ends: 488 [2019-08-05 10:08:44,923 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=133, Invalid=287, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:08:44,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2019-08-05 10:08:44,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 358. [2019-08-05 10:08:44,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2019-08-05 10:08:44,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 527 transitions. [2019-08-05 10:08:44,929 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 527 transitions. Word has length 25 [2019-08-05 10:08:44,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:08:44,930 INFO L475 AbstractCegarLoop]: Abstraction has 358 states and 527 transitions. [2019-08-05 10:08:44,930 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:08:44,930 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 527 transitions. [2019-08-05 10:08:44,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:08:44,931 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:08:44,931 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:08:44,932 INFO L418 AbstractCegarLoop]: === Iteration 30 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:08:44,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:08:44,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1017706754, now seen corresponding path program 1 times [2019-08-05 10:08:44,933 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:08:44,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:08:45,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 10:08:45,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:08:45,312 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:08:45,312 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:08:45,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:08:45,313 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:08:45,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:08:45,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:08:45,313 INFO L87 Difference]: Start difference. First operand 358 states and 527 transitions. Second operand 9 states. [2019-08-05 10:08:45,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:08:45,836 INFO L93 Difference]: Finished difference Result 437 states and 631 transitions. [2019-08-05 10:08:45,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:08:45,837 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-08-05 10:08:45,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:08:45,839 INFO L225 Difference]: With dead ends: 437 [2019-08-05 10:08:45,839 INFO L226 Difference]: Without dead ends: 437 [2019-08-05 10:08:45,840 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:08:45,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2019-08-05 10:08:45,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 374. [2019-08-05 10:08:45,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2019-08-05 10:08:45,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 551 transitions. [2019-08-05 10:08:45,845 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 551 transitions. Word has length 25 [2019-08-05 10:08:45,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:08:45,845 INFO L475 AbstractCegarLoop]: Abstraction has 374 states and 551 transitions. [2019-08-05 10:08:45,845 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:08:45,846 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 551 transitions. [2019-08-05 10:08:45,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:08:45,847 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:08:45,847 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:08:45,847 INFO L418 AbstractCegarLoop]: === Iteration 31 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:08:45,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:08:45,848 INFO L82 PathProgramCache]: Analyzing trace with hash 662713738, now seen corresponding path program 1 times [2019-08-05 10:08:45,848 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:08:45,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:08:45,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-05 10:08:45,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:08:46,811 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-05 10:08:46,812 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:08:46,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:08:46,812 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:08:46,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:08:46,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:08:46,813 INFO L87 Difference]: Start difference. First operand 374 states and 551 transitions. Second operand 12 states. [2019-08-05 10:08:48,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:08:48,065 INFO L93 Difference]: Finished difference Result 549 states and 794 transitions. [2019-08-05 10:08:48,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:08:48,066 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2019-08-05 10:08:48,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:08:48,069 INFO L225 Difference]: With dead ends: 549 [2019-08-05 10:08:48,069 INFO L226 Difference]: Without dead ends: 549 [2019-08-05 10:08:48,070 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:08:48,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2019-08-05 10:08:48,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 433. [2019-08-05 10:08:48,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2019-08-05 10:08:48,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 637 transitions. [2019-08-05 10:08:48,076 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 637 transitions. Word has length 25 [2019-08-05 10:08:48,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:08:48,076 INFO L475 AbstractCegarLoop]: Abstraction has 433 states and 637 transitions. [2019-08-05 10:08:48,076 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:08:48,076 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 637 transitions. [2019-08-05 10:08:48,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:08:48,078 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:08:48,078 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:08:48,078 INFO L418 AbstractCegarLoop]: === Iteration 32 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:08:48,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:08:48,078 INFO L82 PathProgramCache]: Analyzing trace with hash 662802633, now seen corresponding path program 1 times [2019-08-05 10:08:48,079 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:08:48,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:08:48,151 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 72 conjunts are in the unsatisfiable core [2019-08-05 10:08:48,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:08:48,378 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:08:48,379 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:08:48,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:08:48,379 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:08:48,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:08:48,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:08:48,380 INFO L87 Difference]: Start difference. First operand 433 states and 637 transitions. Second operand 8 states. [2019-08-05 10:08:49,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:08:49,892 INFO L93 Difference]: Finished difference Result 519 states and 748 transitions. [2019-08-05 10:08:49,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:08:49,893 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2019-08-05 10:08:49,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:08:49,896 INFO L225 Difference]: With dead ends: 519 [2019-08-05 10:08:49,896 INFO L226 Difference]: Without dead ends: 519 [2019-08-05 10:08:49,896 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:08:49,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2019-08-05 10:08:49,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 442. [2019-08-05 10:08:49,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2019-08-05 10:08:49,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 649 transitions. [2019-08-05 10:08:49,903 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 649 transitions. Word has length 25 [2019-08-05 10:08:49,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:08:49,903 INFO L475 AbstractCegarLoop]: Abstraction has 442 states and 649 transitions. [2019-08-05 10:08:49,903 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:08:49,903 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 649 transitions. [2019-08-05 10:08:49,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:08:49,906 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:08:49,906 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:08:49,906 INFO L418 AbstractCegarLoop]: === Iteration 33 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:08:49,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:08:49,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1037364760, now seen corresponding path program 1 times [2019-08-05 10:08:49,907 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:08:49,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:08:49,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-05 10:08:49,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:08:50,105 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:08:50,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:08:50,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:08:50,106 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:08:50,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:08:50,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:08:50,106 INFO L87 Difference]: Start difference. First operand 442 states and 649 transitions. Second operand 10 states. [2019-08-05 10:08:50,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:08:50,699 INFO L93 Difference]: Finished difference Result 939 states and 1363 transitions. [2019-08-05 10:08:50,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:08:50,699 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2019-08-05 10:08:50,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:08:50,704 INFO L225 Difference]: With dead ends: 939 [2019-08-05 10:08:50,705 INFO L226 Difference]: Without dead ends: 939 [2019-08-05 10:08:50,705 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=281, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:08:50,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2019-08-05 10:08:50,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 509. [2019-08-05 10:08:50,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 509 states. [2019-08-05 10:08:50,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 747 transitions. [2019-08-05 10:08:50,713 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 747 transitions. Word has length 25 [2019-08-05 10:08:50,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:08:50,713 INFO L475 AbstractCegarLoop]: Abstraction has 509 states and 747 transitions. [2019-08-05 10:08:50,713 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:08:50,714 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 747 transitions. [2019-08-05 10:08:50,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:08:50,715 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:08:50,715 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:08:50,715 INFO L418 AbstractCegarLoop]: === Iteration 34 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:08:50,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:08:50,716 INFO L82 PathProgramCache]: Analyzing trace with hash 269190686, now seen corresponding path program 2 times [2019-08-05 10:08:50,716 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:08:50,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:08:50,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-05 10:08:50,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:08:50,962 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:08:50,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:08:50,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:08:50,963 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:08:50,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:08:50,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:08:50,963 INFO L87 Difference]: Start difference. First operand 509 states and 747 transitions. Second operand 9 states. [2019-08-05 10:08:51,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:08:51,495 INFO L93 Difference]: Finished difference Result 692 states and 1003 transitions. [2019-08-05 10:08:51,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:08:51,496 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-08-05 10:08:51,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:08:51,498 INFO L225 Difference]: With dead ends: 692 [2019-08-05 10:08:51,498 INFO L226 Difference]: Without dead ends: 692 [2019-08-05 10:08:51,498 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:08:51,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2019-08-05 10:08:51,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 494. [2019-08-05 10:08:51,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2019-08-05 10:08:51,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 724 transitions. [2019-08-05 10:08:51,521 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 724 transitions. Word has length 25 [2019-08-05 10:08:51,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:08:51,521 INFO L475 AbstractCegarLoop]: Abstraction has 494 states and 724 transitions. [2019-08-05 10:08:51,521 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:08:51,521 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 724 transitions. [2019-08-05 10:08:51,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:08:51,523 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:08:51,523 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:08:51,524 INFO L418 AbstractCegarLoop]: === Iteration 35 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:08:51,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:08:51,524 INFO L82 PathProgramCache]: Analyzing trace with hash -85802330, now seen corresponding path program 2 times [2019-08-05 10:08:51,525 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:08:51,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:08:51,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 10:08:51,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:08:51,788 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-05 10:08:51,788 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:08:51,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:08:51,789 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:08:51,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:08:51,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:08:51,789 INFO L87 Difference]: Start difference. First operand 494 states and 724 transitions. Second operand 12 states. [2019-08-05 10:08:52,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:08:52,942 INFO L93 Difference]: Finished difference Result 1029 states and 1487 transitions. [2019-08-05 10:08:52,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:08:52,942 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2019-08-05 10:08:52,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:08:52,948 INFO L225 Difference]: With dead ends: 1029 [2019-08-05 10:08:52,948 INFO L226 Difference]: Without dead ends: 1029 [2019-08-05 10:08:52,948 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=164, Invalid=436, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:08:52,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1029 states. [2019-08-05 10:08:52,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1029 to 835. [2019-08-05 10:08:52,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 835 states. [2019-08-05 10:08:52,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 1228 transitions. [2019-08-05 10:08:52,959 INFO L78 Accepts]: Start accepts. Automaton has 835 states and 1228 transitions. Word has length 25 [2019-08-05 10:08:52,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:08:52,960 INFO L475 AbstractCegarLoop]: Abstraction has 835 states and 1228 transitions. [2019-08-05 10:08:52,960 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:08:52,960 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 1228 transitions. [2019-08-05 10:08:52,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:08:52,961 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:08:52,961 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:08:52,961 INFO L418 AbstractCegarLoop]: === Iteration 36 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:08:52,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:08:52,961 INFO L82 PathProgramCache]: Analyzing trace with hash -85713435, now seen corresponding path program 2 times [2019-08-05 10:08:52,962 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:08:53,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:08:53,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-05 10:08:53,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:08:53,192 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:08:53,193 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:08:53,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:08:53,193 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:08:53,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:08:53,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:08:53,194 INFO L87 Difference]: Start difference. First operand 835 states and 1228 transitions. Second operand 9 states. [2019-08-05 10:08:53,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:08:53,888 INFO L93 Difference]: Finished difference Result 1269 states and 1855 transitions. [2019-08-05 10:08:53,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:08:53,889 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-08-05 10:08:53,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:08:53,894 INFO L225 Difference]: With dead ends: 1269 [2019-08-05 10:08:53,895 INFO L226 Difference]: Without dead ends: 1269 [2019-08-05 10:08:53,895 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 14 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:08:53,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1269 states. [2019-08-05 10:08:53,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1269 to 848. [2019-08-05 10:08:53,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 848 states. [2019-08-05 10:08:53,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 1248 transitions. [2019-08-05 10:08:53,930 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 1248 transitions. Word has length 25 [2019-08-05 10:08:53,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:08:53,930 INFO L475 AbstractCegarLoop]: Abstraction has 848 states and 1248 transitions. [2019-08-05 10:08:53,930 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:08:53,930 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 1248 transitions. [2019-08-05 10:08:53,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:08:53,932 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:08:53,932 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:08:53,932 INFO L418 AbstractCegarLoop]: === Iteration 37 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:08:53,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:08:53,933 INFO L82 PathProgramCache]: Analyzing trace with hash 288848692, now seen corresponding path program 2 times [2019-08-05 10:08:53,933 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:08:53,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:08:53,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-05 10:08:53,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:08:54,136 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:08:54,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:08:54,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:08:54,137 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:08:54,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:08:54,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:08:54,138 INFO L87 Difference]: Start difference. First operand 848 states and 1248 transitions. Second operand 9 states. [2019-08-05 10:08:54,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:08:54,738 INFO L93 Difference]: Finished difference Result 1201 states and 1752 transitions. [2019-08-05 10:08:54,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:08:54,739 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-08-05 10:08:54,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:08:54,744 INFO L225 Difference]: With dead ends: 1201 [2019-08-05 10:08:54,744 INFO L226 Difference]: Without dead ends: 1201 [2019-08-05 10:08:54,744 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 14 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:08:54,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1201 states. [2019-08-05 10:08:54,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1201 to 834. [2019-08-05 10:08:54,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 834 states. [2019-08-05 10:08:54,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 1226 transitions. [2019-08-05 10:08:54,759 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 1226 transitions. Word has length 25 [2019-08-05 10:08:54,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:08:54,759 INFO L475 AbstractCegarLoop]: Abstraction has 834 states and 1226 transitions. [2019-08-05 10:08:54,759 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:08:54,759 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1226 transitions. [2019-08-05 10:08:54,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:08:54,761 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:08:54,761 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:08:54,761 INFO L418 AbstractCegarLoop]: === Iteration 38 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:08:54,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:08:54,762 INFO L82 PathProgramCache]: Analyzing trace with hash -1302017705, now seen corresponding path program 2 times [2019-08-05 10:08:54,762 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:08:54,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:08:54,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 10:08:54,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:08:55,029 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:08:55,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:08:55,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:08:55,030 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:08:55,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:08:55,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:08:55,031 INFO L87 Difference]: Start difference. First operand 834 states and 1226 transitions. Second operand 10 states. [2019-08-05 10:08:55,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:08:55,942 INFO L93 Difference]: Finished difference Result 1261 states and 1839 transitions. [2019-08-05 10:08:55,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:08:55,944 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2019-08-05 10:08:55,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:08:55,948 INFO L225 Difference]: With dead ends: 1261 [2019-08-05 10:08:55,949 INFO L226 Difference]: Without dead ends: 1261 [2019-08-05 10:08:55,949 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:08:55,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1261 states. [2019-08-05 10:08:55,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1261 to 881. [2019-08-05 10:08:55,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 881 states. [2019-08-05 10:08:55,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1293 transitions. [2019-08-05 10:08:55,963 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1293 transitions. Word has length 25 [2019-08-05 10:08:55,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:08:55,964 INFO L475 AbstractCegarLoop]: Abstraction has 881 states and 1293 transitions. [2019-08-05 10:08:55,964 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:08:55,964 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1293 transitions. [2019-08-05 10:08:55,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:08:55,966 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:08:55,966 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:08:55,966 INFO L418 AbstractCegarLoop]: === Iteration 39 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:08:55,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:08:55,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1819599163, now seen corresponding path program 3 times [2019-08-05 10:08:55,967 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:08:56,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:08:56,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 10:08:56,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:08:56,240 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:08:56,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:08:56,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:08:56,240 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:08:56,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:08:56,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:08:56,241 INFO L87 Difference]: Start difference. First operand 881 states and 1293 transitions. Second operand 12 states. [2019-08-05 10:08:57,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:08:57,057 INFO L93 Difference]: Finished difference Result 1077 states and 1574 transitions. [2019-08-05 10:08:57,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:08:57,057 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2019-08-05 10:08:57,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:08:57,061 INFO L225 Difference]: With dead ends: 1077 [2019-08-05 10:08:57,061 INFO L226 Difference]: Without dead ends: 1077 [2019-08-05 10:08:57,061 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:08:57,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2019-08-05 10:08:57,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 919. [2019-08-05 10:08:57,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 919 states. [2019-08-05 10:08:57,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1353 transitions. [2019-08-05 10:08:57,073 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 1353 transitions. Word has length 25 [2019-08-05 10:08:57,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:08:57,074 INFO L475 AbstractCegarLoop]: Abstraction has 919 states and 1353 transitions. [2019-08-05 10:08:57,074 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:08:57,074 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1353 transitions. [2019-08-05 10:08:57,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:08:57,075 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:08:57,075 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:08:57,075 INFO L418 AbstractCegarLoop]: === Iteration 40 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:08:57,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:08:57,075 INFO L82 PathProgramCache]: Analyzing trace with hash -1819509436, now seen corresponding path program 1 times [2019-08-05 10:08:57,076 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:08:57,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:08:57,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 10:08:57,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:08:57,211 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-05 10:08:57,211 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:08:57,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:08:57,212 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:08:57,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:08:57,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:08:57,213 INFO L87 Difference]: Start difference. First operand 919 states and 1353 transitions. Second operand 9 states. [2019-08-05 10:08:57,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:08:57,879 INFO L93 Difference]: Finished difference Result 1196 states and 1754 transitions. [2019-08-05 10:08:57,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:08:57,880 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-08-05 10:08:57,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:08:57,882 INFO L225 Difference]: With dead ends: 1196 [2019-08-05 10:08:57,883 INFO L226 Difference]: Without dead ends: 1196 [2019-08-05 10:08:57,883 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:08:57,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2019-08-05 10:08:57,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 822. [2019-08-05 10:08:57,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 822 states. [2019-08-05 10:08:57,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 1209 transitions. [2019-08-05 10:08:57,892 INFO L78 Accepts]: Start accepts. Automaton has 822 states and 1209 transitions. Word has length 25 [2019-08-05 10:08:57,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:08:57,893 INFO L475 AbstractCegarLoop]: Abstraction has 822 states and 1209 transitions. [2019-08-05 10:08:57,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:08:57,893 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 1209 transitions. [2019-08-05 10:08:57,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:08:57,894 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:08:57,894 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:08:57,894 INFO L418 AbstractCegarLoop]: === Iteration 41 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:08:57,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:08:57,894 INFO L82 PathProgramCache]: Analyzing trace with hash 2120375117, now seen corresponding path program 1 times [2019-08-05 10:08:57,895 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:08:57,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:08:57,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 10:08:57,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:08:58,177 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:08:58,178 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:08:58,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:08:58,178 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:08:58,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:08:58,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:08:58,178 INFO L87 Difference]: Start difference. First operand 822 states and 1209 transitions. Second operand 9 states. [2019-08-05 10:08:58,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:08:58,741 INFO L93 Difference]: Finished difference Result 930 states and 1348 transitions. [2019-08-05 10:08:58,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:08:58,742 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-08-05 10:08:58,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:08:58,744 INFO L225 Difference]: With dead ends: 930 [2019-08-05 10:08:58,744 INFO L226 Difference]: Without dead ends: 930 [2019-08-05 10:08:58,745 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:08:58,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states. [2019-08-05 10:08:58,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 815. [2019-08-05 10:08:58,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 815 states. [2019-08-05 10:08:58,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 1197 transitions. [2019-08-05 10:08:58,754 INFO L78 Accepts]: Start accepts. Automaton has 815 states and 1197 transitions. Word has length 25 [2019-08-05 10:08:58,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:08:58,754 INFO L475 AbstractCegarLoop]: Abstraction has 815 states and 1197 transitions. [2019-08-05 10:08:58,754 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:08:58,754 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 1197 transitions. [2019-08-05 10:08:58,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:08:58,755 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:08:58,755 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:08:58,756 INFO L418 AbstractCegarLoop]: === Iteration 42 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:08:58,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:08:58,756 INFO L82 PathProgramCache]: Analyzing trace with hash 630000947, now seen corresponding path program 4 times [2019-08-05 10:08:58,757 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:08:58,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:08:58,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 10:08:58,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:08:59,067 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:08:59,067 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:08:59,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:08:59,067 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:08:59,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:08:59,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:08:59,068 INFO L87 Difference]: Start difference. First operand 815 states and 1197 transitions. Second operand 9 states. [2019-08-05 10:08:59,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:08:59,913 INFO L93 Difference]: Finished difference Result 989 states and 1433 transitions. [2019-08-05 10:08:59,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:08:59,914 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-08-05 10:08:59,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:08:59,916 INFO L225 Difference]: With dead ends: 989 [2019-08-05 10:08:59,916 INFO L226 Difference]: Without dead ends: 989 [2019-08-05 10:08:59,917 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=133, Invalid=287, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:08:59,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2019-08-05 10:08:59,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 733. [2019-08-05 10:08:59,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 733 states. [2019-08-05 10:08:59,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 1068 transitions. [2019-08-05 10:08:59,927 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 1068 transitions. Word has length 25 [2019-08-05 10:08:59,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:08:59,927 INFO L475 AbstractCegarLoop]: Abstraction has 733 states and 1068 transitions. [2019-08-05 10:08:59,927 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:08:59,927 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 1068 transitions. [2019-08-05 10:08:59,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:08:59,928 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:08:59,928 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:08:59,929 INFO L418 AbstractCegarLoop]: === Iteration 43 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:08:59,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:08:59,929 INFO L82 PathProgramCache]: Analyzing trace with hash 275007931, now seen corresponding path program 2 times [2019-08-05 10:08:59,930 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:08:59,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:08:59,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 10:08:59,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:00,142 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:09:00,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:09:00,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:09:00,143 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:09:00,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:09:00,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:09:00,144 INFO L87 Difference]: Start difference. First operand 733 states and 1068 transitions. Second operand 9 states. [2019-08-05 10:09:00,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:00,799 INFO L93 Difference]: Finished difference Result 872 states and 1254 transitions. [2019-08-05 10:09:00,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:09:00,799 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-08-05 10:09:00,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:00,801 INFO L225 Difference]: With dead ends: 872 [2019-08-05 10:09:00,802 INFO L226 Difference]: Without dead ends: 872 [2019-08-05 10:09:00,802 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=251, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:09:00,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2019-08-05 10:09:00,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 731. [2019-08-05 10:09:00,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 731 states. [2019-08-05 10:09:00,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1065 transitions. [2019-08-05 10:09:00,819 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1065 transitions. Word has length 25 [2019-08-05 10:09:00,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:00,820 INFO L475 AbstractCegarLoop]: Abstraction has 731 states and 1065 transitions. [2019-08-05 10:09:00,820 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:09:00,820 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1065 transitions. [2019-08-05 10:09:00,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:09:00,821 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:00,821 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:00,821 INFO L418 AbstractCegarLoop]: === Iteration 44 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:00,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:00,821 INFO L82 PathProgramCache]: Analyzing trace with hash 213878203, now seen corresponding path program 3 times [2019-08-05 10:09:00,822 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:00,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:00,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 10:09:00,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:00,987 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:09:00,987 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:09:00,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:09:00,987 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:09:00,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:09:00,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:09:00,988 INFO L87 Difference]: Start difference. First operand 731 states and 1065 transitions. Second operand 9 states. [2019-08-05 10:09:01,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:01,620 INFO L93 Difference]: Finished difference Result 856 states and 1227 transitions. [2019-08-05 10:09:01,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:09:01,621 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-08-05 10:09:01,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:01,623 INFO L225 Difference]: With dead ends: 856 [2019-08-05 10:09:01,624 INFO L226 Difference]: Without dead ends: 856 [2019-08-05 10:09:01,624 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:09:01,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2019-08-05 10:09:01,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 645. [2019-08-05 10:09:01,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 645 states. [2019-08-05 10:09:01,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 938 transitions. [2019-08-05 10:09:01,635 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 938 transitions. Word has length 25 [2019-08-05 10:09:01,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:01,635 INFO L475 AbstractCegarLoop]: Abstraction has 645 states and 938 transitions. [2019-08-05 10:09:01,636 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:09:01,636 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 938 transitions. [2019-08-05 10:09:01,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:09:01,637 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:01,637 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:01,638 INFO L418 AbstractCegarLoop]: === Iteration 45 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:01,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:01,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1668736886, now seen corresponding path program 1 times [2019-08-05 10:09:01,639 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:01,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:01,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-05 10:09:01,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:02,358 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-05 10:09:02,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:09:02,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:09:02,358 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:09:02,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:09:02,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:09:02,359 INFO L87 Difference]: Start difference. First operand 645 states and 938 transitions. Second operand 9 states. [2019-08-05 10:09:02,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:02,892 INFO L93 Difference]: Finished difference Result 902 states and 1303 transitions. [2019-08-05 10:09:02,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:09:02,893 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-08-05 10:09:02,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:02,895 INFO L225 Difference]: With dead ends: 902 [2019-08-05 10:09:02,895 INFO L226 Difference]: Without dead ends: 902 [2019-08-05 10:09:02,896 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 14 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:09:02,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2019-08-05 10:09:02,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 569. [2019-08-05 10:09:02,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 569 states. [2019-08-05 10:09:02,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 823 transitions. [2019-08-05 10:09:02,904 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 823 transitions. Word has length 25 [2019-08-05 10:09:02,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:02,904 INFO L475 AbstractCegarLoop]: Abstraction has 569 states and 823 transitions. [2019-08-05 10:09:02,904 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:09:02,904 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 823 transitions. [2019-08-05 10:09:02,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:09:02,905 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:02,905 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:02,905 INFO L418 AbstractCegarLoop]: === Iteration 46 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:02,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:02,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1151155428, now seen corresponding path program 2 times [2019-08-05 10:09:02,906 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:02,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:02,948 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-05 10:09:02,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:03,050 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-05 10:09:03,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:09:03,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:09:03,051 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:09:03,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:09:03,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:09:03,051 INFO L87 Difference]: Start difference. First operand 569 states and 823 transitions. Second operand 8 states. [2019-08-05 10:09:03,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:03,738 INFO L93 Difference]: Finished difference Result 1000 states and 1427 transitions. [2019-08-05 10:09:03,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:09:03,739 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2019-08-05 10:09:03,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:03,742 INFO L225 Difference]: With dead ends: 1000 [2019-08-05 10:09:03,742 INFO L226 Difference]: Without dead ends: 1000 [2019-08-05 10:09:03,742 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:09:03,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000 states. [2019-08-05 10:09:03,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000 to 803. [2019-08-05 10:09:03,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803 states. [2019-08-05 10:09:03,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1165 transitions. [2019-08-05 10:09:03,754 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1165 transitions. Word has length 25 [2019-08-05 10:09:03,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:03,755 INFO L475 AbstractCegarLoop]: Abstraction has 803 states and 1165 transitions. [2019-08-05 10:09:03,755 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:09:03,755 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1165 transitions. [2019-08-05 10:09:03,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:09:03,757 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:03,757 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:03,757 INFO L418 AbstractCegarLoop]: === Iteration 47 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:03,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:03,757 INFO L82 PathProgramCache]: Analyzing trace with hash 796162412, now seen corresponding path program 1 times [2019-08-05 10:09:03,758 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:03,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:03,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-05 10:09:03,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:04,077 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:09:04,077 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:09:04,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:09:04,078 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:09:04,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:09:04,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:09:04,078 INFO L87 Difference]: Start difference. First operand 803 states and 1165 transitions. Second operand 9 states. [2019-08-05 10:09:04,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:04,646 INFO L93 Difference]: Finished difference Result 1005 states and 1453 transitions. [2019-08-05 10:09:04,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:09:04,646 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-08-05 10:09:04,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:04,649 INFO L225 Difference]: With dead ends: 1005 [2019-08-05 10:09:04,649 INFO L226 Difference]: Without dead ends: 1005 [2019-08-05 10:09:04,649 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:09:04,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1005 states. [2019-08-05 10:09:04,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1005 to 789. [2019-08-05 10:09:04,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2019-08-05 10:09:04,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1142 transitions. [2019-08-05 10:09:04,661 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1142 transitions. Word has length 25 [2019-08-05 10:09:04,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:04,661 INFO L475 AbstractCegarLoop]: Abstraction has 789 states and 1142 transitions. [2019-08-05 10:09:04,661 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:09:04,661 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1142 transitions. [2019-08-05 10:09:04,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:09:04,663 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:04,663 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:04,664 INFO L418 AbstractCegarLoop]: === Iteration 48 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:04,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:04,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1574328464, now seen corresponding path program 1 times [2019-08-05 10:09:04,665 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:04,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:04,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 10:09:04,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:05,073 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:09:05,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:09:05,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:09:05,074 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:09:05,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:09:05,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:09:05,075 INFO L87 Difference]: Start difference. First operand 789 states and 1142 transitions. Second operand 10 states. [2019-08-05 10:09:05,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:05,976 INFO L93 Difference]: Finished difference Result 1239 states and 1778 transitions. [2019-08-05 10:09:05,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:09:05,977 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2019-08-05 10:09:05,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:05,980 INFO L225 Difference]: With dead ends: 1239 [2019-08-05 10:09:05,980 INFO L226 Difference]: Without dead ends: 1239 [2019-08-05 10:09:05,981 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=236, Invalid=576, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:09:05,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1239 states. [2019-08-05 10:09:05,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1239 to 701. [2019-08-05 10:09:05,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 701 states. [2019-08-05 10:09:05,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 1012 transitions. [2019-08-05 10:09:05,994 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 1012 transitions. Word has length 29 [2019-08-05 10:09:05,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:05,994 INFO L475 AbstractCegarLoop]: Abstraction has 701 states and 1012 transitions. [2019-08-05 10:09:05,994 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:09:05,994 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 1012 transitions. [2019-08-05 10:09:05,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:09:05,997 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:05,997 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:05,997 INFO L418 AbstractCegarLoop]: === Iteration 49 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:05,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:05,997 INFO L82 PathProgramCache]: Analyzing trace with hash 2002868801, now seen corresponding path program 1 times [2019-08-05 10:09:05,998 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:06,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:06,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 10:09:06,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:06,700 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:09:06,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:09:06,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:09:06,701 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:09:06,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:09:06,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:09:06,702 INFO L87 Difference]: Start difference. First operand 701 states and 1012 transitions. Second operand 11 states. [2019-08-05 10:09:07,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:07,370 INFO L93 Difference]: Finished difference Result 993 states and 1422 transitions. [2019-08-05 10:09:07,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:09:07,371 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2019-08-05 10:09:07,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:07,374 INFO L225 Difference]: With dead ends: 993 [2019-08-05 10:09:07,374 INFO L226 Difference]: Without dead ends: 993 [2019-08-05 10:09:07,375 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=122, Invalid=298, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:09:07,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993 states. [2019-08-05 10:09:07,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 684. [2019-08-05 10:09:07,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 684 states. [2019-08-05 10:09:07,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 990 transitions. [2019-08-05 10:09:07,387 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 990 transitions. Word has length 29 [2019-08-05 10:09:07,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:07,388 INFO L475 AbstractCegarLoop]: Abstraction has 684 states and 990 transitions. [2019-08-05 10:09:07,388 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:09:07,388 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 990 transitions. [2019-08-05 10:09:07,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:09:07,390 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:07,390 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:07,390 INFO L418 AbstractCegarLoop]: === Iteration 50 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:07,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:07,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1715693211, now seen corresponding path program 3 times [2019-08-05 10:09:07,391 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:07,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:07,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 10:09:07,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:07,754 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-08-05 10:09:07,754 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:09:07,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:09:07,754 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:09:07,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:09:07,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:09:07,755 INFO L87 Difference]: Start difference. First operand 684 states and 990 transitions. Second operand 9 states. [2019-08-05 10:09:08,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:08,433 INFO L93 Difference]: Finished difference Result 1016 states and 1457 transitions. [2019-08-05 10:09:08,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:09:08,434 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2019-08-05 10:09:08,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:08,436 INFO L225 Difference]: With dead ends: 1016 [2019-08-05 10:09:08,436 INFO L226 Difference]: Without dead ends: 1016 [2019-08-05 10:09:08,436 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:09:08,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2019-08-05 10:09:08,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 270. [2019-08-05 10:09:08,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2019-08-05 10:09:08,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 386 transitions. [2019-08-05 10:09:08,443 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 386 transitions. Word has length 29 [2019-08-05 10:09:08,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:08,444 INFO L475 AbstractCegarLoop]: Abstraction has 270 states and 386 transitions. [2019-08-05 10:09:08,444 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:09:08,444 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 386 transitions. [2019-08-05 10:09:08,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:09:08,445 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:08,445 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:08,445 INFO L418 AbstractCegarLoop]: === Iteration 51 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:08,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:08,445 INFO L82 PathProgramCache]: Analyzing trace with hash 2090255338, now seen corresponding path program 3 times [2019-08-05 10:09:08,446 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:08,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:08,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 10:09:08,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:08,661 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-08-05 10:09:08,662 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:09:08,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:09:08,662 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:09:08,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:09:08,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:09:08,665 INFO L87 Difference]: Start difference. First operand 270 states and 386 transitions. Second operand 10 states. [2019-08-05 10:09:09,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:09,558 INFO L93 Difference]: Finished difference Result 481 states and 680 transitions. [2019-08-05 10:09:09,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:09:09,559 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2019-08-05 10:09:09,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:09,560 INFO L225 Difference]: With dead ends: 481 [2019-08-05 10:09:09,560 INFO L226 Difference]: Without dead ends: 481 [2019-08-05 10:09:09,561 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:09:09,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2019-08-05 10:09:09,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 117. [2019-08-05 10:09:09,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 10:09:09,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 159 transitions. [2019-08-05 10:09:09,565 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 159 transitions. Word has length 29 [2019-08-05 10:09:09,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:09,565 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 159 transitions. [2019-08-05 10:09:09,565 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:09:09,565 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 159 transitions. [2019-08-05 10:09:09,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:09:09,566 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:09,566 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:09,566 INFO L418 AbstractCegarLoop]: === Iteration 52 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:09,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:09,567 INFO L82 PathProgramCache]: Analyzing trace with hash 140541619, now seen corresponding path program 1 times [2019-08-05 10:09:09,568 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:09,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:09,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 10:09:09,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:09,877 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:09:09,878 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:09:09,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:09:09,878 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:09:09,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:09:09,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:09:09,878 INFO L87 Difference]: Start difference. First operand 117 states and 159 transitions. Second operand 13 states. [2019-08-05 10:09:11,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:11,141 INFO L93 Difference]: Finished difference Result 254 states and 347 transitions. [2019-08-05 10:09:11,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:09:11,142 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 29 [2019-08-05 10:09:11,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:11,143 INFO L225 Difference]: With dead ends: 254 [2019-08-05 10:09:11,143 INFO L226 Difference]: Without dead ends: 254 [2019-08-05 10:09:11,143 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=188, Invalid=514, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:09:11,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-08-05 10:09:11,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 112. [2019-08-05 10:09:11,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-08-05 10:09:11,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 152 transitions. [2019-08-05 10:09:11,146 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 152 transitions. Word has length 29 [2019-08-05 10:09:11,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:11,146 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 152 transitions. [2019-08-05 10:09:11,146 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:09:11,146 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 152 transitions. [2019-08-05 10:09:11,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:09:11,147 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:11,147 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:11,147 INFO L418 AbstractCegarLoop]: === Iteration 53 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:11,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:11,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1399453137, now seen corresponding path program 1 times [2019-08-05 10:09:11,148 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:11,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:11,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 10:09:11,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:11,330 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:09:11,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:09:11,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:09:11,331 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:09:11,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:09:11,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:09:11,332 INFO L87 Difference]: Start difference. First operand 112 states and 152 transitions. Second operand 10 states. [2019-08-05 10:09:12,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:12,011 INFO L93 Difference]: Finished difference Result 249 states and 345 transitions. [2019-08-05 10:09:12,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:09:12,012 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2019-08-05 10:09:12,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:12,012 INFO L225 Difference]: With dead ends: 249 [2019-08-05 10:09:12,013 INFO L226 Difference]: Without dead ends: 249 [2019-08-05 10:09:12,013 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 17 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:09:12,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-08-05 10:09:12,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 99. [2019-08-05 10:09:12,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 10:09:12,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 134 transitions. [2019-08-05 10:09:12,016 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 134 transitions. Word has length 29 [2019-08-05 10:09:12,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:12,017 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 134 transitions. [2019-08-05 10:09:12,017 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:09:12,017 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 134 transitions. [2019-08-05 10:09:12,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:09:12,017 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:12,017 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:12,018 INFO L418 AbstractCegarLoop]: === Iteration 54 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:12,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:12,018 INFO L82 PathProgramCache]: Analyzing trace with hash 79411891, now seen corresponding path program 2 times [2019-08-05 10:09:12,018 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:12,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:12,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 10:09:12,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:12,844 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:09:12,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:09:12,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:09:12,844 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:09:12,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:09:12,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:09:12,845 INFO L87 Difference]: Start difference. First operand 99 states and 134 transitions. Second operand 13 states. [2019-08-05 10:09:14,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:14,222 INFO L93 Difference]: Finished difference Result 237 states and 322 transitions. [2019-08-05 10:09:14,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:09:14,223 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 29 [2019-08-05 10:09:14,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:14,224 INFO L225 Difference]: With dead ends: 237 [2019-08-05 10:09:14,224 INFO L226 Difference]: Without dead ends: 237 [2019-08-05 10:09:14,224 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=200, Invalid=556, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:09:14,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-08-05 10:09:14,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 102. [2019-08-05 10:09:14,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-08-05 10:09:14,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 139 transitions. [2019-08-05 10:09:14,227 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 139 transitions. Word has length 29 [2019-08-05 10:09:14,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:14,227 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 139 transitions. [2019-08-05 10:09:14,227 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:09:14,227 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 139 transitions. [2019-08-05 10:09:14,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:09:14,227 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:14,227 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:14,228 INFO L418 AbstractCegarLoop]: === Iteration 55 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:14,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:14,228 INFO L82 PathProgramCache]: Analyzing trace with hash 79501618, now seen corresponding path program 1 times [2019-08-05 10:09:14,228 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:14,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:14,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 10:09:14,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:14,363 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:09:14,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:09:14,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:09:14,364 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:09:14,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:09:14,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:09:14,365 INFO L87 Difference]: Start difference. First operand 102 states and 139 transitions. Second operand 10 states. [2019-08-05 10:09:15,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:15,470 INFO L93 Difference]: Finished difference Result 238 states and 328 transitions. [2019-08-05 10:09:15,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:09:15,470 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2019-08-05 10:09:15,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:15,471 INFO L225 Difference]: With dead ends: 238 [2019-08-05 10:09:15,471 INFO L226 Difference]: Without dead ends: 238 [2019-08-05 10:09:15,471 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 17 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=209, Invalid=547, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:09:15,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2019-08-05 10:09:15,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 93. [2019-08-05 10:09:15,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-08-05 10:09:15,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 126 transitions. [2019-08-05 10:09:15,474 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 126 transitions. Word has length 29 [2019-08-05 10:09:15,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:15,474 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 126 transitions. [2019-08-05 10:09:15,475 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:09:15,475 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 126 transitions. [2019-08-05 10:09:15,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:09:15,475 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:15,475 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:15,476 INFO L418 AbstractCegarLoop]: === Iteration 56 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:15,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:15,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1016689500, now seen corresponding path program 3 times [2019-08-05 10:09:15,476 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:15,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:15,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-05 10:09:15,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:15,599 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 10:09:15,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:09:15,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:09:15,600 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:09:15,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:09:15,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:09:15,601 INFO L87 Difference]: Start difference. First operand 93 states and 126 transitions. Second operand 10 states. [2019-08-05 10:09:16,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:16,175 INFO L93 Difference]: Finished difference Result 168 states and 229 transitions. [2019-08-05 10:09:16,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:09:16,176 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2019-08-05 10:09:16,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:16,176 INFO L225 Difference]: With dead ends: 168 [2019-08-05 10:09:16,177 INFO L226 Difference]: Without dead ends: 168 [2019-08-05 10:09:16,177 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:09:16,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-08-05 10:09:16,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 90. [2019-08-05 10:09:16,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-08-05 10:09:16,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 121 transitions. [2019-08-05 10:09:16,179 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 121 transitions. Word has length 29 [2019-08-05 10:09:16,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:16,180 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 121 transitions. [2019-08-05 10:09:16,180 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:09:16,180 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 121 transitions. [2019-08-05 10:09:16,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:09:16,181 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:16,181 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:16,181 INFO L418 AbstractCegarLoop]: === Iteration 57 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:16,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:16,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1016779227, now seen corresponding path program 1 times [2019-08-05 10:09:16,182 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:16,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:16,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 10:09:16,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:17,333 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-08-05 10:09:17,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:09:17,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:09:17,334 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:09:17,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:09:17,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:09:17,335 INFO L87 Difference]: Start difference. First operand 90 states and 121 transitions. Second operand 9 states. [2019-08-05 10:09:18,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:18,208 INFO L93 Difference]: Finished difference Result 195 states and 269 transitions. [2019-08-05 10:09:18,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:09:18,208 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2019-08-05 10:09:18,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:18,208 INFO L225 Difference]: With dead ends: 195 [2019-08-05 10:09:18,209 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 10:09:18,209 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 17 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:09:18,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 10:09:18,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 10:09:18,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 10:09:18,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 10:09:18,210 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2019-08-05 10:09:18,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:18,210 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 10:09:18,210 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:09:18,211 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 10:09:18,211 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 10:09:18,217 INFO L202 PluginConnector]: Adding new model threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:09:18 BoogieIcfgContainer [2019-08-05 10:09:18,217 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:09:18,220 INFO L168 Benchmark]: Toolchain (without parser) took 63683.56 ms. Allocated memory was 141.0 MB in the beginning and 485.0 MB in the end (delta: 343.9 MB). Free memory was 108.8 MB in the beginning and 163.3 MB in the end (delta: -54.5 MB). Peak memory consumption was 289.4 MB. Max. memory is 7.1 GB. [2019-08-05 10:09:18,220 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 141.0 MB. Free memory is still 109.6 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 10:09:18,221 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.07 ms. Allocated memory is still 141.0 MB. Free memory was 108.3 MB in the beginning and 106.7 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-08-05 10:09:18,222 INFO L168 Benchmark]: Boogie Preprocessor took 34.76 ms. Allocated memory is still 141.0 MB. Free memory was 106.7 MB in the beginning and 105.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:09:18,222 INFO L168 Benchmark]: RCFGBuilder took 533.89 ms. Allocated memory is still 141.0 MB. Free memory was 105.4 MB in the beginning and 89.8 MB in the end (delta: 15.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 7.1 GB. [2019-08-05 10:09:18,223 INFO L168 Benchmark]: TraceAbstraction took 63071.19 ms. Allocated memory was 141.0 MB in the beginning and 485.0 MB in the end (delta: 343.9 MB). Free memory was 89.8 MB in the beginning and 163.3 MB in the end (delta: -73.5 MB). Peak memory consumption was 270.4 MB. Max. memory is 7.1 GB. [2019-08-05 10:09:18,225 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 141.0 MB. Free memory is still 109.6 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 39.07 ms. Allocated memory is still 141.0 MB. Free memory was 108.3 MB in the beginning and 106.7 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 34.76 ms. Allocated memory is still 141.0 MB. Free memory was 106.7 MB in the beginning and 105.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 533.89 ms. Allocated memory is still 141.0 MB. Free memory was 105.4 MB in the beginning and 89.8 MB in the end (delta: 15.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 63071.19 ms. Allocated memory was 141.0 MB in the beginning and 485.0 MB in the end (delta: 343.9 MB). Free memory was 89.8 MB in the beginning and 163.3 MB in the end (delta: -73.5 MB). Peak memory consumption was 270.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 99]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 66]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 112]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 121]: 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 5 procedures, 48 locations, 4 error locations. SAFE Result, 63.0s OverallTime, 57 OverallIterations, 3 TraceHistogramMax, 43.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4230 SDtfs, 6563 SDslu, 8021 SDs, 0 SdLazy, 26084 SolverSat, 4364 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 28.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1667 GetRequests, 731 SyntacticMatches, 71 SemanticMatches, 865 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2104 ImplicationChecksByTransitivity, 23.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=919occurred in iteration=39, 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.7s AutomataMinimizationTime, 57 MinimizatonAttempts, 12347 StatesRemovedByMinimization, 54 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 15.5s InterpolantComputationTime, 1225 NumberOfCodeBlocks, 1225 NumberOfCodeBlocksAsserted, 57 NumberOfCheckSat, 1168 ConstructedInterpolants, 34 QuantifiedInterpolants, 138228 SizeOfPredicates, 940 NumberOfNonLiveVariables, 16904 ConjunctsInSsa, 1917 ConjunctsInUnsatCore, 57 InterpolantComputations, 6 PerfectInterpolantSequences, 34/410 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...