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/toy/InvariantSynthesis/DynamicUnsatCoresHelpful01.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:43:54,589 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:43:54,591 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:43:54,603 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:43:54,603 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:43:54,604 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:43:54,606 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:43:54,607 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:43:54,609 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:43:54,610 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:43:54,611 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:43:54,611 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:43:54,612 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:43:54,613 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:43:54,614 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:43:54,615 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:43:54,616 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:43:54,617 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:43:54,619 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:43:54,621 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:43:54,623 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:43:54,624 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:43:54,625 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:43:54,626 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:43:54,630 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:43:54,630 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:43:54,631 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:43:54,632 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:43:54,632 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:43:54,633 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:43:54,633 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:43:54,634 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:43:54,635 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:43:54,635 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:43:54,637 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:43:54,637 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:43:54,637 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:43:54,638 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:43:54,638 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:43:54,639 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:43:54,639 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:43:54,666 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:43:54,678 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:43:54,682 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:43:54,683 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:43:54,684 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:43:54,685 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/InvariantSynthesis/DynamicUnsatCoresHelpful01.bpl [2019-08-05 10:43:54,685 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/InvariantSynthesis/DynamicUnsatCoresHelpful01.bpl' [2019-08-05 10:43:54,718 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:43:54,720 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:43:54,721 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:43:54,721 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:43:54,721 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:43:54,737 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "DynamicUnsatCoresHelpful01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:43:54" (1/1) ... [2019-08-05 10:43:54,746 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "DynamicUnsatCoresHelpful01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:43:54" (1/1) ... [2019-08-05 10:43:54,752 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:43:54,753 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:43:54,753 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:43:54,755 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:43:54,756 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:43:54,756 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:43:54,756 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:43:54,767 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "DynamicUnsatCoresHelpful01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:43:54" (1/1) ... [2019-08-05 10:43:54,767 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "DynamicUnsatCoresHelpful01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:43:54" (1/1) ... [2019-08-05 10:43:54,768 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "DynamicUnsatCoresHelpful01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:43:54" (1/1) ... [2019-08-05 10:43:54,768 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "DynamicUnsatCoresHelpful01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:43:54" (1/1) ... [2019-08-05 10:43:54,771 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "DynamicUnsatCoresHelpful01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:43:54" (1/1) ... [2019-08-05 10:43:54,775 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "DynamicUnsatCoresHelpful01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:43:54" (1/1) ... [2019-08-05 10:43:54,776 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "DynamicUnsatCoresHelpful01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:43:54" (1/1) ... [2019-08-05 10:43:54,777 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:43:54,778 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:43:54,778 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:43:54,778 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:43:54,779 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "DynamicUnsatCoresHelpful01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:43:54" (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:43:54,847 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-08-05 10:43:54,847 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-05 10:43:54,847 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-05 10:43:55,109 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:43:55,110 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-08-05 10:43:55,111 INFO L202 PluginConnector]: Adding new model DynamicUnsatCoresHelpful01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:43:55 BoogieIcfgContainer [2019-08-05 10:43:55,111 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:43:55,113 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:43:55,113 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:43:55,116 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:43:55,116 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "DynamicUnsatCoresHelpful01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:43:54" (1/2) ... [2019-08-05 10:43:55,117 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5df545bd and model type DynamicUnsatCoresHelpful01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:43:55, skipping insertion in model container [2019-08-05 10:43:55,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "DynamicUnsatCoresHelpful01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:43:55" (2/2) ... [2019-08-05 10:43:55,119 INFO L109 eAbstractionObserver]: Analyzing ICFG DynamicUnsatCoresHelpful01.bpl [2019-08-05 10:43:55,129 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:43:55,137 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:43:55,155 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:43:55,184 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:43:55,185 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:43:55,185 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:43:55,186 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:43:55,186 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:43:55,186 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:43:55,186 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:43:55,186 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:43:55,187 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:43:55,201 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-05 10:43:55,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 10:43:55,211 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:55,212 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 10:43:55,214 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:55,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:55,219 INFO L82 PathProgramCache]: Analyzing trace with hash 29994, now seen corresponding path program 1 times [2019-08-05 10:43:55,265 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:55,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:55,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:43:55,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:55,511 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:43:55,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:43:55,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:43:55,517 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:43:55,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:43:55,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:43:55,534 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 4 states. [2019-08-05 10:43:55,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:55,627 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2019-08-05 10:43:55,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:43:55,629 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-08-05 10:43:55,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:55,640 INFO L225 Difference]: With dead ends: 11 [2019-08-05 10:43:55,640 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:43:55,642 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:43:55,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:43:55,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 6. [2019-08-05 10:43:55,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 10:43:55,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 8 transitions. [2019-08-05 10:43:55,676 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 8 transitions. Word has length 3 [2019-08-05 10:43:55,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:55,676 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 8 transitions. [2019-08-05 10:43:55,677 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:43:55,677 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 8 transitions. [2019-08-05 10:43:55,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:43:55,678 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:55,678 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:43:55,678 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:55,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:55,679 INFO L82 PathProgramCache]: Analyzing trace with hash 927568, now seen corresponding path program 1 times [2019-08-05 10:43:55,680 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:55,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:55,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:43:55,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:55,861 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:43:55,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:55,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:43:55,864 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:43:55,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:43:55,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:43:55,865 INFO L87 Difference]: Start difference. First operand 6 states and 8 transitions. Second operand 5 states. [2019-08-05 10:43:55,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:55,945 INFO L93 Difference]: Finished difference Result 12 states and 15 transitions. [2019-08-05 10:43:55,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:43:55,946 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2019-08-05 10:43:55,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:55,946 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:43:55,946 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:43:55,948 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:43:55,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:43:55,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 7. [2019-08-05 10:43:55,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:43:55,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2019-08-05 10:43:55,950 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 10 transitions. Word has length 4 [2019-08-05 10:43:55,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:55,950 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-08-05 10:43:55,951 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:43:55,951 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 10 transitions. [2019-08-05 10:43:55,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:43:55,951 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:55,952 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:43:55,952 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:55,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:55,952 INFO L82 PathProgramCache]: Analyzing trace with hash 929955, now seen corresponding path program 1 times [2019-08-05 10:43:55,953 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:55,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:55,961 WARN L254 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:43:55,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:56,161 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:43:56,161 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:56,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:43:56,162 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:43:56,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:43:56,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:43:56,163 INFO L87 Difference]: Start difference. First operand 7 states and 10 transitions. Second operand 5 states. [2019-08-05 10:43:56,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:56,387 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2019-08-05 10:43:56,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:43:56,388 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2019-08-05 10:43:56,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:56,389 INFO L225 Difference]: With dead ends: 11 [2019-08-05 10:43:56,389 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 10:43:56,390 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 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:43:56,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 10:43:56,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2019-08-05 10:43:56,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:43:56,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 14 transitions. [2019-08-05 10:43:56,392 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 14 transitions. Word has length 4 [2019-08-05 10:43:56,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:56,393 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 14 transitions. [2019-08-05 10:43:56,393 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:43:56,393 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 14 transitions. [2019-08-05 10:43:56,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:43:56,394 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:56,394 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-05 10:43:56,394 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:56,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:56,395 INFO L82 PathProgramCache]: Analyzing trace with hash 28752362, now seen corresponding path program 2 times [2019-08-05 10:43:56,396 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:56,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:56,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:43:56,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:56,511 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:56,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:56,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:43:56,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:43:56,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:43:56,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:43:56,513 INFO L87 Difference]: Start difference. First operand 10 states and 14 transitions. Second operand 6 states. [2019-08-05 10:43:56,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:56,559 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2019-08-05 10:43:56,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:43:56,562 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-08-05 10:43:56,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:56,563 INFO L225 Difference]: With dead ends: 17 [2019-08-05 10:43:56,563 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 10:43:56,564 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:43:56,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 10:43:56,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 11. [2019-08-05 10:43:56,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:43:56,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 16 transitions. [2019-08-05 10:43:56,567 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 16 transitions. Word has length 5 [2019-08-05 10:43:56,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:56,568 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 16 transitions. [2019-08-05 10:43:56,568 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:43:56,568 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 16 transitions. [2019-08-05 10:43:56,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:43:56,568 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:56,569 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-05 10:43:56,569 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:56,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:56,569 INFO L82 PathProgramCache]: Analyzing trace with hash 28754749, now seen corresponding path program 1 times [2019-08-05 10:43:56,570 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:56,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:56,579 WARN L254 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:43:56,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:56,813 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:43:56,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:56,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:43:56,814 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:43:56,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:43:56,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:43:56,815 INFO L87 Difference]: Start difference. First operand 11 states and 16 transitions. Second operand 6 states. [2019-08-05 10:43:56,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:56,882 INFO L93 Difference]: Finished difference Result 16 states and 20 transitions. [2019-08-05 10:43:56,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:43:56,884 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-08-05 10:43:56,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:56,885 INFO L225 Difference]: With dead ends: 16 [2019-08-05 10:43:56,886 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 10:43:56,886 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 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:43:56,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 10:43:56,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 11. [2019-08-05 10:43:56,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:43:56,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 16 transitions. [2019-08-05 10:43:56,889 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 16 transitions. Word has length 5 [2019-08-05 10:43:56,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:56,890 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 16 transitions. [2019-08-05 10:43:56,890 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:43:56,890 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 16 transitions. [2019-08-05 10:43:56,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:43:56,891 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:56,891 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-05 10:43:56,891 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:56,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:56,892 INFO L82 PathProgramCache]: Analyzing trace with hash 28828746, now seen corresponding path program 2 times [2019-08-05 10:43:56,892 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:56,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:56,900 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:43:56,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:56,999 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:43:57,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:43:57,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:43:57,001 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:43:57,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:43:57,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:43:57,002 INFO L87 Difference]: Start difference. First operand 11 states and 16 transitions. Second operand 4 states. [2019-08-05 10:43:57,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:57,023 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2019-08-05 10:43:57,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:43:57,024 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-08-05 10:43:57,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:57,025 INFO L225 Difference]: With dead ends: 14 [2019-08-05 10:43:57,025 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 10:43:57,026 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:43:57,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 10:43:57,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 10:43:57,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:43:57,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2019-08-05 10:43:57,029 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 15 transitions. Word has length 5 [2019-08-05 10:43:57,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:57,029 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 15 transitions. [2019-08-05 10:43:57,029 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:43:57,030 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 15 transitions. [2019-08-05 10:43:57,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:43:57,030 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:57,030 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-05 10:43:57,030 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:57,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:57,031 INFO L82 PathProgramCache]: Analyzing trace with hash 891320976, now seen corresponding path program 3 times [2019-08-05 10:43:57,031 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:57,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:57,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:43:57,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:57,158 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:43:57,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:57,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:43:57,159 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:43:57,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:43:57,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:43:57,160 INFO L87 Difference]: Start difference. First operand 11 states and 15 transitions. Second operand 7 states. [2019-08-05 10:43:57,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:57,494 INFO L93 Difference]: Finished difference Result 18 states and 22 transitions. [2019-08-05 10:43:57,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:43:57,495 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-08-05 10:43:57,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:57,496 INFO L225 Difference]: With dead ends: 18 [2019-08-05 10:43:57,496 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 10:43:57,497 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:43:57,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 10:43:57,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 12. [2019-08-05 10:43:57,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:43:57,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2019-08-05 10:43:57,500 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 17 transitions. Word has length 6 [2019-08-05 10:43:57,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:57,500 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 17 transitions. [2019-08-05 10:43:57,500 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:43:57,500 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 17 transitions. [2019-08-05 10:43:57,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:43:57,501 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:57,501 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-08-05 10:43:57,501 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:57,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:57,502 INFO L82 PathProgramCache]: Analyzing trace with hash 891323363, now seen corresponding path program 2 times [2019-08-05 10:43:57,503 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:57,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:57,514 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:43:57,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:57,646 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:43:57,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:57,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:43:57,647 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:43:57,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:43:57,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:43:57,648 INFO L87 Difference]: Start difference. First operand 12 states and 17 transitions. Second operand 7 states. [2019-08-05 10:43:57,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:57,723 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2019-08-05 10:43:57,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:43:57,723 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-08-05 10:43:57,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:57,724 INFO L225 Difference]: With dead ends: 17 [2019-08-05 10:43:57,724 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 10:43:57,725 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:43:57,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 10:43:57,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 12. [2019-08-05 10:43:57,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:43:57,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2019-08-05 10:43:57,728 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 17 transitions. Word has length 6 [2019-08-05 10:43:57,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:57,728 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 17 transitions. [2019-08-05 10:43:57,729 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:43:57,729 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 17 transitions. [2019-08-05 10:43:57,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:43:57,729 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:57,729 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-08-05 10:43:57,730 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:57,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:57,730 INFO L82 PathProgramCache]: Analyzing trace with hash 891397360, now seen corresponding path program 3 times [2019-08-05 10:43:57,731 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:57,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:57,741 WARN L254 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:43:57,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:57,855 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:43:57,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:57,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:43:57,856 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:43:57,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:43:57,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:43:57,857 INFO L87 Difference]: Start difference. First operand 12 states and 17 transitions. Second operand 7 states. [2019-08-05 10:43:57,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:57,917 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2019-08-05 10:43:57,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:43:57,918 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-08-05 10:43:57,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:57,919 INFO L225 Difference]: With dead ends: 15 [2019-08-05 10:43:57,919 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:43:57,920 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:43:57,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:43:57,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 10:43:57,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:43:57,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2019-08-05 10:43:57,923 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 16 transitions. Word has length 6 [2019-08-05 10:43:57,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:57,923 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-08-05 10:43:57,923 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:43:57,923 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2019-08-05 10:43:57,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:43:57,924 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:57,924 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-05 10:43:57,924 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:57,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:57,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144234, now seen corresponding path program 4 times [2019-08-05 10:43:57,926 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:57,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:57,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:43:57,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:58,075 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:43:58,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:58,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:43:58,076 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:43:58,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:43:58,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:43:58,078 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. Second operand 8 states. [2019-08-05 10:43:58,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:58,149 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2019-08-05 10:43:58,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:43:58,150 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-08-05 10:43:58,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:58,150 INFO L225 Difference]: With dead ends: 19 [2019-08-05 10:43:58,151 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 10:43:58,151 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:43:58,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 10:43:58,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 13. [2019-08-05 10:43:58,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:43:58,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2019-08-05 10:43:58,154 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 18 transitions. Word has length 7 [2019-08-05 10:43:58,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:58,154 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 18 transitions. [2019-08-05 10:43:58,154 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:43:58,154 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 18 transitions. [2019-08-05 10:43:58,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:43:58,155 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:58,155 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1] [2019-08-05 10:43:58,155 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:58,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:58,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1861146621, now seen corresponding path program 4 times [2019-08-05 10:43:58,157 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:58,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:58,169 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:43:58,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:58,350 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:43:58,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:58,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:43:58,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:43:58,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:43:58,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:43:58,351 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. Second operand 8 states. [2019-08-05 10:43:58,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:58,444 INFO L93 Difference]: Finished difference Result 18 states and 22 transitions. [2019-08-05 10:43:58,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:43:58,444 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-08-05 10:43:58,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:58,445 INFO L225 Difference]: With dead ends: 18 [2019-08-05 10:43:58,445 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 10:43:58,446 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:43:58,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 10:43:58,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 13. [2019-08-05 10:43:58,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:43:58,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2019-08-05 10:43:58,450 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 18 transitions. Word has length 7 [2019-08-05 10:43:58,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:58,450 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 18 transitions. [2019-08-05 10:43:58,450 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:43:58,450 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 18 transitions. [2019-08-05 10:43:58,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:43:58,451 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:58,451 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1] [2019-08-05 10:43:58,451 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:58,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:58,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1861220618, now seen corresponding path program 5 times [2019-08-05 10:43:58,452 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:58,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:58,461 WARN L254 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:43:58,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:58,614 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:58,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:58,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:43:58,615 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:43:58,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:43:58,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:43:58,616 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. Second operand 8 states. [2019-08-05 10:43:58,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:58,643 INFO L93 Difference]: Finished difference Result 16 states and 21 transitions. [2019-08-05 10:43:58,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:43:58,644 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-08-05 10:43:58,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:58,644 INFO L225 Difference]: With dead ends: 16 [2019-08-05 10:43:58,645 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 10:43:58,645 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:43:58,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 10:43:58,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 10:43:58,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:43:58,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2019-08-05 10:43:58,648 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 17 transitions. Word has length 7 [2019-08-05 10:43:58,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:58,649 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-08-05 10:43:58,649 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:43:58,649 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2019-08-05 10:43:58,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:43:58,650 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:58,650 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-08-05 10:43:58,650 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:58,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:58,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894160, now seen corresponding path program 5 times [2019-08-05 10:43:58,651 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:58,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:58,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 10:43:58,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:58,860 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:58,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:58,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:43:58,861 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:43:58,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:43:58,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:43:58,861 INFO L87 Difference]: Start difference. First operand 13 states and 17 transitions. Second operand 9 states. [2019-08-05 10:43:58,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:58,972 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2019-08-05 10:43:58,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:43:58,972 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-08-05 10:43:58,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:58,973 INFO L225 Difference]: With dead ends: 20 [2019-08-05 10:43:58,973 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 10:43:58,973 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:43:58,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 10:43:58,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 14. [2019-08-05 10:43:58,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 10:43:58,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2019-08-05 10:43:58,976 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 19 transitions. Word has length 8 [2019-08-05 10:43:58,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:58,976 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-08-05 10:43:58,976 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:43:58,976 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 19 transitions. [2019-08-05 10:43:58,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:43:58,977 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:58,977 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1] [2019-08-05 10:43:58,977 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:58,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:58,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1860896547, now seen corresponding path program 6 times [2019-08-05 10:43:58,978 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:58,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:58,987 WARN L254 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:43:58,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:59,138 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:59,139 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:59,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:43:59,139 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:43:59,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:43:59,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:43:59,140 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. Second operand 9 states. [2019-08-05 10:43:59,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:59,186 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2019-08-05 10:43:59,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:43:59,186 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-08-05 10:43:59,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:59,187 INFO L225 Difference]: With dead ends: 19 [2019-08-05 10:43:59,187 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 10:43:59,188 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:43:59,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 10:43:59,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 14. [2019-08-05 10:43:59,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 10:43:59,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2019-08-05 10:43:59,191 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 19 transitions. Word has length 8 [2019-08-05 10:43:59,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:59,191 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-08-05 10:43:59,192 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:43:59,192 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 19 transitions. [2019-08-05 10:43:59,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:43:59,192 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:59,192 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2019-08-05 10:43:59,192 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:59,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:59,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1860970544, now seen corresponding path program 7 times [2019-08-05 10:43:59,194 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:59,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:59,202 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:43:59,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:59,317 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:59,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:59,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:43:59,318 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:43:59,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:43:59,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:43:59,319 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. Second operand 9 states. [2019-08-05 10:43:59,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:59,363 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2019-08-05 10:43:59,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:43:59,364 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-08-05 10:43:59,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:59,365 INFO L225 Difference]: With dead ends: 17 [2019-08-05 10:43:59,365 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 10:43:59,366 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:43:59,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 10:43:59,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 10:43:59,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 10:43:59,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2019-08-05 10:43:59,368 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 18 transitions. Word has length 8 [2019-08-05 10:43:59,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:59,368 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 18 transitions. [2019-08-05 10:43:59,368 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:43:59,368 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 18 transitions. [2019-08-05 10:43:59,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:43:59,369 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:59,369 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-08-05 10:43:59,369 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:59,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:59,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141866, now seen corresponding path program 6 times [2019-08-05 10:43:59,370 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:59,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:59,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:43:59,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:59,650 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:59,651 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:59,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:43:59,651 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:43:59,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:43:59,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:43:59,653 INFO L87 Difference]: Start difference. First operand 14 states and 18 transitions. Second operand 10 states. [2019-08-05 10:43:59,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:59,750 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2019-08-05 10:43:59,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:43:59,752 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-08-05 10:43:59,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:59,752 INFO L225 Difference]: With dead ends: 21 [2019-08-05 10:43:59,752 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 10:43:59,753 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:43:59,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 10:43:59,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 15. [2019-08-05 10:43:59,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 10:43:59,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2019-08-05 10:43:59,755 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 20 transitions. Word has length 9 [2019-08-05 10:43:59,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:59,756 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-08-05 10:43:59,756 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:43:59,756 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 20 transitions. [2019-08-05 10:43:59,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:43:59,757 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:59,757 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1] [2019-08-05 10:43:59,757 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:59,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:59,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1853144253, now seen corresponding path program 8 times [2019-08-05 10:43:59,758 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:59,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:59,769 WARN L254 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 10:43:59,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:00,083 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:00,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:00,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:44:00,083 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:44:00,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:44:00,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:44:00,084 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. Second operand 10 states. [2019-08-05 10:44:00,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:00,155 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2019-08-05 10:44:00,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:44:00,155 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-08-05 10:44:00,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:00,156 INFO L225 Difference]: With dead ends: 20 [2019-08-05 10:44:00,156 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 10:44:00,157 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:44:00,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 10:44:00,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 15. [2019-08-05 10:44:00,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 10:44:00,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2019-08-05 10:44:00,160 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 20 transitions. Word has length 9 [2019-08-05 10:44:00,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:00,160 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-08-05 10:44:00,160 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:44:00,161 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 20 transitions. [2019-08-05 10:44:00,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:44:00,161 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:00,161 INFO L399 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1] [2019-08-05 10:44:00,161 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:00,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:00,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1853218250, now seen corresponding path program 9 times [2019-08-05 10:44:00,162 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:00,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:00,171 WARN L254 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 10:44:00,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:00,271 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:00,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:00,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:44:00,273 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:44:00,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:44:00,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:44:00,274 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. Second operand 10 states. [2019-08-05 10:44:00,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:00,329 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2019-08-05 10:44:00,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:44:00,330 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-08-05 10:44:00,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:00,330 INFO L225 Difference]: With dead ends: 18 [2019-08-05 10:44:00,330 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 10:44:00,331 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:44:00,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 10:44:00,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 10:44:00,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 10:44:00,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2019-08-05 10:44:00,333 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 19 transitions. Word has length 9 [2019-08-05 10:44:00,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:00,333 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-08-05 10:44:00,333 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:44:00,333 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 19 transitions. [2019-08-05 10:44:00,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:44:00,334 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:00,334 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-08-05 10:44:00,334 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:00,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:00,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820752, now seen corresponding path program 7 times [2019-08-05 10:44:00,335 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:00,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:00,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 10:44:00,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:00,535 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:00,536 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:00,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:44:00,537 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:44:00,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:44:00,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:44:00,538 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. Second operand 11 states. [2019-08-05 10:44:00,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:00,887 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2019-08-05 10:44:00,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:44:00,887 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 [2019-08-05 10:44:00,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:00,888 INFO L225 Difference]: With dead ends: 22 [2019-08-05 10:44:00,889 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 10:44:00,890 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:44:00,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 10:44:00,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 16. [2019-08-05 10:44:00,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 10:44:00,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2019-08-05 10:44:00,892 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 21 transitions. Word has length 10 [2019-08-05 10:44:00,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:00,893 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 21 transitions. [2019-08-05 10:44:00,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:44:00,893 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 21 transitions. [2019-08-05 10:44:00,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:44:00,894 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:00,894 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1] [2019-08-05 10:44:00,894 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:00,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:00,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1612823139, now seen corresponding path program 10 times [2019-08-05 10:44:00,896 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:00,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:00,913 WARN L254 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:44:00,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:01,054 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:01,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:01,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:44:01,056 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:44:01,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:44:01,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:44:01,057 INFO L87 Difference]: Start difference. First operand 16 states and 21 transitions. Second operand 11 states. [2019-08-05 10:44:01,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:01,163 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2019-08-05 10:44:01,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:44:01,163 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 [2019-08-05 10:44:01,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:01,164 INFO L225 Difference]: With dead ends: 21 [2019-08-05 10:44:01,164 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 10:44:01,165 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:44:01,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 10:44:01,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 16. [2019-08-05 10:44:01,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 10:44:01,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2019-08-05 10:44:01,167 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 21 transitions. Word has length 10 [2019-08-05 10:44:01,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:01,167 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 21 transitions. [2019-08-05 10:44:01,167 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:44:01,168 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 21 transitions. [2019-08-05 10:44:01,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:44:01,168 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:01,168 INFO L399 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1] [2019-08-05 10:44:01,169 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:01,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:01,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1612897136, now seen corresponding path program 11 times [2019-08-05 10:44:01,170 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:01,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:01,184 WARN L254 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:44:01,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:01,337 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:01,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:01,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:44:01,338 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:44:01,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:44:01,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:44:01,339 INFO L87 Difference]: Start difference. First operand 16 states and 21 transitions. Second operand 11 states. [2019-08-05 10:44:01,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:01,426 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2019-08-05 10:44:01,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:44:01,427 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 [2019-08-05 10:44:01,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:01,428 INFO L225 Difference]: With dead ends: 19 [2019-08-05 10:44:01,428 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 10:44:01,428 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:44:01,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 10:44:01,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 10:44:01,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 10:44:01,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2019-08-05 10:44:01,431 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 20 transitions. Word has length 10 [2019-08-05 10:44:01,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:01,431 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 20 transitions. [2019-08-05 10:44:01,431 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:44:01,431 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 20 transitions. [2019-08-05 10:44:01,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:44:01,432 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:01,432 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-08-05 10:44:01,432 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:01,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:01,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166486, now seen corresponding path program 8 times [2019-08-05 10:44:01,433 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:01,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:01,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 10:44:01,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:01,928 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:01,929 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:01,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:44:01,929 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:44:01,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:44:01,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:44:01,930 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. Second operand 12 states. [2019-08-05 10:44:02,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:02,135 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2019-08-05 10:44:02,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:44:02,140 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2019-08-05 10:44:02,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:02,140 INFO L225 Difference]: With dead ends: 23 [2019-08-05 10:44:02,140 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 10:44:02,141 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:44:02,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 10:44:02,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 17. [2019-08-05 10:44:02,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:44:02,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2019-08-05 10:44:02,143 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 22 transitions. Word has length 11 [2019-08-05 10:44:02,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:02,143 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 22 transitions. [2019-08-05 10:44:02,143 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:44:02,144 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2019-08-05 10:44:02,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:44:02,144 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:02,144 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1] [2019-08-05 10:44:02,145 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:02,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:02,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1542164099, now seen corresponding path program 12 times [2019-08-05 10:44:02,146 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:02,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:02,154 WARN L254 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 10:44:02,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:02,355 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:02,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:02,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:44:02,356 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:44:02,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:44:02,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:44:02,357 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. Second operand 12 states. [2019-08-05 10:44:02,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:02,616 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2019-08-05 10:44:02,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:44:02,616 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2019-08-05 10:44:02,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:02,617 INFO L225 Difference]: With dead ends: 22 [2019-08-05 10:44:02,617 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 10:44:02,618 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:44:02,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 10:44:02,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 17. [2019-08-05 10:44:02,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:44:02,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2019-08-05 10:44:02,620 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 22 transitions. Word has length 11 [2019-08-05 10:44:02,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:02,621 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 22 transitions. [2019-08-05 10:44:02,621 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:44:02,621 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2019-08-05 10:44:02,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:44:02,621 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:02,622 INFO L399 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2019-08-05 10:44:02,622 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:02,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:02,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1542090102, now seen corresponding path program 13 times [2019-08-05 10:44:02,623 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:02,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:02,631 WARN L254 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 10:44:02,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:02,768 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:02,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:02,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:44:02,769 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:44:02,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:44:02,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:44:02,770 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. Second operand 12 states. [2019-08-05 10:44:02,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:02,866 INFO L93 Difference]: Finished difference Result 20 states and 25 transitions. [2019-08-05 10:44:02,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:44:02,867 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2019-08-05 10:44:02,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:02,867 INFO L225 Difference]: With dead ends: 20 [2019-08-05 10:44:02,867 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 10:44:02,868 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:44:02,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 10:44:02,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 10:44:02,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:44:02,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2019-08-05 10:44:02,871 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 11 [2019-08-05 10:44:02,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:02,871 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-08-05 10:44:02,871 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:44:02,871 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2019-08-05 10:44:02,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:44:02,871 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:02,872 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-08-05 10:44:02,872 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:02,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:02,872 INFO L82 PathProgramCache]: Analyzing trace with hash -562523056, now seen corresponding path program 9 times [2019-08-05 10:44:02,873 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:02,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:02,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 10:44:02,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:03,103 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:03,104 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:03,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:44:03,104 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:44:03,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:44:03,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:44:03,106 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand 13 states. [2019-08-05 10:44:03,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:03,212 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2019-08-05 10:44:03,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:44:03,212 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 12 [2019-08-05 10:44:03,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:03,213 INFO L225 Difference]: With dead ends: 24 [2019-08-05 10:44:03,213 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 10:44:03,214 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:44:03,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 10:44:03,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 18. [2019-08-05 10:44:03,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 10:44:03,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2019-08-05 10:44:03,216 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 23 transitions. Word has length 12 [2019-08-05 10:44:03,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:03,217 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 23 transitions. [2019-08-05 10:44:03,217 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:44:03,217 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2019-08-05 10:44:03,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:44:03,217 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:03,217 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1] [2019-08-05 10:44:03,218 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:03,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:03,218 INFO L82 PathProgramCache]: Analyzing trace with hash -562520669, now seen corresponding path program 14 times [2019-08-05 10:44:03,218 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:03,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:03,226 WARN L254 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:44:03,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:03,463 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:03,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:03,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:44:03,464 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:44:03,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:44:03,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:44:03,465 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. Second operand 13 states. [2019-08-05 10:44:03,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:03,564 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2019-08-05 10:44:03,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:44:03,573 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 12 [2019-08-05 10:44:03,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:03,574 INFO L225 Difference]: With dead ends: 23 [2019-08-05 10:44:03,574 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 10:44:03,574 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:44:03,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 10:44:03,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 18. [2019-08-05 10:44:03,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 10:44:03,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2019-08-05 10:44:03,576 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 23 transitions. Word has length 12 [2019-08-05 10:44:03,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:03,576 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 23 transitions. [2019-08-05 10:44:03,577 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:44:03,577 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2019-08-05 10:44:03,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:44:03,577 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:03,578 INFO L399 BasicCegarLoop]: trace histogram [7, 2, 1, 1, 1] [2019-08-05 10:44:03,578 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:03,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:03,578 INFO L82 PathProgramCache]: Analyzing trace with hash -562446672, now seen corresponding path program 15 times [2019-08-05 10:44:03,579 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:03,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:03,586 WARN L254 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 10:44:03,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:03,737 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 1 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:03,737 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:03,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:44:03,738 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:44:03,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:44:03,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:44:03,738 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. Second operand 13 states. [2019-08-05 10:44:03,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:03,850 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2019-08-05 10:44:03,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:44:03,850 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 12 [2019-08-05 10:44:03,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:03,851 INFO L225 Difference]: With dead ends: 21 [2019-08-05 10:44:03,851 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 10:44:03,851 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:44:03,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 10:44:03,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-05 10:44:03,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 10:44:03,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2019-08-05 10:44:03,853 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 12 [2019-08-05 10:44:03,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:03,854 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2019-08-05 10:44:03,854 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:44:03,854 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2019-08-05 10:44:03,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:44:03,854 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:03,854 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-08-05 10:44:03,855 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:03,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:03,855 INFO L82 PathProgramCache]: Analyzing trace with hash -258347798, now seen corresponding path program 10 times [2019-08-05 10:44:03,856 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:03,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:03,863 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 10:44:03,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:04,157 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:04,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:04,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:44:04,158 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:44:04,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:44:04,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:44:04,158 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand 14 states. [2019-08-05 10:44:04,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:04,298 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2019-08-05 10:44:04,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:44:04,298 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2019-08-05 10:44:04,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:04,299 INFO L225 Difference]: With dead ends: 25 [2019-08-05 10:44:04,300 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 10:44:04,300 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:44:04,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 10:44:04,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 19. [2019-08-05 10:44:04,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:44:04,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2019-08-05 10:44:04,303 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 13 [2019-08-05 10:44:04,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:04,303 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2019-08-05 10:44:04,303 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:44:04,303 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2019-08-05 10:44:04,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:44:04,304 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:04,304 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1] [2019-08-05 10:44:04,304 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:04,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:04,305 INFO L82 PathProgramCache]: Analyzing trace with hash -258345411, now seen corresponding path program 16 times [2019-08-05 10:44:04,305 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:04,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:04,312 WARN L254 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 10:44:04,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:04,473 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:04,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:04,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:44:04,474 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:44:04,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:44:04,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:44:04,475 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand 14 states. [2019-08-05 10:44:04,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:04,620 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2019-08-05 10:44:04,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:44:04,621 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2019-08-05 10:44:04,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:04,622 INFO L225 Difference]: With dead ends: 24 [2019-08-05 10:44:04,622 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 10:44:04,622 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:44:04,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 10:44:04,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 19. [2019-08-05 10:44:04,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:44:04,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2019-08-05 10:44:04,626 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 13 [2019-08-05 10:44:04,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:04,626 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2019-08-05 10:44:04,626 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:44:04,627 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2019-08-05 10:44:04,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:44:04,627 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:04,627 INFO L399 BasicCegarLoop]: trace histogram [8, 2, 1, 1, 1] [2019-08-05 10:44:04,627 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:04,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:04,628 INFO L82 PathProgramCache]: Analyzing trace with hash -258271414, now seen corresponding path program 17 times [2019-08-05 10:44:04,628 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:04,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:04,635 WARN L254 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 10:44:04,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:04,769 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 1 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:04,770 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:04,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:44:04,770 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:44:04,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:44:04,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:44:04,771 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand 14 states. [2019-08-05 10:44:04,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:04,968 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2019-08-05 10:44:04,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:44:04,969 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2019-08-05 10:44:04,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:04,969 INFO L225 Difference]: With dead ends: 22 [2019-08-05 10:44:04,970 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 10:44:04,971 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:44:04,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 10:44:04,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 10:44:04,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:44:04,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2019-08-05 10:44:04,972 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 13 [2019-08-05 10:44:04,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:04,973 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2019-08-05 10:44:04,973 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:44:04,973 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2019-08-05 10:44:04,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:44:04,974 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:04,974 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2019-08-05 10:44:04,974 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:04,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:04,975 INFO L82 PathProgramCache]: Analyzing trace with hash 581150608, now seen corresponding path program 11 times [2019-08-05 10:44:04,975 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:04,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:04,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 10:44:04,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:05,213 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:05,213 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:05,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:44:05,214 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:44:05,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:44:05,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:44:05,215 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand 15 states. [2019-08-05 10:44:05,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:05,379 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2019-08-05 10:44:05,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:44:05,379 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 14 [2019-08-05 10:44:05,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:05,380 INFO L225 Difference]: With dead ends: 26 [2019-08-05 10:44:05,380 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 10:44:05,381 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:44:05,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 10:44:05,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 20. [2019-08-05 10:44:05,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 10:44:05,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2019-08-05 10:44:05,383 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 14 [2019-08-05 10:44:05,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:05,383 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2019-08-05 10:44:05,383 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:44:05,383 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2019-08-05 10:44:05,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:44:05,384 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:05,384 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1] [2019-08-05 10:44:05,384 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:05,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:05,385 INFO L82 PathProgramCache]: Analyzing trace with hash 581152995, now seen corresponding path program 18 times [2019-08-05 10:44:05,385 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:05,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:05,393 WARN L254 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 10:44:05,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:05,608 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:05,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:05,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:44:05,609 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:44:05,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:44:05,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:44:05,610 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand 15 states. [2019-08-05 10:44:05,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:05,731 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2019-08-05 10:44:05,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:44:05,732 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 14 [2019-08-05 10:44:05,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:05,732 INFO L225 Difference]: With dead ends: 25 [2019-08-05 10:44:05,732 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 10:44:05,733 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:44:05,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 10:44:05,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 20. [2019-08-05 10:44:05,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 10:44:05,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2019-08-05 10:44:05,735 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 14 [2019-08-05 10:44:05,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:05,735 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2019-08-05 10:44:05,735 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:44:05,735 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2019-08-05 10:44:05,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:44:05,736 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:05,736 INFO L399 BasicCegarLoop]: trace histogram [9, 2, 1, 1, 1] [2019-08-05 10:44:05,736 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:05,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:05,737 INFO L82 PathProgramCache]: Analyzing trace with hash 581226992, now seen corresponding path program 19 times [2019-08-05 10:44:05,737 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:05,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:05,744 WARN L254 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 10:44:05,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:05,920 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 1 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:05,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:05,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:44:05,921 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:44:05,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:44:05,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:44:05,922 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand 15 states. [2019-08-05 10:44:06,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:06,025 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2019-08-05 10:44:06,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:44:06,026 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 14 [2019-08-05 10:44:06,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:06,026 INFO L225 Difference]: With dead ends: 23 [2019-08-05 10:44:06,026 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 10:44:06,027 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:44:06,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 10:44:06,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 10:44:06,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 10:44:06,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2019-08-05 10:44:06,030 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 14 [2019-08-05 10:44:06,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:06,030 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2019-08-05 10:44:06,031 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:44:06,031 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2019-08-05 10:44:06,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:44:06,031 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:06,032 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-08-05 10:44:06,032 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:06,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:06,032 INFO L82 PathProgramCache]: Analyzing trace with hash 835797418, now seen corresponding path program 12 times [2019-08-05 10:44:06,033 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:06,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:06,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 10:44:06,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:06,458 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:06,459 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:06,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:44:06,459 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:44:06,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:44:06,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:44:06,460 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand 16 states. [2019-08-05 10:44:07,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:07,044 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2019-08-05 10:44:07,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:44:07,044 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 15 [2019-08-05 10:44:07,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:07,045 INFO L225 Difference]: With dead ends: 27 [2019-08-05 10:44:07,045 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 10:44:07,046 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:44:07,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 10:44:07,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 21. [2019-08-05 10:44:07,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 10:44:07,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2019-08-05 10:44:07,048 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 15 [2019-08-05 10:44:07,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:07,049 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2019-08-05 10:44:07,049 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:44:07,049 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2019-08-05 10:44:07,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:44:07,050 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:07,050 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1] [2019-08-05 10:44:07,050 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:07,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:07,051 INFO L82 PathProgramCache]: Analyzing trace with hash 835799805, now seen corresponding path program 20 times [2019-08-05 10:44:07,051 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:07,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:07,058 WARN L254 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 10:44:07,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:07,244 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:07,245 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:07,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:44:07,245 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:44:07,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:44:07,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:44:07,246 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand 16 states. [2019-08-05 10:44:07,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:07,389 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2019-08-05 10:44:07,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:44:07,389 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 15 [2019-08-05 10:44:07,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:07,390 INFO L225 Difference]: With dead ends: 26 [2019-08-05 10:44:07,390 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 10:44:07,391 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:44:07,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 10:44:07,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 21. [2019-08-05 10:44:07,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 10:44:07,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2019-08-05 10:44:07,393 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 15 [2019-08-05 10:44:07,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:07,393 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2019-08-05 10:44:07,393 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:44:07,393 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2019-08-05 10:44:07,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:44:07,394 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:07,394 INFO L399 BasicCegarLoop]: trace histogram [10, 2, 1, 1, 1] [2019-08-05 10:44:07,394 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:07,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:07,394 INFO L82 PathProgramCache]: Analyzing trace with hash 835873802, now seen corresponding path program 21 times [2019-08-05 10:44:07,395 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:07,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:07,401 WARN L254 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 10:44:07,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:07,582 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 1 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:07,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:07,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:44:07,583 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:44:07,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:44:07,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:44:07,584 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand 16 states. [2019-08-05 10:44:07,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:07,697 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2019-08-05 10:44:07,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:44:07,697 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 15 [2019-08-05 10:44:07,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:07,698 INFO L225 Difference]: With dead ends: 24 [2019-08-05 10:44:07,698 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 10:44:07,698 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:44:07,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 10:44:07,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-05 10:44:07,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 10:44:07,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-08-05 10:44:07,700 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 15 [2019-08-05 10:44:07,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:07,701 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-08-05 10:44:07,701 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:44:07,701 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2019-08-05 10:44:07,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:44:07,701 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:07,701 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2019-08-05 10:44:07,702 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:07,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:07,702 INFO L82 PathProgramCache]: Analyzing trace with hash 139913936, now seen corresponding path program 13 times [2019-08-05 10:44:07,703 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:07,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:07,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 10:44:07,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:08,452 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:08,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:08,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:44:08,453 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:44:08,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:44:08,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:44:08,454 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 17 states. [2019-08-05 10:44:08,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:08,644 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2019-08-05 10:44:08,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:44:08,645 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2019-08-05 10:44:08,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:08,646 INFO L225 Difference]: With dead ends: 28 [2019-08-05 10:44:08,646 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 10:44:08,647 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:44:08,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 10:44:08,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 22. [2019-08-05 10:44:08,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 10:44:08,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2019-08-05 10:44:08,649 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 16 [2019-08-05 10:44:08,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:08,649 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2019-08-05 10:44:08,649 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:44:08,649 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2019-08-05 10:44:08,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:44:08,650 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:08,650 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1] [2019-08-05 10:44:08,650 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:08,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:08,650 INFO L82 PathProgramCache]: Analyzing trace with hash 139916323, now seen corresponding path program 22 times [2019-08-05 10:44:08,651 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:08,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:08,658 WARN L254 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 10:44:08,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:08,862 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:08,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:08,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:44:08,863 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:44:08,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:44:08,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:44:08,863 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand 17 states. [2019-08-05 10:44:09,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:09,089 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2019-08-05 10:44:09,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:44:09,090 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2019-08-05 10:44:09,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:09,090 INFO L225 Difference]: With dead ends: 27 [2019-08-05 10:44:09,090 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 10:44:09,091 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:44:09,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 10:44:09,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2019-08-05 10:44:09,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 10:44:09,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2019-08-05 10:44:09,093 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 16 [2019-08-05 10:44:09,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:09,093 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2019-08-05 10:44:09,093 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:44:09,093 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2019-08-05 10:44:09,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:44:09,094 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:09,094 INFO L399 BasicCegarLoop]: trace histogram [11, 2, 1, 1, 1] [2019-08-05 10:44:09,094 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:09,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:09,095 INFO L82 PathProgramCache]: Analyzing trace with hash 139990320, now seen corresponding path program 23 times [2019-08-05 10:44:09,095 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:09,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:09,103 WARN L254 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 10:44:09,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:09,528 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 1 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:09,529 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:09,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:44:09,529 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:44:09,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:44:09,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:44:09,530 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand 17 states. [2019-08-05 10:44:09,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:09,682 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2019-08-05 10:44:09,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:44:09,683 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2019-08-05 10:44:09,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:09,683 INFO L225 Difference]: With dead ends: 25 [2019-08-05 10:44:09,683 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 10:44:09,684 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:44:09,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 10:44:09,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-05 10:44:09,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 10:44:09,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2019-08-05 10:44:09,686 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 16 [2019-08-05 10:44:09,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:09,686 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-08-05 10:44:09,686 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:44:09,687 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2019-08-05 10:44:09,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:44:09,687 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:09,687 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2019-08-05 10:44:09,687 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:09,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:09,688 INFO L82 PathProgramCache]: Analyzing trace with hash 42362474, now seen corresponding path program 14 times [2019-08-05 10:44:09,689 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:09,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:09,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 10:44:09,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:10,755 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:10,756 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:10,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:44:10,756 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:44:10,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:44:10,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:44:10,757 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 18 states. [2019-08-05 10:44:11,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:11,043 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2019-08-05 10:44:11,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:44:11,043 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 17 [2019-08-05 10:44:11,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:11,044 INFO L225 Difference]: With dead ends: 29 [2019-08-05 10:44:11,044 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 10:44:11,045 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:44:11,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 10:44:11,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 23. [2019-08-05 10:44:11,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 10:44:11,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2019-08-05 10:44:11,047 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 17 [2019-08-05 10:44:11,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:11,047 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2019-08-05 10:44:11,047 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:44:11,047 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2019-08-05 10:44:11,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:44:11,048 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:11,048 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1] [2019-08-05 10:44:11,048 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:11,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:11,048 INFO L82 PathProgramCache]: Analyzing trace with hash 42364861, now seen corresponding path program 24 times [2019-08-05 10:44:11,049 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:11,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:11,056 WARN L254 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 10:44:11,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:11,344 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:11,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:11,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:44:11,345 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:44:11,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:44:11,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:44:11,346 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand 18 states. [2019-08-05 10:44:11,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:11,544 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2019-08-05 10:44:11,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:44:11,544 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 17 [2019-08-05 10:44:11,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:11,545 INFO L225 Difference]: With dead ends: 28 [2019-08-05 10:44:11,545 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 10:44:11,546 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:44:11,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 10:44:11,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 23. [2019-08-05 10:44:11,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 10:44:11,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2019-08-05 10:44:11,548 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 17 [2019-08-05 10:44:11,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:11,548 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2019-08-05 10:44:11,548 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:44:11,548 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2019-08-05 10:44:11,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:44:11,549 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:11,549 INFO L399 BasicCegarLoop]: trace histogram [12, 2, 1, 1, 1] [2019-08-05 10:44:11,549 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:11,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:11,549 INFO L82 PathProgramCache]: Analyzing trace with hash 42438858, now seen corresponding path program 25 times [2019-08-05 10:44:11,550 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:11,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:11,557 WARN L254 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 10:44:11,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:11,797 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 1 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:11,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:11,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:44:11,798 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:44:11,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:44:11,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:44:11,799 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand 18 states. [2019-08-05 10:44:12,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:12,169 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2019-08-05 10:44:12,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:44:12,171 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 17 [2019-08-05 10:44:12,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:12,172 INFO L225 Difference]: With dead ends: 26 [2019-08-05 10:44:12,172 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 10:44:12,172 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:44:12,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 10:44:12,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-05 10:44:12,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 10:44:12,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2019-08-05 10:44:12,174 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 17 [2019-08-05 10:44:12,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:12,175 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2019-08-05 10:44:12,175 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:44:12,175 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2019-08-05 10:44:12,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:44:12,175 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:12,175 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2019-08-05 10:44:12,175 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:12,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:12,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1313234448, now seen corresponding path program 15 times [2019-08-05 10:44:12,176 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:12,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:12,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 10:44:12,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:12,400 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:12,401 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:12,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:44:12,401 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:44:12,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:44:12,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:44:12,402 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 19 states. [2019-08-05 10:44:12,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:12,606 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2019-08-05 10:44:12,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:44:12,607 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 18 [2019-08-05 10:44:12,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:12,607 INFO L225 Difference]: With dead ends: 30 [2019-08-05 10:44:12,607 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 10:44:12,608 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:44:12,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 10:44:12,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2019-08-05 10:44:12,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 10:44:12,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2019-08-05 10:44:12,610 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 18 [2019-08-05 10:44:12,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:12,611 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2019-08-05 10:44:12,611 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:44:12,611 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2019-08-05 10:44:12,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:44:12,611 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:12,611 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1] [2019-08-05 10:44:12,612 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:12,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:12,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1313236835, now seen corresponding path program 26 times [2019-08-05 10:44:12,612 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:12,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:12,619 WARN L254 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 10:44:12,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:12,924 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:12,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:12,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:44:12,925 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:44:12,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:44:12,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:44:12,926 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand 19 states. [2019-08-05 10:44:13,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:13,145 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2019-08-05 10:44:13,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:44:13,145 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 18 [2019-08-05 10:44:13,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:13,146 INFO L225 Difference]: With dead ends: 29 [2019-08-05 10:44:13,146 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 10:44:13,146 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:44:13,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 10:44:13,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2019-08-05 10:44:13,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 10:44:13,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2019-08-05 10:44:13,148 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 18 [2019-08-05 10:44:13,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:13,148 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2019-08-05 10:44:13,149 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:44:13,149 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2019-08-05 10:44:13,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:44:13,149 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:13,149 INFO L399 BasicCegarLoop]: trace histogram [13, 2, 1, 1, 1] [2019-08-05 10:44:13,149 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:13,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:13,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1313310832, now seen corresponding path program 27 times [2019-08-05 10:44:13,150 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:13,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:13,157 WARN L254 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 10:44:13,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:13,367 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 1 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:13,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:13,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:44:13,368 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:44:13,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:44:13,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:44:13,369 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand 19 states. [2019-08-05 10:44:13,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:13,578 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2019-08-05 10:44:13,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:44:13,578 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 18 [2019-08-05 10:44:13,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:13,579 INFO L225 Difference]: With dead ends: 27 [2019-08-05 10:44:13,579 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 10:44:13,580 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:44:13,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 10:44:13,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-05 10:44:13,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 10:44:13,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2019-08-05 10:44:13,582 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 18 [2019-08-05 10:44:13,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:13,582 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2019-08-05 10:44:13,582 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:44:13,582 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2019-08-05 10:44:13,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:44:13,583 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:13,583 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2019-08-05 10:44:13,583 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:13,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:13,583 INFO L82 PathProgramCache]: Analyzing trace with hash 2055559978, now seen corresponding path program 16 times [2019-08-05 10:44:13,584 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:13,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:13,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 10:44:13,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:13,957 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:13,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:13,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:44:13,958 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:44:13,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:44:13,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:44:13,959 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand 20 states. [2019-08-05 10:44:14,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:14,336 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2019-08-05 10:44:14,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:44:14,336 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2019-08-05 10:44:14,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:14,336 INFO L225 Difference]: With dead ends: 31 [2019-08-05 10:44:14,337 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 10:44:14,337 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:44:14,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 10:44:14,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2019-08-05 10:44:14,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 10:44:14,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2019-08-05 10:44:14,338 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 19 [2019-08-05 10:44:14,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:14,338 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2019-08-05 10:44:14,338 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:44:14,338 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2019-08-05 10:44:14,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:44:14,338 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:14,339 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1] [2019-08-05 10:44:14,339 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:14,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:14,339 INFO L82 PathProgramCache]: Analyzing trace with hash 2055562365, now seen corresponding path program 28 times [2019-08-05 10:44:14,339 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:14,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:14,345 WARN L254 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 10:44:14,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:14,637 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:14,638 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:14,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:44:14,638 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:44:14,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:44:14,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=341, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:44:14,639 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand 20 states. [2019-08-05 10:44:14,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:14,864 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2019-08-05 10:44:14,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:44:14,865 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2019-08-05 10:44:14,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:14,865 INFO L225 Difference]: With dead ends: 30 [2019-08-05 10:44:14,865 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 10:44:14,866 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=341, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:44:14,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 10:44:14,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2019-08-05 10:44:14,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 10:44:14,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2019-08-05 10:44:14,868 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 19 [2019-08-05 10:44:14,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:14,868 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2019-08-05 10:44:14,868 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:44:14,868 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2019-08-05 10:44:14,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:44:14,868 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:14,868 INFO L399 BasicCegarLoop]: trace histogram [14, 2, 1, 1, 1] [2019-08-05 10:44:14,869 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:14,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:14,869 INFO L82 PathProgramCache]: Analyzing trace with hash 2055636362, now seen corresponding path program 29 times [2019-08-05 10:44:14,869 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:14,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:14,875 WARN L254 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 10:44:14,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:15,233 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 1 proven. 107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:15,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:15,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:44:15,234 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:44:15,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:44:15,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:44:15,235 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand 20 states. [2019-08-05 10:44:15,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:15,449 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2019-08-05 10:44:15,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:44:15,450 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2019-08-05 10:44:15,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:15,450 INFO L225 Difference]: With dead ends: 28 [2019-08-05 10:44:15,451 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 10:44:15,451 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:44:15,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 10:44:15,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-05 10:44:15,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 10:44:15,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2019-08-05 10:44:15,453 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 19 [2019-08-05 10:44:15,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:15,454 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2019-08-05 10:44:15,454 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:44:15,454 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2019-08-05 10:44:15,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:44:15,454 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:15,454 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2019-08-05 10:44:15,455 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:15,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:15,455 INFO L82 PathProgramCache]: Analyzing trace with hash -702152368, now seen corresponding path program 17 times [2019-08-05 10:44:15,455 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:15,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:15,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-05 10:44:15,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:15,706 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:15,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:15,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:44:15,707 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:44:15,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:44:15,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=380, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:44:15,707 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 21 states. [2019-08-05 10:44:15,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:15,966 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2019-08-05 10:44:15,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:44:15,967 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 20 [2019-08-05 10:44:15,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:15,967 INFO L225 Difference]: With dead ends: 32 [2019-08-05 10:44:15,968 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 10:44:15,968 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=380, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:44:15,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 10:44:15,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 26. [2019-08-05 10:44:15,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 10:44:15,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2019-08-05 10:44:15,971 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 20 [2019-08-05 10:44:15,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:15,971 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2019-08-05 10:44:15,971 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:44:15,971 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2019-08-05 10:44:15,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:44:15,972 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:15,972 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1] [2019-08-05 10:44:15,974 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:15,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:15,974 INFO L82 PathProgramCache]: Analyzing trace with hash -702149981, now seen corresponding path program 30 times [2019-08-05 10:44:15,974 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:15,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:15,984 WARN L254 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 10:44:15,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:16,280 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 0 proven. 137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:16,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:16,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:44:16,281 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:44:16,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:44:16,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=379, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:44:16,282 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand 21 states. [2019-08-05 10:44:16,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:16,531 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2019-08-05 10:44:16,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:44:16,532 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 20 [2019-08-05 10:44:16,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:16,532 INFO L225 Difference]: With dead ends: 31 [2019-08-05 10:44:16,532 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 10:44:16,533 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=379, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:44:16,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 10:44:16,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. [2019-08-05 10:44:16,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 10:44:16,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2019-08-05 10:44:16,535 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 20 [2019-08-05 10:44:16,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:16,536 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2019-08-05 10:44:16,536 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:44:16,536 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2019-08-05 10:44:16,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:44:16,536 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:16,536 INFO L399 BasicCegarLoop]: trace histogram [15, 2, 1, 1, 1] [2019-08-05 10:44:16,536 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:16,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:16,537 INFO L82 PathProgramCache]: Analyzing trace with hash -702075984, now seen corresponding path program 31 times [2019-08-05 10:44:16,537 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:16,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:16,543 WARN L254 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 10:44:16,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:16,800 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 1 proven. 122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:16,800 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:16,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:44:16,801 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:44:16,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:44:16,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=377, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:44:16,802 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand 21 states. [2019-08-05 10:44:17,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:17,045 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2019-08-05 10:44:17,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:44:17,045 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 20 [2019-08-05 10:44:17,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:17,046 INFO L225 Difference]: With dead ends: 29 [2019-08-05 10:44:17,046 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 10:44:17,047 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=377, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:44:17,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 10:44:17,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-08-05 10:44:17,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 10:44:17,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2019-08-05 10:44:17,049 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 20 [2019-08-05 10:44:17,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:17,049 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2019-08-05 10:44:17,050 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:44:17,050 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2019-08-05 10:44:17,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:44:17,050 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:17,050 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2019-08-05 10:44:17,051 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:17,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:17,051 INFO L82 PathProgramCache]: Analyzing trace with hash -291889174, now seen corresponding path program 18 times [2019-08-05 10:44:17,052 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:17,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:17,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 10:44:17,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:17,392 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:17,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:17,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:44:17,393 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:44:17,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:44:17,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=420, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:44:17,394 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 22 states. [2019-08-05 10:44:17,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:17,707 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2019-08-05 10:44:17,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:44:17,708 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 21 [2019-08-05 10:44:17,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:17,708 INFO L225 Difference]: With dead ends: 33 [2019-08-05 10:44:17,709 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 10:44:17,709 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=420, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:44:17,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 10:44:17,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2019-08-05 10:44:17,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 10:44:17,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2019-08-05 10:44:17,711 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 21 [2019-08-05 10:44:17,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:17,711 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2019-08-05 10:44:17,711 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:44:17,711 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2019-08-05 10:44:17,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:44:17,712 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:17,712 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1, 1] [2019-08-05 10:44:17,712 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:17,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:17,712 INFO L82 PathProgramCache]: Analyzing trace with hash -291886787, now seen corresponding path program 32 times [2019-08-05 10:44:17,713 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:17,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:17,719 WARN L254 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 10:44:17,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:18,106 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:18,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:18,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:44:18,107 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:44:18,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:44:18,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=419, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:44:18,108 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand 22 states. [2019-08-05 10:44:18,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:18,373 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2019-08-05 10:44:18,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:44:18,374 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 21 [2019-08-05 10:44:18,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:18,374 INFO L225 Difference]: With dead ends: 32 [2019-08-05 10:44:18,374 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 10:44:18,375 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=419, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:44:18,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 10:44:18,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 27. [2019-08-05 10:44:18,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 10:44:18,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2019-08-05 10:44:18,377 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 21 [2019-08-05 10:44:18,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:18,377 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2019-08-05 10:44:18,377 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:44:18,377 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2019-08-05 10:44:18,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:44:18,378 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:18,378 INFO L399 BasicCegarLoop]: trace histogram [16, 2, 1, 1, 1] [2019-08-05 10:44:18,378 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:18,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:18,379 INFO L82 PathProgramCache]: Analyzing trace with hash -291812790, now seen corresponding path program 33 times [2019-08-05 10:44:18,379 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:18,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:18,386 WARN L254 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-05 10:44:18,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:18,661 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 1 proven. 138 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:18,662 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:18,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:44:18,662 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:44:18,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:44:18,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=417, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:44:18,663 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand 22 states. [2019-08-05 10:44:18,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:18,912 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2019-08-05 10:44:18,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:44:18,913 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 21 [2019-08-05 10:44:18,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:18,914 INFO L225 Difference]: With dead ends: 30 [2019-08-05 10:44:18,914 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 10:44:18,914 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=417, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:44:18,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 10:44:18,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-08-05 10:44:18,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 10:44:18,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2019-08-05 10:44:18,915 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 21 [2019-08-05 10:44:18,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:18,915 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-08-05 10:44:18,915 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:44:18,915 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2019-08-05 10:44:18,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:44:18,916 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:18,916 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2019-08-05 10:44:18,916 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:18,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:18,916 INFO L82 PathProgramCache]: Analyzing trace with hash -458632048, now seen corresponding path program 19 times [2019-08-05 10:44:18,917 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:18,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:18,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 10:44:18,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:19,316 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:19,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:19,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:44:19,317 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:44:19,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:44:19,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=462, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:44:19,318 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 23 states. [2019-08-05 10:44:19,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:19,716 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2019-08-05 10:44:19,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:44:19,716 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 22 [2019-08-05 10:44:19,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:19,717 INFO L225 Difference]: With dead ends: 34 [2019-08-05 10:44:19,717 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 10:44:19,718 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=462, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:44:19,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 10:44:19,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 28. [2019-08-05 10:44:19,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:44:19,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2019-08-05 10:44:19,720 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 22 [2019-08-05 10:44:19,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:19,720 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2019-08-05 10:44:19,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:44:19,721 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2019-08-05 10:44:19,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:44:19,721 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:19,721 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1, 1] [2019-08-05 10:44:19,722 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:19,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:19,722 INFO L82 PathProgramCache]: Analyzing trace with hash -458629661, now seen corresponding path program 34 times [2019-08-05 10:44:19,722 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:19,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:19,729 WARN L254 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 10:44:19,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:20,179 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:20,179 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:20,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:44:20,179 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:44:20,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:44:20,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=461, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:44:20,180 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand 23 states. [2019-08-05 10:44:20,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:20,505 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2019-08-05 10:44:20,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:44:20,505 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 22 [2019-08-05 10:44:20,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:20,506 INFO L225 Difference]: With dead ends: 33 [2019-08-05 10:44:20,506 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 10:44:20,506 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=461, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:44:20,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 10:44:20,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2019-08-05 10:44:20,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:44:20,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2019-08-05 10:44:20,508 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 22 [2019-08-05 10:44:20,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:20,508 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2019-08-05 10:44:20,508 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:44:20,508 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2019-08-05 10:44:20,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:44:20,509 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:20,509 INFO L399 BasicCegarLoop]: trace histogram [17, 2, 1, 1, 1] [2019-08-05 10:44:20,509 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:20,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:20,509 INFO L82 PathProgramCache]: Analyzing trace with hash -458555664, now seen corresponding path program 35 times [2019-08-05 10:44:20,510 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:20,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:20,517 WARN L254 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 10:44:20,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:20,836 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 1 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:20,836 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:20,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:44:20,837 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:44:20,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:44:20,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=459, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:44:20,837 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand 23 states. [2019-08-05 10:44:21,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:21,114 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2019-08-05 10:44:21,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:44:21,115 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 22 [2019-08-05 10:44:21,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:21,115 INFO L225 Difference]: With dead ends: 31 [2019-08-05 10:44:21,116 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 10:44:21,116 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=459, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:44:21,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 10:44:21,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-05 10:44:21,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:44:21,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-08-05 10:44:21,118 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 22 [2019-08-05 10:44:21,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:21,118 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-08-05 10:44:21,118 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:44:21,118 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-08-05 10:44:21,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:44:21,118 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:21,119 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2019-08-05 10:44:21,119 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:21,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:21,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1332693846, now seen corresponding path program 20 times [2019-08-05 10:44:21,120 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:21,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:21,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 10:44:21,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:21,480 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:21,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:21,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:44:21,481 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:44:21,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:44:21,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=506, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:44:21,481 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 24 states. [2019-08-05 10:44:21,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:21,811 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2019-08-05 10:44:21,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:44:21,812 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 23 [2019-08-05 10:44:21,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:21,812 INFO L225 Difference]: With dead ends: 35 [2019-08-05 10:44:21,812 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 10:44:21,813 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=506, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:44:21,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 10:44:21,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2019-08-05 10:44:21,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 10:44:21,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2019-08-05 10:44:21,815 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 23 [2019-08-05 10:44:21,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:21,816 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2019-08-05 10:44:21,816 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:44:21,816 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2019-08-05 10:44:21,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:44:21,816 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:21,816 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1, 1] [2019-08-05 10:44:21,817 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:21,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:21,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1332691459, now seen corresponding path program 36 times [2019-08-05 10:44:21,817 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:21,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:21,825 WARN L254 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 10:44:21,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:22,127 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 0 proven. 191 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:22,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:22,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:44:22,128 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:44:22,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:44:22,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=505, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:44:22,128 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand 24 states. [2019-08-05 10:44:22,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:22,480 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2019-08-05 10:44:22,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:44:22,480 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 23 [2019-08-05 10:44:22,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:22,481 INFO L225 Difference]: With dead ends: 34 [2019-08-05 10:44:22,481 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 10:44:22,481 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=505, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:44:22,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 10:44:22,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. [2019-08-05 10:44:22,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 10:44:22,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2019-08-05 10:44:22,483 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 23 [2019-08-05 10:44:22,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:22,483 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2019-08-05 10:44:22,483 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:44:22,484 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2019-08-05 10:44:22,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:44:22,484 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:22,484 INFO L399 BasicCegarLoop]: trace histogram [18, 2, 1, 1, 1] [2019-08-05 10:44:22,484 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:22,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:22,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1332617462, now seen corresponding path program 37 times [2019-08-05 10:44:22,485 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:22,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:22,492 WARN L254 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 10:44:22,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:22,812 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 1 proven. 173 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:22,812 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:22,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:44:22,813 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:44:22,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:44:22,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=503, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:44:22,813 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand 24 states. [2019-08-05 10:44:23,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:23,099 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2019-08-05 10:44:23,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:44:23,099 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 23 [2019-08-05 10:44:23,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:23,100 INFO L225 Difference]: With dead ends: 32 [2019-08-05 10:44:23,100 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 10:44:23,100 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=503, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:44:23,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 10:44:23,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-05 10:44:23,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 10:44:23,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2019-08-05 10:44:23,102 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 23 [2019-08-05 10:44:23,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:23,102 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-08-05 10:44:23,102 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:44:23,102 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2019-08-05 10:44:23,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:44:23,103 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:23,103 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2019-08-05 10:44:23,103 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:23,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:23,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1636161488, now seen corresponding path program 21 times [2019-08-05 10:44:23,104 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:23,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:23,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-05 10:44:23,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:23,693 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:23,693 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:23,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:44:23,694 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:44:23,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:44:23,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=552, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:44:23,694 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 25 states. [2019-08-05 10:44:24,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:24,054 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2019-08-05 10:44:24,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:44:24,055 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 24 [2019-08-05 10:44:24,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:24,055 INFO L225 Difference]: With dead ends: 36 [2019-08-05 10:44:24,055 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 10:44:24,056 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=552, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:44:24,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 10:44:24,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2019-08-05 10:44:24,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 10:44:24,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2019-08-05 10:44:24,058 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 24 [2019-08-05 10:44:24,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:24,058 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2019-08-05 10:44:24,058 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:44:24,058 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2019-08-05 10:44:24,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:44:24,059 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:24,059 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1, 1] [2019-08-05 10:44:24,059 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:24,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:24,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1636163875, now seen corresponding path program 38 times [2019-08-05 10:44:24,063 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:24,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:24,070 WARN L254 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-05 10:44:24,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:24,644 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 0 proven. 211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:24,644 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:24,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:44:24,645 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:44:24,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:44:24,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=551, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:44:24,645 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand 25 states. [2019-08-05 10:44:24,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:24,996 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2019-08-05 10:44:24,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:44:24,997 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 24 [2019-08-05 10:44:24,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:24,997 INFO L225 Difference]: With dead ends: 35 [2019-08-05 10:44:24,997 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 10:44:24,998 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=49, Invalid=551, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:44:24,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 10:44:24,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 30. [2019-08-05 10:44:24,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 10:44:25,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2019-08-05 10:44:25,000 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 24 [2019-08-05 10:44:25,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:25,000 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2019-08-05 10:44:25,000 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:44:25,001 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2019-08-05 10:44:25,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:44:25,001 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:25,001 INFO L399 BasicCegarLoop]: trace histogram [19, 2, 1, 1, 1] [2019-08-05 10:44:25,001 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:25,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:25,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1636237872, now seen corresponding path program 39 times [2019-08-05 10:44:25,002 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:25,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:25,009 WARN L254 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 10:44:25,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:25,528 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 1 proven. 192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:25,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:25,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:44:25,529 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:44:25,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:44:25,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=549, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:44:25,530 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand 25 states. [2019-08-05 10:44:25,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:25,837 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2019-08-05 10:44:25,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:44:25,838 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 24 [2019-08-05 10:44:25,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:25,839 INFO L225 Difference]: With dead ends: 33 [2019-08-05 10:44:25,839 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 10:44:25,839 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=51, Invalid=549, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:44:25,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 10:44:25,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-08-05 10:44:25,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 10:44:25,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2019-08-05 10:44:25,841 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 24 [2019-08-05 10:44:25,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:25,842 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2019-08-05 10:44:25,842 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:44:25,842 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2019-08-05 10:44:25,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:44:25,843 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:25,843 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2019-08-05 10:44:25,843 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:25,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:25,844 INFO L82 PathProgramCache]: Analyzing trace with hash -818603670, now seen corresponding path program 22 times [2019-08-05 10:44:25,844 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:25,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:25,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 10:44:25,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:26,264 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:26,265 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:26,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:44:26,265 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:44:26,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:44:26,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=600, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:44:26,266 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 26 states. [2019-08-05 10:44:26,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:26,663 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2019-08-05 10:44:26,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:44:26,663 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 25 [2019-08-05 10:44:26,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:26,664 INFO L225 Difference]: With dead ends: 37 [2019-08-05 10:44:26,664 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 10:44:26,665 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=600, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:44:26,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 10:44:26,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 31. [2019-08-05 10:44:26,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 10:44:26,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2019-08-05 10:44:26,667 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 25 [2019-08-05 10:44:26,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:26,667 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2019-08-05 10:44:26,667 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:44:26,668 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2019-08-05 10:44:26,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:44:26,668 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:26,668 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1, 1] [2019-08-05 10:44:26,668 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:26,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:26,669 INFO L82 PathProgramCache]: Analyzing trace with hash -818601283, now seen corresponding path program 40 times [2019-08-05 10:44:26,669 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:26,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:26,677 WARN L254 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 10:44:26,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:27,163 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 0 proven. 232 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:27,163 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:27,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:44:27,164 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:44:27,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:44:27,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=599, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:44:27,165 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand 26 states. [2019-08-05 10:44:27,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:27,561 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2019-08-05 10:44:27,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:44:27,562 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 25 [2019-08-05 10:44:27,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:27,562 INFO L225 Difference]: With dead ends: 36 [2019-08-05 10:44:27,562 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 10:44:27,563 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=599, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:44:27,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 10:44:27,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2019-08-05 10:44:27,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 10:44:27,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2019-08-05 10:44:27,565 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 25 [2019-08-05 10:44:27,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:27,565 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2019-08-05 10:44:27,565 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:44:27,565 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2019-08-05 10:44:27,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:44:27,566 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:27,566 INFO L399 BasicCegarLoop]: trace histogram [20, 2, 1, 1, 1] [2019-08-05 10:44:27,566 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:27,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:27,566 INFO L82 PathProgramCache]: Analyzing trace with hash -818527286, now seen corresponding path program 41 times [2019-08-05 10:44:27,567 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:27,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:27,574 WARN L254 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-05 10:44:27,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:28,153 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 1 proven. 212 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:28,154 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:28,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:44:28,154 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:44:28,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:44:28,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=597, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:44:28,155 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand 26 states. [2019-08-05 10:44:28,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:28,522 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2019-08-05 10:44:28,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:44:28,522 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 25 [2019-08-05 10:44:28,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:28,523 INFO L225 Difference]: With dead ends: 34 [2019-08-05 10:44:28,523 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 10:44:28,523 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=53, Invalid=597, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:44:28,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 10:44:28,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-05 10:44:28,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 10:44:28,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2019-08-05 10:44:28,525 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 25 [2019-08-05 10:44:28,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:28,525 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-08-05 10:44:28,525 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:44:28,525 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2019-08-05 10:44:28,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:44:28,526 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:28,526 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2019-08-05 10:44:28,526 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:28,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:28,526 INFO L82 PathProgramCache]: Analyzing trace with hash 393087760, now seen corresponding path program 23 times [2019-08-05 10:44:28,527 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:28,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:28,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-05 10:44:28,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:29,482 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:29,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:29,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:44:29,482 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:44:29,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:44:29,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=650, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:44:29,483 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 27 states. [2019-08-05 10:44:30,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:30,097 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2019-08-05 10:44:30,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:44:30,097 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 26 [2019-08-05 10:44:30,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:30,098 INFO L225 Difference]: With dead ends: 38 [2019-08-05 10:44:30,098 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 10:44:30,099 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=52, Invalid=650, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:44:30,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 10:44:30,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2019-08-05 10:44:30,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 10:44:30,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2019-08-05 10:44:30,100 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 26 [2019-08-05 10:44:30,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:30,101 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2019-08-05 10:44:30,101 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:44:30,101 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2019-08-05 10:44:30,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:44:30,101 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:30,101 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1] [2019-08-05 10:44:30,102 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:30,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:30,102 INFO L82 PathProgramCache]: Analyzing trace with hash 393090147, now seen corresponding path program 42 times [2019-08-05 10:44:30,103 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:30,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:30,110 WARN L254 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 10:44:30,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:30,516 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 0 proven. 254 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:30,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:30,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:44:30,517 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:44:30,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:44:30,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=649, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:44:30,517 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand 27 states. [2019-08-05 10:44:30,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:30,927 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2019-08-05 10:44:30,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:44:30,928 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 26 [2019-08-05 10:44:30,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:30,928 INFO L225 Difference]: With dead ends: 37 [2019-08-05 10:44:30,928 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 10:44:30,929 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=649, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:44:30,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 10:44:30,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 32. [2019-08-05 10:44:30,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 10:44:30,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2019-08-05 10:44:30,930 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 26 [2019-08-05 10:44:30,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:30,931 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2019-08-05 10:44:30,931 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:44:30,931 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2019-08-05 10:44:30,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:44:30,931 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:30,932 INFO L399 BasicCegarLoop]: trace histogram [21, 2, 1, 1, 1] [2019-08-05 10:44:30,932 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:30,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:30,932 INFO L82 PathProgramCache]: Analyzing trace with hash 393164144, now seen corresponding path program 43 times [2019-08-05 10:44:30,933 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:30,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:30,940 WARN L254 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 10:44:30,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:31,415 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 1 proven. 233 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:31,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:31,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:44:31,416 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:44:31,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:44:31,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=647, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:44:31,417 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand 27 states. [2019-08-05 10:44:31,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:31,791 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2019-08-05 10:44:31,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:44:31,791 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 26 [2019-08-05 10:44:31,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:31,792 INFO L225 Difference]: With dead ends: 35 [2019-08-05 10:44:31,792 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 10:44:31,792 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=647, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:44:31,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 10:44:31,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-08-05 10:44:31,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 10:44:31,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2019-08-05 10:44:31,794 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 26 [2019-08-05 10:44:31,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:31,794 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2019-08-05 10:44:31,794 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:44:31,795 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2019-08-05 10:44:31,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:44:31,795 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:31,795 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2019-08-05 10:44:31,795 INFO L418 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:31,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:31,796 INFO L82 PathProgramCache]: Analyzing trace with hash -699183574, now seen corresponding path program 24 times [2019-08-05 10:44:31,796 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:31,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:31,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-05 10:44:31,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:32,177 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:32,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:32,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:44:32,177 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:44:32,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:44:32,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=702, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:44:32,178 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 28 states. [2019-08-05 10:44:32,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:32,637 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2019-08-05 10:44:32,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:44:32,638 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 27 [2019-08-05 10:44:32,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:32,639 INFO L225 Difference]: With dead ends: 39 [2019-08-05 10:44:32,639 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 10:44:32,639 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=702, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:44:32,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 10:44:32,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2019-08-05 10:44:32,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 10:44:32,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2019-08-05 10:44:32,641 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 27 [2019-08-05 10:44:32,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:32,642 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2019-08-05 10:44:32,642 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:44:32,642 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2019-08-05 10:44:32,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:44:32,642 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:32,642 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1, 1, 1] [2019-08-05 10:44:32,643 INFO L418 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:32,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:32,643 INFO L82 PathProgramCache]: Analyzing trace with hash -699181187, now seen corresponding path program 44 times [2019-08-05 10:44:32,643 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:32,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:32,652 WARN L254 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-05 10:44:32,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:33,040 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 0 proven. 277 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:33,040 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:33,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:44:33,041 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:44:33,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:44:33,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=701, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:44:33,041 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand 28 states. [2019-08-05 10:44:33,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:33,512 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2019-08-05 10:44:33,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:44:33,512 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 27 [2019-08-05 10:44:33,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:33,513 INFO L225 Difference]: With dead ends: 38 [2019-08-05 10:44:33,513 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 10:44:33,513 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=701, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:44:33,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 10:44:33,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 33. [2019-08-05 10:44:33,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 10:44:33,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2019-08-05 10:44:33,515 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 27 [2019-08-05 10:44:33,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:33,515 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2019-08-05 10:44:33,515 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:44:33,515 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2019-08-05 10:44:33,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:44:33,516 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:33,516 INFO L399 BasicCegarLoop]: trace histogram [22, 2, 1, 1, 1] [2019-08-05 10:44:33,516 INFO L418 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:33,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:33,516 INFO L82 PathProgramCache]: Analyzing trace with hash -699107190, now seen corresponding path program 45 times [2019-08-05 10:44:33,517 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:33,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:33,525 WARN L254 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-05 10:44:33,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:34,002 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 1 proven. 255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:34,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:34,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:44:34,003 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:44:34,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:44:34,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=699, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:44:34,003 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand 28 states. [2019-08-05 10:44:34,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:34,402 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2019-08-05 10:44:34,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:44:34,403 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 27 [2019-08-05 10:44:34,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:34,403 INFO L225 Difference]: With dead ends: 36 [2019-08-05 10:44:34,403 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 10:44:34,404 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=57, Invalid=699, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:44:34,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 10:44:34,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-08-05 10:44:34,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 10:44:34,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-08-05 10:44:34,405 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 27 [2019-08-05 10:44:34,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:34,406 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-08-05 10:44:34,406 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:44:34,406 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-08-05 10:44:34,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:44:34,406 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:34,406 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2019-08-05 10:44:34,407 INFO L418 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:34,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:34,407 INFO L82 PathProgramCache]: Analyzing trace with hash -199856560, now seen corresponding path program 25 times [2019-08-05 10:44:34,408 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:34,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:34,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-05 10:44:34,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:35,108 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:35,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:35,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 10:44:35,109 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 10:44:35,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 10:44:35,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=756, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:44:35,109 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 29 states. [2019-08-05 10:44:35,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:35,609 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2019-08-05 10:44:35,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:44:35,610 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 28 [2019-08-05 10:44:35,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:35,610 INFO L225 Difference]: With dead ends: 40 [2019-08-05 10:44:35,611 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 10:44:35,611 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=56, Invalid=756, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:44:35,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 10:44:35,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 34. [2019-08-05 10:44:35,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 10:44:35,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2019-08-05 10:44:35,613 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 28 [2019-08-05 10:44:35,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:35,613 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2019-08-05 10:44:35,613 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 10:44:35,613 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2019-08-05 10:44:35,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:44:35,614 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:35,614 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1, 1] [2019-08-05 10:44:35,614 INFO L418 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:35,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:35,614 INFO L82 PathProgramCache]: Analyzing trace with hash -199854173, now seen corresponding path program 46 times [2019-08-05 10:44:35,615 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:35,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:35,624 WARN L254 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 10:44:35,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:36,301 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:36,302 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:36,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 10:44:36,302 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 10:44:36,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 10:44:36,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=755, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:44:36,303 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand 29 states. [2019-08-05 10:44:36,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:36,780 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2019-08-05 10:44:36,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:44:36,781 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 28 [2019-08-05 10:44:36,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:36,781 INFO L225 Difference]: With dead ends: 39 [2019-08-05 10:44:36,781 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 10:44:36,782 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=57, Invalid=755, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:44:36,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 10:44:36,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 34. [2019-08-05 10:44:36,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 10:44:36,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2019-08-05 10:44:36,784 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 28 [2019-08-05 10:44:36,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:36,784 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2019-08-05 10:44:36,784 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 10:44:36,785 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2019-08-05 10:44:36,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:44:36,785 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:36,785 INFO L399 BasicCegarLoop]: trace histogram [23, 2, 1, 1, 1] [2019-08-05 10:44:36,785 INFO L418 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:36,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:36,786 INFO L82 PathProgramCache]: Analyzing trace with hash -199780176, now seen corresponding path program 47 times [2019-08-05 10:44:36,786 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:36,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:36,794 WARN L254 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-05 10:44:36,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:37,196 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 1 proven. 278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:37,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:37,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 10:44:37,197 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 10:44:37,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 10:44:37,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=753, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:44:37,197 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand 29 states. [2019-08-05 10:44:37,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:37,627 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2019-08-05 10:44:37,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:44:37,628 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 28 [2019-08-05 10:44:37,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:37,629 INFO L225 Difference]: With dead ends: 37 [2019-08-05 10:44:37,629 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 10:44:37,629 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=753, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:44:37,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 10:44:37,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-08-05 10:44:37,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 10:44:37,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2019-08-05 10:44:37,631 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 28 [2019-08-05 10:44:37,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:37,631 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2019-08-05 10:44:37,631 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 10:44:37,631 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2019-08-05 10:44:37,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:44:37,632 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:37,632 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2019-08-05 10:44:37,632 INFO L418 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:37,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:37,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1900588310, now seen corresponding path program 26 times [2019-08-05 10:44:37,633 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:37,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:37,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 10:44:37,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:38,076 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:38,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:38,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 10:44:38,077 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:44:38,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:44:38,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=812, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:44:38,077 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 30 states. [2019-08-05 10:44:38,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:38,611 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2019-08-05 10:44:38,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 10:44:38,611 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 29 [2019-08-05 10:44:38,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:38,612 INFO L225 Difference]: With dead ends: 41 [2019-08-05 10:44:38,612 INFO L226 Difference]: Without dead ends: 41 [2019-08-05 10:44:38,612 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=58, Invalid=812, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:44:38,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-05 10:44:38,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 35. [2019-08-05 10:44:38,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 10:44:38,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2019-08-05 10:44:38,614 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 29 [2019-08-05 10:44:38,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:38,615 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2019-08-05 10:44:38,615 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:44:38,615 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2019-08-05 10:44:38,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:44:38,616 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:38,616 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1, 1] [2019-08-05 10:44:38,616 INFO L418 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:38,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:38,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1900585923, now seen corresponding path program 48 times [2019-08-05 10:44:38,617 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:38,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:38,627 WARN L254 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-05 10:44:38,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:39,047 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 0 proven. 326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:39,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:39,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 10:44:39,048 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:44:39,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:44:39,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=811, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:44:39,049 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand 30 states. [2019-08-05 10:44:39,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:39,562 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2019-08-05 10:44:39,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 10:44:39,562 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 29 [2019-08-05 10:44:39,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:39,563 INFO L225 Difference]: With dead ends: 40 [2019-08-05 10:44:39,563 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 10:44:39,563 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=59, Invalid=811, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:44:39,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 10:44:39,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 35. [2019-08-05 10:44:39,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 10:44:39,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2019-08-05 10:44:39,565 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 29 [2019-08-05 10:44:39,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:39,565 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2019-08-05 10:44:39,565 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:44:39,566 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2019-08-05 10:44:39,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:44:39,566 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:39,566 INFO L399 BasicCegarLoop]: trace histogram [24, 2, 1, 1, 1] [2019-08-05 10:44:39,566 INFO L418 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:39,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:39,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1900511926, now seen corresponding path program 49 times [2019-08-05 10:44:39,567 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:39,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:39,581 WARN L254 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-05 10:44:39,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:40,791 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 1 proven. 302 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:40,792 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:40,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 10:44:40,792 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:44:40,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:44:40,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=809, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:44:40,793 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand 30 states. [2019-08-05 10:44:41,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:41,289 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2019-08-05 10:44:41,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:44:41,289 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 29 [2019-08-05 10:44:41,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:41,290 INFO L225 Difference]: With dead ends: 38 [2019-08-05 10:44:41,290 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 10:44:41,290 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=61, Invalid=809, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:44:41,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 10:44:41,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-05 10:44:41,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 10:44:41,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2019-08-05 10:44:41,292 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 29 [2019-08-05 10:44:41,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:41,292 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2019-08-05 10:44:41,292 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:44:41,292 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2019-08-05 10:44:41,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:44:41,293 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:41,293 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2019-08-05 10:44:41,293 INFO L418 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:41,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:41,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1211302288, now seen corresponding path program 27 times [2019-08-05 10:44:41,294 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:41,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:41,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 10:44:41,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:41,792 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:41,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:41,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 10:44:41,793 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 10:44:41,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 10:44:41,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=870, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:44:41,794 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 31 states. [2019-08-05 10:44:42,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:42,363 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2019-08-05 10:44:42,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 10:44:42,364 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 30 [2019-08-05 10:44:42,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:42,364 INFO L225 Difference]: With dead ends: 42 [2019-08-05 10:44:42,365 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 10:44:42,365 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=60, Invalid=870, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:44:42,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 10:44:42,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 36. [2019-08-05 10:44:42,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:44:42,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2019-08-05 10:44:42,367 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 30 [2019-08-05 10:44:42,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:42,367 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2019-08-05 10:44:42,367 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 10:44:42,367 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2019-08-05 10:44:42,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:44:42,367 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:42,368 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1, 1, 1] [2019-08-05 10:44:42,368 INFO L418 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:42,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:42,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1211304675, now seen corresponding path program 50 times [2019-08-05 10:44:42,369 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:42,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:42,378 WARN L254 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-05 10:44:42,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:42,904 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 0 proven. 352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:42,905 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:42,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 10:44:42,905 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 10:44:42,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 10:44:42,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=869, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:44:42,906 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 31 states. [2019-08-05 10:44:43,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:43,452 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2019-08-05 10:44:43,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 10:44:43,453 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 30 [2019-08-05 10:44:43,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:43,453 INFO L225 Difference]: With dead ends: 41 [2019-08-05 10:44:43,453 INFO L226 Difference]: Without dead ends: 41 [2019-08-05 10:44:43,454 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=61, Invalid=869, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:44:43,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-05 10:44:43,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 36. [2019-08-05 10:44:43,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:44:43,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2019-08-05 10:44:43,456 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 30 [2019-08-05 10:44:43,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:43,456 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2019-08-05 10:44:43,456 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 10:44:43,456 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2019-08-05 10:44:43,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:44:43,457 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:43,457 INFO L399 BasicCegarLoop]: trace histogram [25, 2, 1, 1, 1] [2019-08-05 10:44:43,457 INFO L418 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:43,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:43,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1211378672, now seen corresponding path program 51 times [2019-08-05 10:44:43,458 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:43,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:43,466 WARN L254 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 10:44:43,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:43,969 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 1 proven. 327 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:43,969 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:43,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 10:44:43,970 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 10:44:43,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 10:44:43,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=867, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:44:43,970 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 31 states. [2019-08-05 10:44:44,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:44,463 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2019-08-05 10:44:44,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 10:44:44,464 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 30 [2019-08-05 10:44:44,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:44,464 INFO L225 Difference]: With dead ends: 39 [2019-08-05 10:44:44,465 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 10:44:44,465 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=867, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:44:44,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 10:44:44,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-05 10:44:44,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:44:44,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2019-08-05 10:44:44,467 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 30 [2019-08-05 10:44:44,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:44,467 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2019-08-05 10:44:44,467 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 10:44:44,467 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2019-08-05 10:44:44,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 10:44:44,468 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:44,468 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2019-08-05 10:44:44,468 INFO L418 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:44,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:44,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1104336982, now seen corresponding path program 28 times [2019-08-05 10:44:44,469 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:44,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:44,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 10:44:44,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:45,288 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:45,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:45,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 10:44:45,289 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:44:45,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:44:45,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=930, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:44:45,290 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 32 states. [2019-08-05 10:44:45,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:45,916 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2019-08-05 10:44:45,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:44:45,917 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 31 [2019-08-05 10:44:45,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:45,917 INFO L225 Difference]: With dead ends: 43 [2019-08-05 10:44:45,917 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 10:44:45,918 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=62, Invalid=930, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:44:45,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 10:44:45,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 37. [2019-08-05 10:44:45,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 10:44:45,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2019-08-05 10:44:45,920 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 31 [2019-08-05 10:44:45,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:45,920 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2019-08-05 10:44:45,921 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:44:45,921 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2019-08-05 10:44:45,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 10:44:45,921 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:45,922 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1, 1, 1] [2019-08-05 10:44:45,922 INFO L418 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:45,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:45,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1104334595, now seen corresponding path program 52 times [2019-08-05 10:44:45,923 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:45,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:45,931 WARN L254 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-05 10:44:45,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:46,403 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 0 proven. 379 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:46,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:46,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 10:44:46,404 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:44:46,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:44:46,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=929, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:44:46,404 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand 32 states. [2019-08-05 10:44:46,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:46,998 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2019-08-05 10:44:46,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:44:46,998 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 31 [2019-08-05 10:44:46,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:46,999 INFO L225 Difference]: With dead ends: 42 [2019-08-05 10:44:46,999 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 10:44:47,000 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=929, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:44:47,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 10:44:47,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 37. [2019-08-05 10:44:47,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 10:44:47,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2019-08-05 10:44:47,001 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 31 [2019-08-05 10:44:47,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:47,002 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2019-08-05 10:44:47,002 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:44:47,002 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2019-08-05 10:44:47,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 10:44:47,002 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:47,003 INFO L399 BasicCegarLoop]: trace histogram [26, 2, 1, 1, 1] [2019-08-05 10:44:47,003 INFO L418 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:47,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:47,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1104260598, now seen corresponding path program 53 times [2019-08-05 10:44:47,004 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:47,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:47,011 WARN L254 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 10:44:47,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:47,633 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 1 proven. 353 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:47,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:47,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 10:44:47,634 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:44:47,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:44:47,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=927, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:44:47,634 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand 32 states. [2019-08-05 10:44:48,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:48,152 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2019-08-05 10:44:48,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 10:44:48,153 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 31 [2019-08-05 10:44:48,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:48,153 INFO L225 Difference]: With dead ends: 40 [2019-08-05 10:44:48,153 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 10:44:48,154 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=65, Invalid=927, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:44:48,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 10:44:48,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-05 10:44:48,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 10:44:48,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2019-08-05 10:44:48,155 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 31 [2019-08-05 10:44:48,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:48,156 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-08-05 10:44:48,156 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:44:48,156 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2019-08-05 10:44:48,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:44:48,156 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:48,156 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2019-08-05 10:44:48,157 INFO L418 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:48,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:48,157 INFO L82 PathProgramCache]: Analyzing trace with hash 125289680, now seen corresponding path program 29 times [2019-08-05 10:44:48,158 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:48,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:48,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 10:44:48,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:48,700 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:48,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:48,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 10:44:48,701 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 10:44:48,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 10:44:48,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=992, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:44:48,702 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 33 states. [2019-08-05 10:44:49,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:49,324 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2019-08-05 10:44:49,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 10:44:49,325 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 32 [2019-08-05 10:44:49,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:49,326 INFO L225 Difference]: With dead ends: 44 [2019-08-05 10:44:49,326 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 10:44:49,326 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=64, Invalid=992, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:44:49,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 10:44:49,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 38. [2019-08-05 10:44:49,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 10:44:49,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2019-08-05 10:44:49,328 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 32 [2019-08-05 10:44:49,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:49,329 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2019-08-05 10:44:49,329 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 10:44:49,329 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2019-08-05 10:44:49,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:44:49,329 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:49,329 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1] [2019-08-05 10:44:49,330 INFO L418 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:49,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:49,330 INFO L82 PathProgramCache]: Analyzing trace with hash 125292067, now seen corresponding path program 54 times [2019-08-05 10:44:49,330 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:49,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:49,339 WARN L254 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-05 10:44:49,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:49,993 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 0 proven. 407 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:49,994 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:49,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 10:44:49,994 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 10:44:49,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 10:44:49,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=991, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:44:49,995 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand 33 states. [2019-08-05 10:44:50,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:50,795 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2019-08-05 10:44:50,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 10:44:50,796 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 32 [2019-08-05 10:44:50,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:50,797 INFO L225 Difference]: With dead ends: 43 [2019-08-05 10:44:50,797 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 10:44:50,797 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=65, Invalid=991, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:44:50,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 10:44:50,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 38. [2019-08-05 10:44:50,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 10:44:50,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2019-08-05 10:44:50,800 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 32 [2019-08-05 10:44:50,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:50,800 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2019-08-05 10:44:50,800 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 10:44:50,800 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2019-08-05 10:44:50,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:44:50,801 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:50,801 INFO L399 BasicCegarLoop]: trace histogram [27, 2, 1, 1, 1] [2019-08-05 10:44:50,801 INFO L418 AbstractCegarLoop]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:50,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:50,801 INFO L82 PathProgramCache]: Analyzing trace with hash 125366064, now seen corresponding path program 55 times [2019-08-05 10:44:50,802 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:50,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:50,810 WARN L254 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 10:44:50,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:51,554 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 1 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:51,555 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:51,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 10:44:51,555 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 10:44:51,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 10:44:51,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=989, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:44:51,556 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand 33 states. [2019-08-05 10:44:52,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:52,123 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2019-08-05 10:44:52,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:44:52,124 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 32 [2019-08-05 10:44:52,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:52,125 INFO L225 Difference]: With dead ends: 41 [2019-08-05 10:44:52,125 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 10:44:52,125 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=67, Invalid=989, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:44:52,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 10:44:52,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-08-05 10:44:52,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 10:44:52,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2019-08-05 10:44:52,126 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 32 [2019-08-05 10:44:52,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:52,127 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2019-08-05 10:44:52,127 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 10:44:52,127 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2019-08-05 10:44:52,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 10:44:52,127 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:52,127 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2019-08-05 10:44:52,128 INFO L418 AbstractCegarLoop]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:52,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:52,128 INFO L82 PathProgramCache]: Analyzing trace with hash -410989462, now seen corresponding path program 30 times [2019-08-05 10:44:52,128 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:52,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:52,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-05 10:44:52,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:52,736 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:52,737 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:52,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:44:52,737 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:44:52,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:44:52,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=1056, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:44:52,737 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 34 states. [2019-08-05 10:44:53,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:53,395 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2019-08-05 10:44:53,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:44:53,396 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 33 [2019-08-05 10:44:53,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:53,396 INFO L225 Difference]: With dead ends: 45 [2019-08-05 10:44:53,397 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 10:44:53,397 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=1056, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:44:53,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 10:44:53,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2019-08-05 10:44:53,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 10:44:53,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2019-08-05 10:44:53,399 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 33 [2019-08-05 10:44:53,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:53,399 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2019-08-05 10:44:53,399 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:44:53,400 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2019-08-05 10:44:53,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 10:44:53,400 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:53,400 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1, 1, 1] [2019-08-05 10:44:53,401 INFO L418 AbstractCegarLoop]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:53,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:53,401 INFO L82 PathProgramCache]: Analyzing trace with hash -410987075, now seen corresponding path program 56 times [2019-08-05 10:44:53,401 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:53,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:53,410 WARN L254 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-05 10:44:53,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:53,972 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 0 proven. 436 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:53,973 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:53,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:44:53,973 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:44:53,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:44:53,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1055, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:44:53,974 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand 34 states. [2019-08-05 10:44:54,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:54,628 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2019-08-05 10:44:54,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:44:54,628 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 33 [2019-08-05 10:44:54,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:54,629 INFO L225 Difference]: With dead ends: 44 [2019-08-05 10:44:54,629 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 10:44:54,630 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=67, Invalid=1055, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:44:54,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 10:44:54,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 39. [2019-08-05 10:44:54,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 10:44:54,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2019-08-05 10:44:54,632 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 33 [2019-08-05 10:44:54,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:54,632 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2019-08-05 10:44:54,632 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:44:54,633 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2019-08-05 10:44:54,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 10:44:54,633 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:54,633 INFO L399 BasicCegarLoop]: trace histogram [28, 2, 1, 1, 1] [2019-08-05 10:44:54,633 INFO L418 AbstractCegarLoop]: === Iteration 90 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:54,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:54,634 INFO L82 PathProgramCache]: Analyzing trace with hash -410913078, now seen corresponding path program 57 times [2019-08-05 10:44:54,634 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:54,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:54,643 WARN L254 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 10:44:54,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:55,545 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 1 proven. 408 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:55,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:55,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:44:55,546 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:44:55,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:44:55,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1053, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:44:55,546 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand 34 states. [2019-08-05 10:44:56,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:56,144 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2019-08-05 10:44:56,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 10:44:56,144 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 33 [2019-08-05 10:44:56,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:56,145 INFO L225 Difference]: With dead ends: 42 [2019-08-05 10:44:56,145 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 10:44:56,145 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=69, Invalid=1053, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:44:56,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 10:44:56,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-08-05 10:44:56,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 10:44:56,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-08-05 10:44:56,147 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 33 [2019-08-05 10:44:56,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:56,147 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-08-05 10:44:56,147 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:44:56,148 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-08-05 10:44:56,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 10:44:56,148 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:56,148 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2019-08-05 10:44:56,149 INFO L418 AbstractCegarLoop]: === Iteration 91 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:56,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:56,149 INFO L82 PathProgramCache]: Analyzing trace with hash 144226320, now seen corresponding path program 31 times [2019-08-05 10:44:56,150 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:56,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:56,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-05 10:44:56,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:56,811 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:56,811 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:56,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:44:56,811 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:44:56,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:44:56,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=1122, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:44:56,812 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 35 states. [2019-08-05 10:44:57,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:57,502 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2019-08-05 10:44:57,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 10:44:57,503 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 34 [2019-08-05 10:44:57,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:57,504 INFO L225 Difference]: With dead ends: 46 [2019-08-05 10:44:57,504 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 10:44:57,504 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=68, Invalid=1122, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:44:57,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 10:44:57,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 40. [2019-08-05 10:44:57,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:44:57,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2019-08-05 10:44:57,507 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 34 [2019-08-05 10:44:57,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:57,507 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2019-08-05 10:44:57,507 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:44:57,507 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2019-08-05 10:44:57,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 10:44:57,508 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:57,508 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1, 1, 1] [2019-08-05 10:44:57,508 INFO L418 AbstractCegarLoop]: === Iteration 92 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:57,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:57,509 INFO L82 PathProgramCache]: Analyzing trace with hash 144228707, now seen corresponding path program 58 times [2019-08-05 10:44:57,509 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:57,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:57,518 WARN L254 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-05 10:44:57,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:58,104 INFO L134 CoverageAnalysis]: Checked inductivity of 466 backedges. 0 proven. 466 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:58,104 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:58,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:44:58,104 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:44:58,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:44:58,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1121, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:44:58,105 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand 35 states. [2019-08-05 10:44:58,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:58,832 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2019-08-05 10:44:58,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 10:44:58,833 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 34 [2019-08-05 10:44:58,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:58,833 INFO L225 Difference]: With dead ends: 45 [2019-08-05 10:44:58,834 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 10:44:58,834 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=69, Invalid=1121, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:44:58,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 10:44:58,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 40. [2019-08-05 10:44:58,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:44:58,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2019-08-05 10:44:58,836 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 34 [2019-08-05 10:44:58,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:58,836 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2019-08-05 10:44:58,836 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:44:58,836 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2019-08-05 10:44:58,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 10:44:58,837 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:58,837 INFO L399 BasicCegarLoop]: trace histogram [29, 2, 1, 1, 1] [2019-08-05 10:44:58,837 INFO L418 AbstractCegarLoop]: === Iteration 93 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:58,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:58,838 INFO L82 PathProgramCache]: Analyzing trace with hash 144302704, now seen corresponding path program 59 times [2019-08-05 10:44:58,838 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:58,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:58,846 WARN L254 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-05 10:44:58,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:59,425 INFO L134 CoverageAnalysis]: Checked inductivity of 438 backedges. 1 proven. 437 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:59,425 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:59,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:44:59,425 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:44:59,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:44:59,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1119, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:44:59,426 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand 35 states. [2019-08-05 10:45:00,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:00,060 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2019-08-05 10:45:00,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:45:00,061 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 34 [2019-08-05 10:45:00,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:00,061 INFO L225 Difference]: With dead ends: 43 [2019-08-05 10:45:00,061 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 10:45:00,062 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=71, Invalid=1119, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:45:00,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 10:45:00,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-08-05 10:45:00,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:45:00,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2019-08-05 10:45:00,063 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 34 [2019-08-05 10:45:00,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:00,063 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2019-08-05 10:45:00,063 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:45:00,064 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2019-08-05 10:45:00,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:45:00,064 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:00,064 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2019-08-05 10:45:00,064 INFO L418 AbstractCegarLoop]: === Iteration 94 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:00,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:00,065 INFO L82 PathProgramCache]: Analyzing trace with hash 176046378, now seen corresponding path program 32 times [2019-08-05 10:45:00,065 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:00,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:00,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-05 10:45:00,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:00,973 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:00,973 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:00,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 10:45:00,974 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 10:45:00,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 10:45:00,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=1190, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:45:00,974 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 36 states. [2019-08-05 10:45:01,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:01,712 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2019-08-05 10:45:01,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 10:45:01,712 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 35 [2019-08-05 10:45:01,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:01,713 INFO L225 Difference]: With dead ends: 47 [2019-08-05 10:45:01,713 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 10:45:01,713 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=70, Invalid=1190, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:45:01,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 10:45:01,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 41. [2019-08-05 10:45:01,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 10:45:01,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2019-08-05 10:45:01,715 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 35 [2019-08-05 10:45:01,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:01,715 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2019-08-05 10:45:01,716 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 10:45:01,716 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2019-08-05 10:45:01,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:45:01,716 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:01,716 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1, 1, 1] [2019-08-05 10:45:01,717 INFO L418 AbstractCegarLoop]: === Iteration 95 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:01,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:01,717 INFO L82 PathProgramCache]: Analyzing trace with hash 176048765, now seen corresponding path program 60 times [2019-08-05 10:45:01,717 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:01,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:01,727 WARN L254 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-05 10:45:01,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:02,563 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 0 proven. 497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:02,563 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:02,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 10:45:02,563 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 10:45:02,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 10:45:02,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1189, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:45:02,564 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand 36 states. [2019-08-05 10:45:03,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:03,321 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2019-08-05 10:45:03,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 10:45:03,321 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 35 [2019-08-05 10:45:03,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:03,322 INFO L225 Difference]: With dead ends: 46 [2019-08-05 10:45:03,322 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 10:45:03,322 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=71, Invalid=1189, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:45:03,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 10:45:03,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 41. [2019-08-05 10:45:03,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 10:45:03,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2019-08-05 10:45:03,325 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 35 [2019-08-05 10:45:03,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:03,325 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2019-08-05 10:45:03,325 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 10:45:03,325 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2019-08-05 10:45:03,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:45:03,326 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:03,326 INFO L399 BasicCegarLoop]: trace histogram [30, 2, 1, 1, 1] [2019-08-05 10:45:03,326 INFO L418 AbstractCegarLoop]: === Iteration 96 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:03,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:03,326 INFO L82 PathProgramCache]: Analyzing trace with hash 176122762, now seen corresponding path program 61 times [2019-08-05 10:45:03,327 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:03,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:03,336 WARN L254 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-05 10:45:03,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:03,982 INFO L134 CoverageAnalysis]: Checked inductivity of 468 backedges. 1 proven. 467 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:03,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:03,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 10:45:03,983 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 10:45:03,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 10:45:03,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1187, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:45:03,984 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand 36 states. [2019-08-05 10:45:04,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:04,651 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2019-08-05 10:45:04,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 10:45:04,652 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 35 [2019-08-05 10:45:04,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:04,652 INFO L225 Difference]: With dead ends: 44 [2019-08-05 10:45:04,652 INFO L226 Difference]: Without dead ends: 41 [2019-08-05 10:45:04,653 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=1187, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:45:04,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-05 10:45:04,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-08-05 10:45:04,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 10:45:04,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2019-08-05 10:45:04,660 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 35 [2019-08-05 10:45:04,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:04,660 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2019-08-05 10:45:04,660 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 10:45:04,661 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2019-08-05 10:45:04,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 10:45:04,661 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:04,661 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2019-08-05 10:45:04,661 INFO L418 AbstractCegarLoop]: === Iteration 97 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:04,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:04,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1162468176, now seen corresponding path program 33 times [2019-08-05 10:45:04,662 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:04,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:04,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 71 conjunts are in the unsatisfiable core [2019-08-05 10:45:04,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:05,384 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:05,385 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:05,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:45:05,385 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 10:45:05,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 10:45:05,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=1260, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:45:05,386 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 37 states. [2019-08-05 10:45:06,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:06,333 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2019-08-05 10:45:06,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 10:45:06,334 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 36 [2019-08-05 10:45:06,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:06,335 INFO L225 Difference]: With dead ends: 48 [2019-08-05 10:45:06,335 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 10:45:06,335 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=72, Invalid=1260, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:45:06,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 10:45:06,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 42. [2019-08-05 10:45:06,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:45:06,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2019-08-05 10:45:06,337 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 36 [2019-08-05 10:45:06,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:06,338 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2019-08-05 10:45:06,338 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 10:45:06,338 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2019-08-05 10:45:06,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 10:45:06,338 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:06,338 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1, 1, 1] [2019-08-05 10:45:06,339 INFO L418 AbstractCegarLoop]: === Iteration 98 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:06,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:06,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1162470563, now seen corresponding path program 62 times [2019-08-05 10:45:06,339 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:06,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:06,349 WARN L254 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-05 10:45:06,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:07,009 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:07,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:07,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:45:07,010 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 10:45:07,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 10:45:07,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1259, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:45:07,010 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 37 states. [2019-08-05 10:45:08,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:08,992 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2019-08-05 10:45:08,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 10:45:08,993 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 36 [2019-08-05 10:45:08,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:08,993 INFO L225 Difference]: With dead ends: 47 [2019-08-05 10:45:08,993 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 10:45:08,994 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=1259, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:45:08,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 10:45:08,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 42. [2019-08-05 10:45:08,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:45:08,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2019-08-05 10:45:08,996 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 36 [2019-08-05 10:45:08,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:08,996 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2019-08-05 10:45:08,996 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 10:45:08,997 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2019-08-05 10:45:08,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 10:45:08,997 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:08,997 INFO L399 BasicCegarLoop]: trace histogram [31, 2, 1, 1, 1] [2019-08-05 10:45:08,998 INFO L418 AbstractCegarLoop]: === Iteration 99 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:08,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:08,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1162544560, now seen corresponding path program 63 times [2019-08-05 10:45:08,999 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:09,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:09,008 WARN L254 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-05 10:45:09,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:09,994 INFO L134 CoverageAnalysis]: Checked inductivity of 499 backedges. 1 proven. 498 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:09,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:09,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:45:09,995 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 10:45:09,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 10:45:09,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1257, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:45:09,995 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 37 states. [2019-08-05 10:45:10,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:10,920 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2019-08-05 10:45:10,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 10:45:10,921 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 36 [2019-08-05 10:45:10,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:10,922 INFO L225 Difference]: With dead ends: 45 [2019-08-05 10:45:10,922 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 10:45:10,925 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=75, Invalid=1257, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:45:10,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 10:45:10,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-08-05 10:45:10,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:45:10,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2019-08-05 10:45:10,927 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 36 [2019-08-05 10:45:10,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:10,927 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2019-08-05 10:45:10,927 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 10:45:10,927 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2019-08-05 10:45:10,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 10:45:10,927 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:10,928 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2019-08-05 10:45:10,928 INFO L418 AbstractCegarLoop]: === Iteration 100 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:10,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:10,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1676772842, now seen corresponding path program 34 times [2019-08-05 10:45:10,929 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:10,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:10,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 73 conjunts are in the unsatisfiable core [2019-08-05 10:45:10,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:11,603 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:11,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:11,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 10:45:11,604 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 10:45:11,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 10:45:11,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=1332, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:45:11,604 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 38 states. [2019-08-05 10:45:12,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:12,463 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2019-08-05 10:45:12,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 10:45:12,463 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 37 [2019-08-05 10:45:12,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:12,464 INFO L225 Difference]: With dead ends: 49 [2019-08-05 10:45:12,464 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 10:45:12,465 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=74, Invalid=1332, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:45:12,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 10:45:12,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 43. [2019-08-05 10:45:12,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 10:45:12,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2019-08-05 10:45:12,467 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 37 [2019-08-05 10:45:12,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:12,467 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2019-08-05 10:45:12,467 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 10:45:12,467 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2019-08-05 10:45:12,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 10:45:12,468 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:12,468 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1, 1, 1] [2019-08-05 10:45:12,468 INFO L418 AbstractCegarLoop]: === Iteration 101 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:12,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:12,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1676775229, now seen corresponding path program 64 times [2019-08-05 10:45:12,469 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:12,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:12,479 WARN L254 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 72 conjunts are in the unsatisfiable core [2019-08-05 10:45:12,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:13,138 INFO L134 CoverageAnalysis]: Checked inductivity of 562 backedges. 0 proven. 562 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:13,138 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:13,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 10:45:13,138 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 10:45:13,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 10:45:13,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1331, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:45:13,139 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 38 states. [2019-08-05 10:45:13,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:13,987 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2019-08-05 10:45:13,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 10:45:13,987 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 37 [2019-08-05 10:45:13,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:13,988 INFO L225 Difference]: With dead ends: 48 [2019-08-05 10:45:13,988 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 10:45:13,989 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=75, Invalid=1331, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:45:13,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 10:45:13,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 43. [2019-08-05 10:45:13,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 10:45:13,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2019-08-05 10:45:13,990 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 37 [2019-08-05 10:45:13,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:13,990 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2019-08-05 10:45:13,991 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 10:45:13,991 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2019-08-05 10:45:13,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 10:45:13,991 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:13,991 INFO L399 BasicCegarLoop]: trace histogram [32, 2, 1, 1, 1] [2019-08-05 10:45:13,991 INFO L418 AbstractCegarLoop]: === Iteration 102 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:13,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:13,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1676849226, now seen corresponding path program 65 times [2019-08-05 10:45:13,992 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:13,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:13,999 WARN L254 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 71 conjunts are in the unsatisfiable core [2019-08-05 10:45:14,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:14,647 INFO L134 CoverageAnalysis]: Checked inductivity of 531 backedges. 1 proven. 530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:14,647 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:14,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 10:45:14,648 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 10:45:14,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 10:45:14,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1329, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:45:14,649 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 38 states. [2019-08-05 10:45:15,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:15,400 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2019-08-05 10:45:15,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 10:45:15,401 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 37 [2019-08-05 10:45:15,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:15,402 INFO L225 Difference]: With dead ends: 46 [2019-08-05 10:45:15,402 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 10:45:15,402 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=77, Invalid=1329, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:45:15,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 10:45:15,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-05 10:45:15,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 10:45:15,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2019-08-05 10:45:15,404 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 37 [2019-08-05 10:45:15,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:15,405 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2019-08-05 10:45:15,405 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 10:45:15,405 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2019-08-05 10:45:15,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 10:45:15,405 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:15,405 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2019-08-05 10:45:15,406 INFO L418 AbstractCegarLoop]: === Iteration 103 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:15,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:15,406 INFO L82 PathProgramCache]: Analyzing trace with hash 440348304, now seen corresponding path program 35 times [2019-08-05 10:45:15,406 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:15,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:15,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-05 10:45:15,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:16,388 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:16,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:16,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:45:16,389 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 10:45:16,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 10:45:16,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=1406, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:45:16,389 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 39 states. [2019-08-05 10:45:17,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:17,295 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2019-08-05 10:45:17,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 10:45:17,295 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 38 [2019-08-05 10:45:17,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:17,296 INFO L225 Difference]: With dead ends: 50 [2019-08-05 10:45:17,296 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 10:45:17,296 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=76, Invalid=1406, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:45:17,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 10:45:17,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 44. [2019-08-05 10:45:17,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:45:17,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2019-08-05 10:45:17,298 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 38 [2019-08-05 10:45:17,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:17,299 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2019-08-05 10:45:17,299 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 10:45:17,299 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2019-08-05 10:45:17,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 10:45:17,300 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:17,300 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1, 1, 1] [2019-08-05 10:45:17,300 INFO L418 AbstractCegarLoop]: === Iteration 104 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:17,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:17,300 INFO L82 PathProgramCache]: Analyzing trace with hash 440350691, now seen corresponding path program 66 times [2019-08-05 10:45:17,301 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:17,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:17,312 WARN L254 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-05 10:45:17,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:18,507 INFO L134 CoverageAnalysis]: Checked inductivity of 596 backedges. 0 proven. 596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:18,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:18,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:45:18,508 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 10:45:18,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 10:45:18,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1405, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:45:18,509 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 39 states. [2019-08-05 10:45:19,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:19,434 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2019-08-05 10:45:19,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 10:45:19,434 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 38 [2019-08-05 10:45:19,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:19,435 INFO L225 Difference]: With dead ends: 49 [2019-08-05 10:45:19,435 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 10:45:19,436 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=77, Invalid=1405, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:45:19,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 10:45:19,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 44. [2019-08-05 10:45:19,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:45:19,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2019-08-05 10:45:19,437 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 38 [2019-08-05 10:45:19,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:19,438 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2019-08-05 10:45:19,438 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 10:45:19,438 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2019-08-05 10:45:19,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 10:45:19,438 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:19,439 INFO L399 BasicCegarLoop]: trace histogram [33, 2, 1, 1, 1] [2019-08-05 10:45:19,439 INFO L418 AbstractCegarLoop]: === Iteration 105 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:19,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:19,439 INFO L82 PathProgramCache]: Analyzing trace with hash 440424688, now seen corresponding path program 67 times [2019-08-05 10:45:19,440 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:19,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:19,452 WARN L254 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 73 conjunts are in the unsatisfiable core [2019-08-05 10:45:19,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:20,142 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 1 proven. 563 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:20,142 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:20,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:45:20,142 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 10:45:20,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 10:45:20,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1403, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:45:20,143 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 39 states. [2019-08-05 10:45:21,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:21,172 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2019-08-05 10:45:21,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 10:45:21,172 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 38 [2019-08-05 10:45:21,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:21,173 INFO L225 Difference]: With dead ends: 47 [2019-08-05 10:45:21,173 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 10:45:21,173 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=79, Invalid=1403, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:45:21,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 10:45:21,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-08-05 10:45:21,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:45:21,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2019-08-05 10:45:21,176 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 38 [2019-08-05 10:45:21,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:21,176 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2019-08-05 10:45:21,176 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 10:45:21,176 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2019-08-05 10:45:21,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 10:45:21,176 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:21,176 INFO L399 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2019-08-05 10:45:21,177 INFO L418 AbstractCegarLoop]: === Iteration 106 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:21,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:21,177 INFO L82 PathProgramCache]: Analyzing trace with hash 765893290, now seen corresponding path program 36 times [2019-08-05 10:45:21,177 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:21,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:21,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 77 conjunts are in the unsatisfiable core [2019-08-05 10:45:21,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:21,899 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:21,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:21,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 10:45:21,900 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 10:45:21,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 10:45:21,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=1482, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:45:21,901 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 40 states. [2019-08-05 10:45:22,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:22,808 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2019-08-05 10:45:22,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 10:45:22,809 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 39 [2019-08-05 10:45:22,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:22,810 INFO L225 Difference]: With dead ends: 51 [2019-08-05 10:45:22,810 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:45:22,810 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=78, Invalid=1482, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:45:22,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:45:22,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 45. [2019-08-05 10:45:22,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 10:45:22,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2019-08-05 10:45:22,812 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 39 [2019-08-05 10:45:22,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:22,813 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2019-08-05 10:45:22,813 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 10:45:22,813 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2019-08-05 10:45:22,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 10:45:22,813 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:22,813 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1, 1, 1] [2019-08-05 10:45:22,814 INFO L418 AbstractCegarLoop]: === Iteration 107 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:22,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:22,814 INFO L82 PathProgramCache]: Analyzing trace with hash 765895677, now seen corresponding path program 68 times [2019-08-05 10:45:22,814 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:22,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:22,823 WARN L254 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-05 10:45:22,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:23,525 INFO L134 CoverageAnalysis]: Checked inductivity of 631 backedges. 0 proven. 631 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:23,525 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:23,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 10:45:23,526 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 10:45:23,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 10:45:23,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1481, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:45:23,526 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand 40 states. [2019-08-05 10:45:24,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:24,417 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2019-08-05 10:45:24,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 10:45:24,418 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 39 [2019-08-05 10:45:24,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:24,419 INFO L225 Difference]: With dead ends: 50 [2019-08-05 10:45:24,419 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 10:45:24,419 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=79, Invalid=1481, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:45:24,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 10:45:24,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2019-08-05 10:45:24,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 10:45:24,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2019-08-05 10:45:24,421 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 39 [2019-08-05 10:45:24,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:24,421 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2019-08-05 10:45:24,421 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 10:45:24,421 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2019-08-05 10:45:24,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 10:45:24,421 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:24,421 INFO L399 BasicCegarLoop]: trace histogram [34, 2, 1, 1, 1] [2019-08-05 10:45:24,421 INFO L418 AbstractCegarLoop]: === Iteration 108 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:24,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:24,422 INFO L82 PathProgramCache]: Analyzing trace with hash 765969674, now seen corresponding path program 69 times [2019-08-05 10:45:24,422 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:24,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:24,430 WARN L254 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-05 10:45:24,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:25,172 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 1 proven. 597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:25,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:25,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 10:45:25,173 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 10:45:25,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 10:45:25,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1479, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:45:25,173 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand 40 states. [2019-08-05 10:45:26,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:26,249 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2019-08-05 10:45:26,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 10:45:26,249 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 39 [2019-08-05 10:45:26,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:26,250 INFO L225 Difference]: With dead ends: 48 [2019-08-05 10:45:26,250 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 10:45:26,250 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=81, Invalid=1479, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:45:26,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 10:45:26,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-05 10:45:26,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 10:45:26,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2019-08-05 10:45:26,252 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 39 [2019-08-05 10:45:26,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:26,253 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2019-08-05 10:45:26,253 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 10:45:26,253 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2019-08-05 10:45:26,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 10:45:26,253 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:26,254 INFO L399 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2019-08-05 10:45:26,254 INFO L418 AbstractCegarLoop]: === Iteration 109 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:26,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:26,254 INFO L82 PathProgramCache]: Analyzing trace with hash -2027114032, now seen corresponding path program 37 times [2019-08-05 10:45:26,255 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:26,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:26,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 79 conjunts are in the unsatisfiable core [2019-08-05 10:45:26,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:27,026 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:27,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:27,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 10:45:27,026 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 10:45:27,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 10:45:27,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=1560, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:45:27,027 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 41 states. [2019-08-05 10:45:27,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:27,986 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2019-08-05 10:45:27,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 10:45:27,986 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 40 [2019-08-05 10:45:27,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:27,987 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:45:27,987 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 10:45:27,987 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=80, Invalid=1560, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:45:27,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 10:45:27,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 46. [2019-08-05 10:45:27,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:45:27,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2019-08-05 10:45:27,989 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 40 [2019-08-05 10:45:27,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:27,989 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2019-08-05 10:45:27,989 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 10:45:27,990 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2019-08-05 10:45:27,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 10:45:27,990 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:27,990 INFO L399 BasicCegarLoop]: trace histogram [36, 1, 1, 1, 1] [2019-08-05 10:45:27,990 INFO L418 AbstractCegarLoop]: === Iteration 110 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:27,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:27,991 INFO L82 PathProgramCache]: Analyzing trace with hash -2027111645, now seen corresponding path program 70 times [2019-08-05 10:45:27,991 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:27,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:28,001 WARN L254 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 78 conjunts are in the unsatisfiable core [2019-08-05 10:45:28,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:28,884 INFO L134 CoverageAnalysis]: Checked inductivity of 667 backedges. 0 proven. 667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:28,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:28,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 10:45:28,884 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 10:45:28,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 10:45:28,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1559, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:45:28,885 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand 41 states. [2019-08-05 10:45:29,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:29,851 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2019-08-05 10:45:29,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 10:45:29,851 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 40 [2019-08-05 10:45:29,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:29,852 INFO L225 Difference]: With dead ends: 51 [2019-08-05 10:45:29,852 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:45:29,852 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=1559, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:45:29,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:45:29,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 46. [2019-08-05 10:45:29,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:45:29,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2019-08-05 10:45:29,854 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 40 [2019-08-05 10:45:29,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:29,855 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2019-08-05 10:45:29,855 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 10:45:29,855 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2019-08-05 10:45:29,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 10:45:29,855 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:29,855 INFO L399 BasicCegarLoop]: trace histogram [35, 2, 1, 1, 1] [2019-08-05 10:45:29,856 INFO L418 AbstractCegarLoop]: === Iteration 111 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:29,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:29,856 INFO L82 PathProgramCache]: Analyzing trace with hash -2027037648, now seen corresponding path program 71 times [2019-08-05 10:45:29,856 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:29,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:29,866 WARN L254 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 77 conjunts are in the unsatisfiable core [2019-08-05 10:45:29,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:30,622 INFO L134 CoverageAnalysis]: Checked inductivity of 633 backedges. 1 proven. 632 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:30,622 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:30,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 10:45:30,622 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 10:45:30,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 10:45:30,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1557, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:45:30,623 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand 41 states. [2019-08-05 10:45:31,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:31,660 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2019-08-05 10:45:31,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 10:45:31,660 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 40 [2019-08-05 10:45:31,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:31,661 INFO L225 Difference]: With dead ends: 49 [2019-08-05 10:45:31,661 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 10:45:31,661 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=83, Invalid=1557, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:45:31,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 10:45:31,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-08-05 10:45:31,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:45:31,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2019-08-05 10:45:31,663 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 40 [2019-08-05 10:45:31,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:31,664 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2019-08-05 10:45:31,664 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 10:45:31,664 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2019-08-05 10:45:31,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 10:45:31,664 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:31,665 INFO L399 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2019-08-05 10:45:31,665 INFO L418 AbstractCegarLoop]: === Iteration 112 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:31,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:31,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1583972202, now seen corresponding path program 38 times [2019-08-05 10:45:31,666 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:31,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:31,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 81 conjunts are in the unsatisfiable core [2019-08-05 10:45:31,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:32,432 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:32,433 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:32,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 10:45:32,433 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:45:32,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:45:32,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=1640, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:45:32,433 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 42 states. [2019-08-05 10:45:33,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:33,443 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2019-08-05 10:45:33,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 10:45:33,443 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 41 [2019-08-05 10:45:33,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:33,444 INFO L225 Difference]: With dead ends: 53 [2019-08-05 10:45:33,444 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 10:45:33,444 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=82, Invalid=1640, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:45:33,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 10:45:33,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 47. [2019-08-05 10:45:33,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 10:45:33,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2019-08-05 10:45:33,446 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 41 [2019-08-05 10:45:33,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:33,446 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2019-08-05 10:45:33,446 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:45:33,446 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2019-08-05 10:45:33,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 10:45:33,447 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:33,447 INFO L399 BasicCegarLoop]: trace histogram [37, 1, 1, 1, 1] [2019-08-05 10:45:33,447 INFO L418 AbstractCegarLoop]: === Iteration 113 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:33,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:33,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1583974589, now seen corresponding path program 72 times [2019-08-05 10:45:33,448 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:33,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:33,457 WARN L254 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 80 conjunts are in the unsatisfiable core [2019-08-05 10:45:33,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:34,251 INFO L134 CoverageAnalysis]: Checked inductivity of 704 backedges. 0 proven. 704 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:34,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:34,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 10:45:34,252 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:45:34,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:45:34,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1639, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:45:34,252 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand 42 states. [2019-08-05 10:45:35,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:35,278 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2019-08-05 10:45:35,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 10:45:35,278 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 41 [2019-08-05 10:45:35,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:35,279 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:45:35,279 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 10:45:35,279 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=83, Invalid=1639, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:45:35,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 10:45:35,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 47. [2019-08-05 10:45:35,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 10:45:35,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2019-08-05 10:45:35,281 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 41 [2019-08-05 10:45:35,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:35,281 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2019-08-05 10:45:35,281 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:45:35,281 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2019-08-05 10:45:35,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 10:45:35,282 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:35,282 INFO L399 BasicCegarLoop]: trace histogram [36, 2, 1, 1, 1] [2019-08-05 10:45:35,282 INFO L418 AbstractCegarLoop]: === Iteration 114 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:35,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:35,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1584048586, now seen corresponding path program 73 times [2019-08-05 10:45:35,283 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:35,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:35,292 WARN L254 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 79 conjunts are in the unsatisfiable core [2019-08-05 10:45:35,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:36,502 INFO L134 CoverageAnalysis]: Checked inductivity of 669 backedges. 1 proven. 668 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:36,502 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:36,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 10:45:36,503 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:45:36,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:45:36,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1637, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:45:36,503 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand 42 states. [2019-08-05 10:45:37,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:37,422 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2019-08-05 10:45:37,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 10:45:37,423 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 41 [2019-08-05 10:45:37,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:37,423 INFO L225 Difference]: With dead ends: 50 [2019-08-05 10:45:37,424 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 10:45:37,424 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=85, Invalid=1637, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:45:37,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 10:45:37,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-08-05 10:45:37,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 10:45:37,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2019-08-05 10:45:37,426 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 41 [2019-08-05 10:45:37,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:37,426 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2019-08-05 10:45:37,426 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:45:37,427 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2019-08-05 10:45:37,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 10:45:37,427 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:37,427 INFO L399 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2019-08-05 10:45:37,428 INFO L418 AbstractCegarLoop]: === Iteration 115 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:37,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:37,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1858495760, now seen corresponding path program 39 times [2019-08-05 10:45:37,428 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:37,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:37,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 83 conjunts are in the unsatisfiable core [2019-08-05 10:45:37,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:38,258 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:38,258 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:38,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 10:45:38,259 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 10:45:38,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 10:45:38,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=1722, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:45:38,259 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 43 states. [2019-08-05 10:45:39,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:39,321 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2019-08-05 10:45:39,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 10:45:39,321 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 42 [2019-08-05 10:45:39,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:39,322 INFO L225 Difference]: With dead ends: 54 [2019-08-05 10:45:39,322 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:45:39,322 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=84, Invalid=1722, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:45:39,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:45:39,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 48. [2019-08-05 10:45:39,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:45:39,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2019-08-05 10:45:39,324 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 42 [2019-08-05 10:45:39,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:39,324 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2019-08-05 10:45:39,324 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 10:45:39,324 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2019-08-05 10:45:39,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 10:45:39,325 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:39,325 INFO L399 BasicCegarLoop]: trace histogram [38, 1, 1, 1, 1] [2019-08-05 10:45:39,325 INFO L418 AbstractCegarLoop]: === Iteration 116 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:39,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:39,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1858498147, now seen corresponding path program 74 times [2019-08-05 10:45:39,326 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:39,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:39,337 WARN L254 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 82 conjunts are in the unsatisfiable core [2019-08-05 10:45:39,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:40,251 INFO L134 CoverageAnalysis]: Checked inductivity of 742 backedges. 0 proven. 742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:40,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:40,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 10:45:40,252 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 10:45:40,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 10:45:40,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1721, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:45:40,252 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand 43 states. [2019-08-05 10:45:41,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:41,522 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2019-08-05 10:45:41,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 10:45:41,522 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 42 [2019-08-05 10:45:41,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:41,523 INFO L225 Difference]: With dead ends: 53 [2019-08-05 10:45:41,523 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 10:45:41,523 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=85, Invalid=1721, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:45:41,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 10:45:41,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 48. [2019-08-05 10:45:41,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:45:41,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2019-08-05 10:45:41,526 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 42 [2019-08-05 10:45:41,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:41,526 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2019-08-05 10:45:41,526 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 10:45:41,526 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2019-08-05 10:45:41,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 10:45:41,527 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:41,527 INFO L399 BasicCegarLoop]: trace histogram [37, 2, 1, 1, 1] [2019-08-05 10:45:41,527 INFO L418 AbstractCegarLoop]: === Iteration 117 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:41,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:41,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1858572144, now seen corresponding path program 75 times [2019-08-05 10:45:41,528 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:41,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:41,539 WARN L254 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 81 conjunts are in the unsatisfiable core [2019-08-05 10:45:41,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:42,506 INFO L134 CoverageAnalysis]: Checked inductivity of 706 backedges. 1 proven. 705 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:42,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:42,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 10:45:42,507 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 10:45:42,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 10:45:42,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1719, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:45:42,508 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand 43 states. [2019-08-05 10:45:43,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:43,473 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2019-08-05 10:45:43,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 10:45:43,474 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 42 [2019-08-05 10:45:43,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:43,474 INFO L225 Difference]: With dead ends: 51 [2019-08-05 10:45:43,474 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 10:45:43,475 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=87, Invalid=1719, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:45:43,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 10:45:43,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-08-05 10:45:43,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:45:43,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2019-08-05 10:45:43,476 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 42 [2019-08-05 10:45:43,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:43,476 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2019-08-05 10:45:43,476 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 10:45:43,477 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2019-08-05 10:45:43,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 10:45:43,477 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:43,477 INFO L399 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2019-08-05 10:45:43,477 INFO L418 AbstractCegarLoop]: === Iteration 118 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:43,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:43,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1778791466, now seen corresponding path program 40 times [2019-08-05 10:45:43,478 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:43,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:43,487 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 85 conjunts are in the unsatisfiable core [2019-08-05 10:45:43,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:44,389 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:44,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:44,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 10:45:44,390 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 10:45:44,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 10:45:44,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=1806, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:45:44,391 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 44 states. [2019-08-05 10:45:45,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:45,546 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2019-08-05 10:45:45,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:45:45,546 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 43 [2019-08-05 10:45:45,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:45,547 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:45:45,547 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 10:45:45,548 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=86, Invalid=1806, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:45:45,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 10:45:45,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 49. [2019-08-05 10:45:45,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 10:45:45,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2019-08-05 10:45:45,549 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 43 [2019-08-05 10:45:45,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:45,550 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2019-08-05 10:45:45,550 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 10:45:45,550 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2019-08-05 10:45:45,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 10:45:45,550 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:45,550 INFO L399 BasicCegarLoop]: trace histogram [39, 1, 1, 1, 1] [2019-08-05 10:45:45,551 INFO L418 AbstractCegarLoop]: === Iteration 119 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:45,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:45,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1778793853, now seen corresponding path program 76 times [2019-08-05 10:45:45,552 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:45,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:45,563 WARN L254 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 84 conjunts are in the unsatisfiable core [2019-08-05 10:45:45,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:46,580 INFO L134 CoverageAnalysis]: Checked inductivity of 781 backedges. 0 proven. 781 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:46,581 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:46,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 10:45:46,581 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 10:45:46,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 10:45:46,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1805, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:45:46,581 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 44 states. [2019-08-05 10:45:47,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:47,682 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2019-08-05 10:45:47,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:45:47,682 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 43 [2019-08-05 10:45:47,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:47,683 INFO L225 Difference]: With dead ends: 54 [2019-08-05 10:45:47,683 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:45:47,683 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=87, Invalid=1805, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:45:47,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:45:47,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 49. [2019-08-05 10:45:47,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 10:45:47,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2019-08-05 10:45:47,685 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 43 [2019-08-05 10:45:47,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:47,686 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2019-08-05 10:45:47,686 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 10:45:47,686 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2019-08-05 10:45:47,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 10:45:47,687 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:47,687 INFO L399 BasicCegarLoop]: trace histogram [38, 2, 1, 1, 1] [2019-08-05 10:45:47,687 INFO L418 AbstractCegarLoop]: === Iteration 120 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:47,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:47,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1778867850, now seen corresponding path program 77 times [2019-08-05 10:45:47,688 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:47,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:47,697 WARN L254 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 83 conjunts are in the unsatisfiable core [2019-08-05 10:45:47,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:48,565 INFO L134 CoverageAnalysis]: Checked inductivity of 744 backedges. 1 proven. 743 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:48,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:48,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 10:45:48,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 10:45:48,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 10:45:48,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1803, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:45:48,569 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 44 states. [2019-08-05 10:45:49,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:49,610 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2019-08-05 10:45:49,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 10:45:49,611 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 43 [2019-08-05 10:45:49,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:49,611 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:45:49,612 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 10:45:49,612 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=89, Invalid=1803, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:45:49,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 10:45:49,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-08-05 10:45:49,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 10:45:49,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2019-08-05 10:45:49,614 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 43 [2019-08-05 10:45:49,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:49,614 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2019-08-05 10:45:49,614 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 10:45:49,615 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2019-08-05 10:45:49,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 10:45:49,615 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:49,615 INFO L399 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2019-08-05 10:45:49,615 INFO L418 AbstractCegarLoop]: === Iteration 121 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:49,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:49,616 INFO L82 PathProgramCache]: Analyzing trace with hash -692041648, now seen corresponding path program 41 times [2019-08-05 10:45:49,616 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:49,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:49,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-05 10:45:49,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:50,611 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:50,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:50,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 10:45:50,612 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 10:45:50,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 10:45:50,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=1892, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:45:50,612 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 45 states. [2019-08-05 10:45:52,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:52,022 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2019-08-05 10:45:52,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 10:45:52,022 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 44 [2019-08-05 10:45:52,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:52,023 INFO L225 Difference]: With dead ends: 56 [2019-08-05 10:45:52,023 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 10:45:52,023 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=88, Invalid=1892, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:45:52,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 10:45:52,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2019-08-05 10:45:52,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 10:45:52,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2019-08-05 10:45:52,025 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 44 [2019-08-05 10:45:52,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:52,025 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2019-08-05 10:45:52,025 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 10:45:52,025 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2019-08-05 10:45:52,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 10:45:52,025 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:52,026 INFO L399 BasicCegarLoop]: trace histogram [40, 1, 1, 1, 1] [2019-08-05 10:45:52,026 INFO L418 AbstractCegarLoop]: === Iteration 122 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:52,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:52,026 INFO L82 PathProgramCache]: Analyzing trace with hash -692039261, now seen corresponding path program 78 times [2019-08-05 10:45:52,027 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:52,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:52,036 WARN L254 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 86 conjunts are in the unsatisfiable core [2019-08-05 10:45:52,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:52,911 INFO L134 CoverageAnalysis]: Checked inductivity of 821 backedges. 0 proven. 821 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:52,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:52,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 10:45:52,912 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 10:45:52,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 10:45:52,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1891, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:45:52,912 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 45 states. [2019-08-05 10:45:54,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:54,059 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2019-08-05 10:45:54,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 10:45:54,059 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 44 [2019-08-05 10:45:54,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:54,060 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:45:54,060 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 10:45:54,060 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=89, Invalid=1891, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:45:54,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 10:45:54,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 50. [2019-08-05 10:45:54,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 10:45:54,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2019-08-05 10:45:54,062 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 44 [2019-08-05 10:45:54,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:54,062 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2019-08-05 10:45:54,062 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 10:45:54,062 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2019-08-05 10:45:54,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 10:45:54,063 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:54,063 INFO L399 BasicCegarLoop]: trace histogram [39, 2, 1, 1, 1] [2019-08-05 10:45:54,063 INFO L418 AbstractCegarLoop]: === Iteration 123 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:54,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:54,063 INFO L82 PathProgramCache]: Analyzing trace with hash -691965264, now seen corresponding path program 79 times [2019-08-05 10:45:54,064 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:54,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:54,075 WARN L254 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 85 conjunts are in the unsatisfiable core [2019-08-05 10:45:54,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:55,885 INFO L134 CoverageAnalysis]: Checked inductivity of 783 backedges. 1 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:55,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:55,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 10:45:55,886 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 10:45:55,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 10:45:55,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=1889, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:45:55,887 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 45 states. [2019-08-05 10:45:57,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:57,268 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2019-08-05 10:45:57,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:45:57,268 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 44 [2019-08-05 10:45:57,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:57,269 INFO L225 Difference]: With dead ends: 53 [2019-08-05 10:45:57,269 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 10:45:57,269 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=91, Invalid=1889, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:45:57,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 10:45:57,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-08-05 10:45:57,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 10:45:57,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2019-08-05 10:45:57,271 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 44 [2019-08-05 10:45:57,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:57,271 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2019-08-05 10:45:57,271 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 10:45:57,271 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2019-08-05 10:45:57,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 10:45:57,272 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:57,272 INFO L399 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2019-08-05 10:45:57,272 INFO L418 AbstractCegarLoop]: === Iteration 124 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:57,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:57,272 INFO L82 PathProgramCache]: Analyzing trace with hash 21543146, now seen corresponding path program 42 times [2019-08-05 10:45:57,273 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:57,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:57,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-05 10:45:57,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:58,237 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:58,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:58,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 10:45:58,237 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:45:58,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:45:58,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=1980, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:45:58,238 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 46 states. [2019-08-05 10:45:59,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:59,487 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2019-08-05 10:45:59,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 10:45:59,487 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 45 [2019-08-05 10:45:59,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:59,488 INFO L225 Difference]: With dead ends: 57 [2019-08-05 10:45:59,488 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 10:45:59,488 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=90, Invalid=1980, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:45:59,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 10:45:59,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 51. [2019-08-05 10:45:59,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 10:45:59,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2019-08-05 10:45:59,489 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 45 [2019-08-05 10:45:59,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:59,490 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2019-08-05 10:45:59,490 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:45:59,490 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2019-08-05 10:45:59,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 10:45:59,490 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:59,491 INFO L399 BasicCegarLoop]: trace histogram [41, 1, 1, 1, 1] [2019-08-05 10:45:59,491 INFO L418 AbstractCegarLoop]: === Iteration 125 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:59,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:59,491 INFO L82 PathProgramCache]: Analyzing trace with hash 21545533, now seen corresponding path program 80 times [2019-08-05 10:45:59,492 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:59,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:59,506 WARN L254 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 88 conjunts are in the unsatisfiable core [2019-08-05 10:45:59,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:00,448 INFO L134 CoverageAnalysis]: Checked inductivity of 862 backedges. 0 proven. 862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:00,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:00,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 10:46:00,448 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:46:00,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:46:00,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=1979, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:46:00,449 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 46 states. [2019-08-05 10:46:01,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:01,743 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2019-08-05 10:46:01,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 10:46:01,744 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 45 [2019-08-05 10:46:01,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:01,744 INFO L225 Difference]: With dead ends: 56 [2019-08-05 10:46:01,744 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 10:46:01,744 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=91, Invalid=1979, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:46:01,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 10:46:01,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 51. [2019-08-05 10:46:01,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 10:46:01,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2019-08-05 10:46:01,746 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 45 [2019-08-05 10:46:01,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:01,746 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2019-08-05 10:46:01,746 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:46:01,746 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2019-08-05 10:46:01,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 10:46:01,747 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:01,747 INFO L399 BasicCegarLoop]: trace histogram [40, 2, 1, 1, 1] [2019-08-05 10:46:01,747 INFO L418 AbstractCegarLoop]: === Iteration 126 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:01,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:01,747 INFO L82 PathProgramCache]: Analyzing trace with hash 21619530, now seen corresponding path program 81 times [2019-08-05 10:46:01,748 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:01,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:01,759 WARN L254 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-05 10:46:01,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:02,783 INFO L134 CoverageAnalysis]: Checked inductivity of 823 backedges. 1 proven. 822 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:02,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:02,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 10:46:02,784 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:46:02,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:46:02,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=1977, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:46:02,785 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 46 states. [2019-08-05 10:46:03,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:03,952 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2019-08-05 10:46:03,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 10:46:03,953 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 45 [2019-08-05 10:46:03,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:03,953 INFO L225 Difference]: With dead ends: 54 [2019-08-05 10:46:03,953 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:46:03,954 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=93, Invalid=1977, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:46:03,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:46:03,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-08-05 10:46:03,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 10:46:03,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2019-08-05 10:46:03,955 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 45 [2019-08-05 10:46:03,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:03,956 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2019-08-05 10:46:03,956 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:46:03,956 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2019-08-05 10:46:03,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 10:46:03,957 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:03,957 INFO L399 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2019-08-05 10:46:03,957 INFO L418 AbstractCegarLoop]: === Iteration 127 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:03,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:03,958 INFO L82 PathProgramCache]: Analyzing trace with hash 667835280, now seen corresponding path program 43 times [2019-08-05 10:46:03,958 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:03,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:03,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 91 conjunts are in the unsatisfiable core [2019-08-05 10:46:03,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:04,947 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:04,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:04,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 10:46:04,948 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 10:46:04,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 10:46:04,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=2070, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:46:04,948 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 47 states. [2019-08-05 10:46:06,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:06,218 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2019-08-05 10:46:06,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 10:46:06,219 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 46 [2019-08-05 10:46:06,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:06,219 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:46:06,219 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 10:46:06,220 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=92, Invalid=2070, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:46:06,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 10:46:06,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 52. [2019-08-05 10:46:06,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:46:06,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2019-08-05 10:46:06,221 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 46 [2019-08-05 10:46:06,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:06,222 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2019-08-05 10:46:06,222 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 10:46:06,222 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2019-08-05 10:46:06,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 10:46:06,222 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:06,223 INFO L399 BasicCegarLoop]: trace histogram [42, 1, 1, 1, 1] [2019-08-05 10:46:06,223 INFO L418 AbstractCegarLoop]: === Iteration 128 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:06,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:06,223 INFO L82 PathProgramCache]: Analyzing trace with hash 667837667, now seen corresponding path program 82 times [2019-08-05 10:46:06,224 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:06,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:06,236 WARN L254 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 90 conjunts are in the unsatisfiable core [2019-08-05 10:46:06,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:07,515 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 0 proven. 904 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:07,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:07,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 10:46:07,515 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 10:46:07,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 10:46:07,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2069, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:46:07,516 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 47 states. [2019-08-05 10:46:08,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:08,806 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2019-08-05 10:46:08,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 10:46:08,807 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 46 [2019-08-05 10:46:08,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:08,808 INFO L225 Difference]: With dead ends: 57 [2019-08-05 10:46:08,808 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 10:46:08,808 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=93, Invalid=2069, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:46:08,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 10:46:08,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 52. [2019-08-05 10:46:08,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:46:08,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2019-08-05 10:46:08,810 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 46 [2019-08-05 10:46:08,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:08,811 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2019-08-05 10:46:08,811 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 10:46:08,811 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2019-08-05 10:46:08,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 10:46:08,811 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:08,811 INFO L399 BasicCegarLoop]: trace histogram [41, 2, 1, 1, 1] [2019-08-05 10:46:08,812 INFO L418 AbstractCegarLoop]: === Iteration 129 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:08,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:08,812 INFO L82 PathProgramCache]: Analyzing trace with hash 667911664, now seen corresponding path program 83 times [2019-08-05 10:46:08,812 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:08,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:08,822 WARN L254 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-05 10:46:08,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:12,468 INFO L134 CoverageAnalysis]: Checked inductivity of 864 backedges. 1 proven. 863 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:12,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:12,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 10:46:12,469 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 10:46:12,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 10:46:12,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2067, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:46:12,470 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 47 states. [2019-08-05 10:46:13,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:13,636 INFO L93 Difference]: Finished difference Result 55 states and 60 transitions. [2019-08-05 10:46:13,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 10:46:13,637 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 46 [2019-08-05 10:46:13,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:13,637 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:46:13,638 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 10:46:13,638 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=95, Invalid=2067, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:46:13,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 10:46:13,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-05 10:46:13,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:46:13,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2019-08-05 10:46:13,640 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 46 [2019-08-05 10:46:13,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:13,640 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2019-08-05 10:46:13,640 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 10:46:13,640 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2019-08-05 10:46:13,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 10:46:13,641 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:13,641 INFO L399 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2019-08-05 10:46:13,641 INFO L418 AbstractCegarLoop]: === Iteration 130 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:13,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:13,641 INFO L82 PathProgramCache]: Analyzing trace with hash -771945046, now seen corresponding path program 44 times [2019-08-05 10:46:13,642 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:13,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:13,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 93 conjunts are in the unsatisfiable core [2019-08-05 10:46:13,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:14,940 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:14,940 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:14,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 10:46:14,941 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 10:46:14,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 10:46:14,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=2162, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:46:14,941 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 48 states. [2019-08-05 10:46:16,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:16,330 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2019-08-05 10:46:16,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 10:46:16,330 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 47 [2019-08-05 10:46:16,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:16,331 INFO L225 Difference]: With dead ends: 59 [2019-08-05 10:46:16,331 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 10:46:16,331 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=94, Invalid=2162, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:46:16,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 10:46:16,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 53. [2019-08-05 10:46:16,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 10:46:16,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2019-08-05 10:46:16,333 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 47 [2019-08-05 10:46:16,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:16,333 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2019-08-05 10:46:16,333 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 10:46:16,333 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2019-08-05 10:46:16,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 10:46:16,334 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:16,334 INFO L399 BasicCegarLoop]: trace histogram [43, 1, 1, 1, 1] [2019-08-05 10:46:16,334 INFO L418 AbstractCegarLoop]: === Iteration 131 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:16,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:16,334 INFO L82 PathProgramCache]: Analyzing trace with hash -771942659, now seen corresponding path program 84 times [2019-08-05 10:46:16,334 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:16,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:16,344 WARN L254 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 92 conjunts are in the unsatisfiable core [2019-08-05 10:46:16,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:17,757 INFO L134 CoverageAnalysis]: Checked inductivity of 947 backedges. 0 proven. 947 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:17,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:17,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 10:46:17,758 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 10:46:17,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 10:46:17,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2161, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:46:17,759 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand 48 states. [2019-08-05 10:46:19,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:19,064 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2019-08-05 10:46:19,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 10:46:19,064 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 47 [2019-08-05 10:46:19,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:19,065 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:46:19,065 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 10:46:19,065 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=95, Invalid=2161, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:46:19,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 10:46:19,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 53. [2019-08-05 10:46:19,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 10:46:19,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2019-08-05 10:46:19,067 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 47 [2019-08-05 10:46:19,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:19,068 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2019-08-05 10:46:19,068 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 10:46:19,068 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2019-08-05 10:46:19,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 10:46:19,068 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:19,068 INFO L399 BasicCegarLoop]: trace histogram [42, 2, 1, 1, 1] [2019-08-05 10:46:19,069 INFO L418 AbstractCegarLoop]: === Iteration 132 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:19,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:19,069 INFO L82 PathProgramCache]: Analyzing trace with hash -771868662, now seen corresponding path program 85 times [2019-08-05 10:46:19,070 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:19,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:19,078 WARN L254 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 91 conjunts are in the unsatisfiable core [2019-08-05 10:46:19,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:20,099 INFO L134 CoverageAnalysis]: Checked inductivity of 906 backedges. 1 proven. 905 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:20,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:20,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 10:46:20,100 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 10:46:20,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 10:46:20,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2159, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:46:20,101 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand 48 states. [2019-08-05 10:46:21,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:21,376 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2019-08-05 10:46:21,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 10:46:21,377 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 47 [2019-08-05 10:46:21,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:21,378 INFO L225 Difference]: With dead ends: 56 [2019-08-05 10:46:21,378 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 10:46:21,378 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=97, Invalid=2159, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:46:21,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 10:46:21,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-08-05 10:46:21,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 10:46:21,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2019-08-05 10:46:21,380 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 47 [2019-08-05 10:46:21,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:21,380 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2019-08-05 10:46:21,380 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 10:46:21,380 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2019-08-05 10:46:21,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 10:46:21,381 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:21,381 INFO L399 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2019-08-05 10:46:21,381 INFO L418 AbstractCegarLoop]: === Iteration 133 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:21,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:21,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1839505104, now seen corresponding path program 45 times [2019-08-05 10:46:21,382 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:21,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:21,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 95 conjunts are in the unsatisfiable core [2019-08-05 10:46:21,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:22,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:22,679 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:22,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 10:46:22,679 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 10:46:22,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 10:46:22,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=2256, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:46:22,680 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 49 states. [2019-08-05 10:46:24,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:24,093 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2019-08-05 10:46:24,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 10:46:24,093 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 48 [2019-08-05 10:46:24,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:24,093 INFO L225 Difference]: With dead ends: 60 [2019-08-05 10:46:24,094 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:46:24,094 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=96, Invalid=2256, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:46:24,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:46:24,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 54. [2019-08-05 10:46:24,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-05 10:46:24,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2019-08-05 10:46:24,095 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 48 [2019-08-05 10:46:24,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:24,096 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2019-08-05 10:46:24,096 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 10:46:24,096 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2019-08-05 10:46:24,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 10:46:24,097 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:24,097 INFO L399 BasicCegarLoop]: trace histogram [44, 1, 1, 1, 1] [2019-08-05 10:46:24,097 INFO L418 AbstractCegarLoop]: === Iteration 134 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:24,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:24,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1839507491, now seen corresponding path program 86 times [2019-08-05 10:46:24,098 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:24,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:24,114 WARN L254 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 94 conjunts are in the unsatisfiable core [2019-08-05 10:46:24,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:25,183 INFO L134 CoverageAnalysis]: Checked inductivity of 991 backedges. 0 proven. 991 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:25,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:25,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 10:46:25,184 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 10:46:25,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 10:46:25,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2255, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:46:25,184 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 49 states. [2019-08-05 10:46:26,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:26,560 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2019-08-05 10:46:26,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 10:46:26,560 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 48 [2019-08-05 10:46:26,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:26,561 INFO L225 Difference]: With dead ends: 59 [2019-08-05 10:46:26,561 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 10:46:26,561 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=97, Invalid=2255, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:46:26,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 10:46:26,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 54. [2019-08-05 10:46:26,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-05 10:46:26,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2019-08-05 10:46:26,563 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 48 [2019-08-05 10:46:26,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:26,563 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2019-08-05 10:46:26,563 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 10:46:26,563 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2019-08-05 10:46:26,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 10:46:26,564 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:26,564 INFO L399 BasicCegarLoop]: trace histogram [43, 2, 1, 1, 1] [2019-08-05 10:46:26,564 INFO L418 AbstractCegarLoop]: === Iteration 135 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:26,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:26,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1839581488, now seen corresponding path program 87 times [2019-08-05 10:46:26,565 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:26,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:26,579 WARN L254 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 93 conjunts are in the unsatisfiable core [2019-08-05 10:46:26,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:27,954 INFO L134 CoverageAnalysis]: Checked inductivity of 949 backedges. 1 proven. 948 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:27,954 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:27,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 10:46:27,955 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 10:46:27,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 10:46:27,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2253, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:46:27,955 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 49 states. [2019-08-05 10:46:29,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:29,311 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2019-08-05 10:46:29,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 10:46:29,311 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 48 [2019-08-05 10:46:29,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:29,312 INFO L225 Difference]: With dead ends: 57 [2019-08-05 10:46:29,312 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:46:29,312 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=99, Invalid=2253, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:46:29,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:46:29,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-08-05 10:46:29,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-05 10:46:29,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2019-08-05 10:46:29,314 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 48 [2019-08-05 10:46:29,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:29,314 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2019-08-05 10:46:29,314 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 10:46:29,314 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2019-08-05 10:46:29,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-05 10:46:29,315 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:29,315 INFO L399 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2019-08-05 10:46:29,315 INFO L418 AbstractCegarLoop]: === Iteration 136 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:29,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:29,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1190081130, now seen corresponding path program 46 times [2019-08-05 10:46:29,316 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:29,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:29,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 97 conjunts are in the unsatisfiable core [2019-08-05 10:46:29,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:30,426 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:30,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:30,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 10:46:30,426 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 10:46:30,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 10:46:30,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=2352, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:46:30,427 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 50 states. [2019-08-05 10:46:31,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:31,877 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2019-08-05 10:46:31,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 10:46:31,877 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 49 [2019-08-05 10:46:31,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:31,878 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:46:31,878 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 10:46:31,878 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=98, Invalid=2352, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:46:31,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 10:46:31,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 55. [2019-08-05 10:46:31,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 10:46:31,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2019-08-05 10:46:31,880 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 49 [2019-08-05 10:46:31,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:31,881 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2019-08-05 10:46:31,881 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 10:46:31,881 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2019-08-05 10:46:31,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-05 10:46:31,882 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:31,882 INFO L399 BasicCegarLoop]: trace histogram [45, 1, 1, 1, 1] [2019-08-05 10:46:31,882 INFO L418 AbstractCegarLoop]: === Iteration 137 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:31,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:31,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1190083517, now seen corresponding path program 88 times [2019-08-05 10:46:31,883 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:31,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:31,894 WARN L254 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 96 conjunts are in the unsatisfiable core [2019-08-05 10:46:31,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:33,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1036 backedges. 0 proven. 1036 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:33,769 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:33,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 10:46:33,769 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 10:46:33,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 10:46:33,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2351, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:46:33,770 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand 50 states. [2019-08-05 10:46:35,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:35,253 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2019-08-05 10:46:35,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 10:46:35,253 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 49 [2019-08-05 10:46:35,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:35,254 INFO L225 Difference]: With dead ends: 60 [2019-08-05 10:46:35,254 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:46:35,254 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=99, Invalid=2351, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:46:35,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:46:35,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 55. [2019-08-05 10:46:35,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 10:46:35,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2019-08-05 10:46:35,256 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 49 [2019-08-05 10:46:35,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:35,256 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2019-08-05 10:46:35,256 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 10:46:35,257 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2019-08-05 10:46:35,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-05 10:46:35,257 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:35,257 INFO L399 BasicCegarLoop]: trace histogram [44, 2, 1, 1, 1] [2019-08-05 10:46:35,257 INFO L418 AbstractCegarLoop]: === Iteration 138 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:35,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:35,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1190157514, now seen corresponding path program 89 times [2019-08-05 10:46:35,258 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:35,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:35,268 WARN L254 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 95 conjunts are in the unsatisfiable core [2019-08-05 10:46:35,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:36,349 INFO L134 CoverageAnalysis]: Checked inductivity of 993 backedges. 1 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:36,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:36,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 10:46:36,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 10:46:36,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 10:46:36,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2349, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:46:36,350 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand 50 states. [2019-08-05 10:46:37,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:37,927 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2019-08-05 10:46:37,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 10:46:37,927 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 49 [2019-08-05 10:46:37,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:37,928 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:46:37,928 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 10:46:37,928 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=101, Invalid=2349, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:46:37,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 10:46:37,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-08-05 10:46:37,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 10:46:37,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2019-08-05 10:46:37,929 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 49 [2019-08-05 10:46:37,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:37,930 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2019-08-05 10:46:37,930 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 10:46:37,930 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2019-08-05 10:46:37,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 10:46:37,930 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:37,930 INFO L399 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2019-08-05 10:46:37,930 INFO L418 AbstractCegarLoop]: === Iteration 139 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:37,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:37,931 INFO L82 PathProgramCache]: Analyzing trace with hash -1762192880, now seen corresponding path program 47 times [2019-08-05 10:46:37,931 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:37,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:37,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 99 conjunts are in the unsatisfiable core [2019-08-05 10:46:37,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:39,287 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:39,287 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:39,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 10:46:39,288 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 10:46:39,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 10:46:39,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=2450, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:46:39,288 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 51 states. [2019-08-05 10:46:40,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:40,861 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2019-08-05 10:46:40,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 10:46:40,862 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 50 [2019-08-05 10:46:40,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:40,862 INFO L225 Difference]: With dead ends: 62 [2019-08-05 10:46:40,862 INFO L226 Difference]: Without dead ends: 62 [2019-08-05 10:46:40,863 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=100, Invalid=2450, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:46:40,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-05 10:46:40,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 56. [2019-08-05 10:46:40,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-05 10:46:40,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2019-08-05 10:46:40,865 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 50 [2019-08-05 10:46:40,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:40,865 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2019-08-05 10:46:40,865 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 10:46:40,866 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2019-08-05 10:46:40,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 10:46:40,866 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:40,866 INFO L399 BasicCegarLoop]: trace histogram [46, 1, 1, 1, 1] [2019-08-05 10:46:40,867 INFO L418 AbstractCegarLoop]: === Iteration 140 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:40,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:40,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1762190493, now seen corresponding path program 90 times [2019-08-05 10:46:40,867 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:40,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:40,881 WARN L254 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 98 conjunts are in the unsatisfiable core [2019-08-05 10:46:40,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:42,012 INFO L134 CoverageAnalysis]: Checked inductivity of 1082 backedges. 0 proven. 1082 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:42,012 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:42,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 10:46:42,012 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 10:46:42,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 10:46:42,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2449, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:46:42,013 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand 51 states. [2019-08-05 10:46:43,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:43,688 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2019-08-05 10:46:43,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 10:46:43,688 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 50 [2019-08-05 10:46:43,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:43,689 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:46:43,689 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 10:46:43,689 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=101, Invalid=2449, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:46:43,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 10:46:43,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 56. [2019-08-05 10:46:43,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-05 10:46:43,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2019-08-05 10:46:43,691 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 50 [2019-08-05 10:46:43,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:43,691 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2019-08-05 10:46:43,691 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 10:46:43,691 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2019-08-05 10:46:43,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 10:46:43,692 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:43,692 INFO L399 BasicCegarLoop]: trace histogram [45, 2, 1, 1, 1] [2019-08-05 10:46:43,692 INFO L418 AbstractCegarLoop]: === Iteration 141 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:43,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:43,692 INFO L82 PathProgramCache]: Analyzing trace with hash -1762116496, now seen corresponding path program 91 times [2019-08-05 10:46:43,693 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:43,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:43,707 WARN L254 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 97 conjunts are in the unsatisfiable core [2019-08-05 10:46:43,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:44,842 INFO L134 CoverageAnalysis]: Checked inductivity of 1038 backedges. 1 proven. 1037 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:44,842 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:44,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 10:46:44,842 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 10:46:44,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 10:46:44,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2447, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:46:44,843 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand 51 states. [2019-08-05 10:46:46,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:46,247 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2019-08-05 10:46:46,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 10:46:46,248 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 50 [2019-08-05 10:46:46,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:46,248 INFO L225 Difference]: With dead ends: 59 [2019-08-05 10:46:46,248 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 10:46:46,249 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=103, Invalid=2447, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:46:46,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 10:46:46,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-08-05 10:46:46,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-05 10:46:46,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2019-08-05 10:46:46,250 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 50 [2019-08-05 10:46:46,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:46,251 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2019-08-05 10:46:46,251 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 10:46:46,251 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2019-08-05 10:46:46,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 10:46:46,252 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:46,252 INFO L399 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2019-08-05 10:46:46,252 INFO L418 AbstractCegarLoop]: === Iteration 142 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:46,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:46,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1206593322, now seen corresponding path program 48 times [2019-08-05 10:46:46,253 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:46,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:46,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 101 conjunts are in the unsatisfiable core [2019-08-05 10:46:46,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:47,526 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:47,527 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:47,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 10:46:47,527 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 10:46:47,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 10:46:47,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=2550, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:46:47,528 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 52 states. [2019-08-05 10:46:49,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:49,388 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2019-08-05 10:46:49,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 10:46:49,388 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 51 [2019-08-05 10:46:49,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:49,389 INFO L225 Difference]: With dead ends: 63 [2019-08-05 10:46:49,389 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:46:49,389 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=102, Invalid=2550, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:46:49,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:46:49,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 57. [2019-08-05 10:46:49,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 10:46:49,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2019-08-05 10:46:49,391 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 51 [2019-08-05 10:46:49,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:49,391 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2019-08-05 10:46:49,391 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 10:46:49,391 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2019-08-05 10:46:49,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 10:46:49,392 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:49,392 INFO L399 BasicCegarLoop]: trace histogram [47, 1, 1, 1, 1] [2019-08-05 10:46:49,392 INFO L418 AbstractCegarLoop]: === Iteration 143 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:49,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:49,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1206595709, now seen corresponding path program 92 times [2019-08-05 10:46:49,393 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:49,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:49,402 WARN L254 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 100 conjunts are in the unsatisfiable core [2019-08-05 10:46:49,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:50,587 INFO L134 CoverageAnalysis]: Checked inductivity of 1129 backedges. 0 proven. 1129 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:50,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:50,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 10:46:50,588 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 10:46:50,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 10:46:50,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2549, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:46:50,588 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand 52 states. [2019-08-05 10:46:52,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:52,144 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2019-08-05 10:46:52,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 10:46:52,145 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 51 [2019-08-05 10:46:52,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:52,145 INFO L225 Difference]: With dead ends: 62 [2019-08-05 10:46:52,145 INFO L226 Difference]: Without dead ends: 62 [2019-08-05 10:46:52,146 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=103, Invalid=2549, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:46:52,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-05 10:46:52,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 57. [2019-08-05 10:46:52,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 10:46:52,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2019-08-05 10:46:52,148 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 51 [2019-08-05 10:46:52,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:52,148 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2019-08-05 10:46:52,148 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 10:46:52,148 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2019-08-05 10:46:52,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 10:46:52,149 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:52,149 INFO L399 BasicCegarLoop]: trace histogram [46, 2, 1, 1, 1] [2019-08-05 10:46:52,149 INFO L418 AbstractCegarLoop]: === Iteration 144 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:52,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:52,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1206669706, now seen corresponding path program 93 times [2019-08-05 10:46:52,150 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:52,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:52,160 WARN L254 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 99 conjunts are in the unsatisfiable core [2019-08-05 10:46:52,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:53,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1084 backedges. 1 proven. 1083 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:53,651 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:53,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 10:46:53,651 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 10:46:53,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 10:46:53,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2547, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:46:53,652 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand 52 states. [2019-08-05 10:46:55,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:55,265 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2019-08-05 10:46:55,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 10:46:55,265 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 51 [2019-08-05 10:46:55,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:55,266 INFO L225 Difference]: With dead ends: 60 [2019-08-05 10:46:55,266 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 10:46:55,266 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=105, Invalid=2547, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:46:55,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 10:46:55,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-08-05 10:46:55,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 10:46:55,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2019-08-05 10:46:55,268 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 51 [2019-08-05 10:46:55,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:55,268 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2019-08-05 10:46:55,268 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 10:46:55,269 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2019-08-05 10:46:55,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 10:46:55,269 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:55,269 INFO L399 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2019-08-05 10:46:55,269 INFO L418 AbstractCegarLoop]: === Iteration 145 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:55,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:55,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1250314928, now seen corresponding path program 49 times [2019-08-05 10:46:55,270 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:55,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:55,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 103 conjunts are in the unsatisfiable core [2019-08-05 10:46:55,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:56,483 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:56,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:56,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 10:46:56,484 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 10:46:56,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 10:46:56,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=2652, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:46:56,484 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand 53 states. [2019-08-05 10:46:58,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:58,214 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2019-08-05 10:46:58,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 10:46:58,214 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 52 [2019-08-05 10:46:58,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:58,215 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:46:58,215 INFO L226 Difference]: Without dead ends: 64 [2019-08-05 10:46:58,215 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=104, Invalid=2652, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:46:58,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-05 10:46:58,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 58. [2019-08-05 10:46:58,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-05 10:46:58,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2019-08-05 10:46:58,217 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 52 [2019-08-05 10:46:58,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:58,217 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2019-08-05 10:46:58,218 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 10:46:58,218 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2019-08-05 10:46:58,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 10:46:58,218 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:58,218 INFO L399 BasicCegarLoop]: trace histogram [48, 1, 1, 1, 1] [2019-08-05 10:46:58,219 INFO L418 AbstractCegarLoop]: === Iteration 146 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:58,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:58,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1250312541, now seen corresponding path program 94 times [2019-08-05 10:46:58,219 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:58,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:58,229 WARN L254 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 102 conjunts are in the unsatisfiable core [2019-08-05 10:46:58,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:59,451 INFO L134 CoverageAnalysis]: Checked inductivity of 1177 backedges. 0 proven. 1177 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:59,452 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:59,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 10:46:59,452 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 10:46:59,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 10:46:59,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2651, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:46:59,453 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand 53 states. [2019-08-05 10:47:01,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:01,162 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2019-08-05 10:47:01,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 10:47:01,163 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 52 [2019-08-05 10:47:01,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:01,163 INFO L225 Difference]: With dead ends: 63 [2019-08-05 10:47:01,163 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:47:01,164 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=105, Invalid=2651, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:47:01,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:47:01,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 58. [2019-08-05 10:47:01,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-05 10:47:01,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2019-08-05 10:47:01,165 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 52 [2019-08-05 10:47:01,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:01,166 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2019-08-05 10:47:01,166 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 10:47:01,166 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2019-08-05 10:47:01,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 10:47:01,167 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:01,167 INFO L399 BasicCegarLoop]: trace histogram [47, 2, 1, 1, 1] [2019-08-05 10:47:01,167 INFO L418 AbstractCegarLoop]: === Iteration 147 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:01,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:01,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1250238544, now seen corresponding path program 95 times [2019-08-05 10:47:01,168 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:01,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:01,183 WARN L254 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 101 conjunts are in the unsatisfiable core [2019-08-05 10:47:01,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:02,564 INFO L134 CoverageAnalysis]: Checked inductivity of 1131 backedges. 1 proven. 1130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:02,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:02,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 10:47:02,564 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 10:47:02,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 10:47:02,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2649, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:47:02,565 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand 53 states. [2019-08-05 10:47:04,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:04,280 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2019-08-05 10:47:04,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 10:47:04,281 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 52 [2019-08-05 10:47:04,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:04,281 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:47:04,281 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 10:47:04,282 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=107, Invalid=2649, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:47:04,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 10:47:04,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-08-05 10:47:04,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-05 10:47:04,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2019-08-05 10:47:04,283 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 52 [2019-08-05 10:47:04,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:04,284 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2019-08-05 10:47:04,284 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 10:47:04,284 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2019-08-05 10:47:04,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 10:47:04,285 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:04,285 INFO L399 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2019-08-05 10:47:04,285 INFO L418 AbstractCegarLoop]: === Iteration 148 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:04,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:04,285 INFO L82 PathProgramCache]: Analyzing trace with hash -105059350, now seen corresponding path program 50 times [2019-08-05 10:47:04,286 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:04,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:04,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 105 conjunts are in the unsatisfiable core [2019-08-05 10:47:04,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:05,606 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:05,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:05,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 10:47:05,607 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 10:47:05,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 10:47:05,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=2756, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:47:05,607 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand 54 states. [2019-08-05 10:47:07,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:07,309 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2019-08-05 10:47:07,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 10:47:07,310 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 53 [2019-08-05 10:47:07,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:07,310 INFO L225 Difference]: With dead ends: 65 [2019-08-05 10:47:07,310 INFO L226 Difference]: Without dead ends: 65 [2019-08-05 10:47:07,311 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=106, Invalid=2756, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:47:07,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-05 10:47:07,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 59. [2019-08-05 10:47:07,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 10:47:07,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2019-08-05 10:47:07,313 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 53 [2019-08-05 10:47:07,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:07,313 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2019-08-05 10:47:07,313 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 10:47:07,313 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2019-08-05 10:47:07,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 10:47:07,314 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:07,314 INFO L399 BasicCegarLoop]: trace histogram [49, 1, 1, 1, 1] [2019-08-05 10:47:07,314 INFO L418 AbstractCegarLoop]: === Iteration 149 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:07,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:07,314 INFO L82 PathProgramCache]: Analyzing trace with hash -105056963, now seen corresponding path program 96 times [2019-08-05 10:47:07,315 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:07,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:07,328 WARN L254 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 104 conjunts are in the unsatisfiable core [2019-08-05 10:47:07,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:08,872 INFO L134 CoverageAnalysis]: Checked inductivity of 1226 backedges. 0 proven. 1226 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:08,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:08,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 10:47:08,873 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 10:47:08,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 10:47:08,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2755, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:47:08,874 INFO L87 Difference]: Start difference. First operand 59 states and 64 transitions. Second operand 54 states. [2019-08-05 10:47:10,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:10,595 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2019-08-05 10:47:10,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 10:47:10,596 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 53 [2019-08-05 10:47:10,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:10,596 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:47:10,596 INFO L226 Difference]: Without dead ends: 64 [2019-08-05 10:47:10,597 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=107, Invalid=2755, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:47:10,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-05 10:47:10,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 59. [2019-08-05 10:47:10,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 10:47:10,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2019-08-05 10:47:10,598 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 53 [2019-08-05 10:47:10,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:10,598 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2019-08-05 10:47:10,598 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 10:47:10,599 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2019-08-05 10:47:10,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 10:47:10,599 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:10,599 INFO L399 BasicCegarLoop]: trace histogram [48, 2, 1, 1, 1] [2019-08-05 10:47:10,599 INFO L418 AbstractCegarLoop]: === Iteration 150 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:10,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:10,600 INFO L82 PathProgramCache]: Analyzing trace with hash -104982966, now seen corresponding path program 97 times [2019-08-05 10:47:10,600 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:10,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:10,612 WARN L254 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 103 conjunts are in the unsatisfiable core [2019-08-05 10:47:10,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:11,884 INFO L134 CoverageAnalysis]: Checked inductivity of 1179 backedges. 1 proven. 1178 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:11,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:11,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 10:47:11,885 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 10:47:11,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 10:47:11,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2753, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:47:11,885 INFO L87 Difference]: Start difference. First operand 59 states and 64 transitions. Second operand 54 states. [2019-08-05 10:47:13,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:13,679 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2019-08-05 10:47:13,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 10:47:13,679 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 53 [2019-08-05 10:47:13,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:13,680 INFO L225 Difference]: With dead ends: 62 [2019-08-05 10:47:13,680 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 10:47:13,680 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=109, Invalid=2753, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:47:13,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 10:47:13,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-08-05 10:47:13,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 10:47:13,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2019-08-05 10:47:13,682 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 53 [2019-08-05 10:47:13,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:13,682 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2019-08-05 10:47:13,682 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 10:47:13,682 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2019-08-05 10:47:13,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 10:47:13,682 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:13,682 INFO L399 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2019-08-05 10:47:13,683 INFO L418 AbstractCegarLoop]: === Iteration 151 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:13,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:13,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1038125200, now seen corresponding path program 51 times [2019-08-05 10:47:13,683 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:13,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:13,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 107 conjunts are in the unsatisfiable core [2019-08-05 10:47:13,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:15,026 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:15,027 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:15,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 10:47:15,027 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 10:47:15,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 10:47:15,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=2862, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:47:15,027 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 55 states. [2019-08-05 10:47:16,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:16,789 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2019-08-05 10:47:16,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 10:47:16,796 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 54 [2019-08-05 10:47:16,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:16,796 INFO L225 Difference]: With dead ends: 66 [2019-08-05 10:47:16,796 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:47:16,797 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=108, Invalid=2862, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:47:16,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:47:16,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 60. [2019-08-05 10:47:16,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-05 10:47:16,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2019-08-05 10:47:16,798 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 54 [2019-08-05 10:47:16,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:16,798 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2019-08-05 10:47:16,798 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 10:47:16,798 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2019-08-05 10:47:16,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 10:47:16,798 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:16,798 INFO L399 BasicCegarLoop]: trace histogram [50, 1, 1, 1, 1] [2019-08-05 10:47:16,798 INFO L418 AbstractCegarLoop]: === Iteration 152 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:16,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:16,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1038127587, now seen corresponding path program 98 times [2019-08-05 10:47:16,799 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:16,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:16,816 WARN L254 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 106 conjunts are in the unsatisfiable core [2019-08-05 10:47:16,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:18,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1276 backedges. 0 proven. 1276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:18,443 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:18,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 10:47:18,444 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 10:47:18,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 10:47:18,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2861, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:47:18,444 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand 55 states. [2019-08-05 10:47:20,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:20,452 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2019-08-05 10:47:20,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 10:47:20,452 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 54 [2019-08-05 10:47:20,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:20,453 INFO L225 Difference]: With dead ends: 65 [2019-08-05 10:47:20,453 INFO L226 Difference]: Without dead ends: 65 [2019-08-05 10:47:20,453 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=109, Invalid=2861, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:47:20,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-05 10:47:20,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 60. [2019-08-05 10:47:20,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-05 10:47:20,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2019-08-05 10:47:20,455 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 54 [2019-08-05 10:47:20,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:20,455 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2019-08-05 10:47:20,455 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 10:47:20,455 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2019-08-05 10:47:20,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 10:47:20,455 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:20,456 INFO L399 BasicCegarLoop]: trace histogram [49, 2, 1, 1, 1] [2019-08-05 10:47:20,456 INFO L418 AbstractCegarLoop]: === Iteration 153 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:20,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:20,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1038201584, now seen corresponding path program 99 times [2019-08-05 10:47:20,457 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:20,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:20,471 WARN L254 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 105 conjunts are in the unsatisfiable core [2019-08-05 10:47:20,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:21,809 INFO L134 CoverageAnalysis]: Checked inductivity of 1228 backedges. 1 proven. 1227 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:21,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:21,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 10:47:21,809 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 10:47:21,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 10:47:21,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=2859, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:47:21,810 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand 55 states. [2019-08-05 10:47:23,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:23,443 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2019-08-05 10:47:23,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 10:47:23,444 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 54 [2019-08-05 10:47:23,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:23,444 INFO L225 Difference]: With dead ends: 63 [2019-08-05 10:47:23,445 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:47:23,445 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=111, Invalid=2859, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:47:23,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:47:23,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-08-05 10:47:23,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-05 10:47:23,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2019-08-05 10:47:23,447 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 54 [2019-08-05 10:47:23,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:23,447 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2019-08-05 10:47:23,447 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 10:47:23,448 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2019-08-05 10:47:23,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-05 10:47:23,448 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:23,448 INFO L399 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2019-08-05 10:47:23,448 INFO L418 AbstractCegarLoop]: === Iteration 154 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:23,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:23,449 INFO L82 PathProgramCache]: Analyzing trace with hash 2117107882, now seen corresponding path program 52 times [2019-08-05 10:47:23,449 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:23,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:23,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 109 conjunts are in the unsatisfiable core [2019-08-05 10:47:23,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:25,145 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:25,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:25,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 10:47:25,146 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 10:47:25,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 10:47:25,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=2970, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:47:25,147 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 56 states. [2019-08-05 10:47:27,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:27,072 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2019-08-05 10:47:27,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 10:47:27,073 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 55 [2019-08-05 10:47:27,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:27,073 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:47:27,074 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 10:47:27,074 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=110, Invalid=2970, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:47:27,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 10:47:27,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 61. [2019-08-05 10:47:27,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 10:47:27,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2019-08-05 10:47:27,076 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 55 [2019-08-05 10:47:27,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:27,077 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2019-08-05 10:47:27,077 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 10:47:27,077 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2019-08-05 10:47:27,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-05 10:47:27,078 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:27,078 INFO L399 BasicCegarLoop]: trace histogram [51, 1, 1, 1, 1] [2019-08-05 10:47:27,078 INFO L418 AbstractCegarLoop]: === Iteration 155 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:27,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:27,078 INFO L82 PathProgramCache]: Analyzing trace with hash 2117110269, now seen corresponding path program 100 times [2019-08-05 10:47:27,079 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:27,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:27,095 WARN L254 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 108 conjunts are in the unsatisfiable core [2019-08-05 10:47:27,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:28,465 INFO L134 CoverageAnalysis]: Checked inductivity of 1327 backedges. 0 proven. 1327 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:28,465 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:28,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 10:47:28,465 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 10:47:28,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 10:47:28,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=2969, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:47:28,466 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand 56 states. [2019-08-05 10:47:30,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:30,430 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2019-08-05 10:47:30,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 10:47:30,430 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 55 [2019-08-05 10:47:30,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:30,430 INFO L225 Difference]: With dead ends: 66 [2019-08-05 10:47:30,431 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:47:30,431 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=111, Invalid=2969, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:47:30,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:47:30,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 61. [2019-08-05 10:47:30,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 10:47:30,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2019-08-05 10:47:30,433 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 55 [2019-08-05 10:47:30,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:30,433 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2019-08-05 10:47:30,433 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 10:47:30,433 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2019-08-05 10:47:30,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-05 10:47:30,434 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:30,434 INFO L399 BasicCegarLoop]: trace histogram [50, 2, 1, 1, 1] [2019-08-05 10:47:30,434 INFO L418 AbstractCegarLoop]: === Iteration 156 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:30,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:30,434 INFO L82 PathProgramCache]: Analyzing trace with hash 2117184266, now seen corresponding path program 101 times [2019-08-05 10:47:30,435 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:30,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:30,450 WARN L254 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 107 conjunts are in the unsatisfiable core [2019-08-05 10:47:30,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:31,872 INFO L134 CoverageAnalysis]: Checked inductivity of 1278 backedges. 1 proven. 1277 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:31,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:31,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 10:47:31,872 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 10:47:31,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 10:47:31,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=2967, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:47:31,873 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand 56 states. [2019-08-05 10:47:33,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:33,595 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2019-08-05 10:47:33,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 10:47:33,596 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 55 [2019-08-05 10:47:33,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:33,596 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:47:33,596 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 10:47:33,597 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=113, Invalid=2967, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:47:33,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 10:47:33,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-08-05 10:47:33,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 10:47:33,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2019-08-05 10:47:33,598 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 55 [2019-08-05 10:47:33,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:33,599 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2019-08-05 10:47:33,599 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 10:47:33,599 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2019-08-05 10:47:33,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-05 10:47:33,600 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:33,600 INFO L399 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2019-08-05 10:47:33,600 INFO L418 AbstractCegarLoop]: === Iteration 157 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:33,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:33,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1205832656, now seen corresponding path program 53 times [2019-08-05 10:47:33,601 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:33,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:33,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 111 conjunts are in the unsatisfiable core [2019-08-05 10:47:33,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:35,285 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:35,285 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:35,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 10:47:35,286 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 10:47:35,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 10:47:35,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=3080, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:47:35,286 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand 57 states. [2019-08-05 10:47:37,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:37,247 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2019-08-05 10:47:37,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 10:47:37,248 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 56 [2019-08-05 10:47:37,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:37,248 INFO L225 Difference]: With dead ends: 68 [2019-08-05 10:47:37,248 INFO L226 Difference]: Without dead ends: 68 [2019-08-05 10:47:37,249 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=112, Invalid=3080, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:47:37,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-05 10:47:37,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 62. [2019-08-05 10:47:37,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-05 10:47:37,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2019-08-05 10:47:37,250 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 56 [2019-08-05 10:47:37,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:37,251 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2019-08-05 10:47:37,251 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 10:47:37,251 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2019-08-05 10:47:37,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-05 10:47:37,251 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:37,251 INFO L399 BasicCegarLoop]: trace histogram [52, 1, 1, 1, 1] [2019-08-05 10:47:37,251 INFO L418 AbstractCegarLoop]: === Iteration 158 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:37,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:37,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1205835043, now seen corresponding path program 102 times [2019-08-05 10:47:37,252 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:37,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:37,263 WARN L254 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 110 conjunts are in the unsatisfiable core [2019-08-05 10:47:37,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:38,654 INFO L134 CoverageAnalysis]: Checked inductivity of 1379 backedges. 0 proven. 1379 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:38,654 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:38,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 10:47:38,654 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 10:47:38,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 10:47:38,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3079, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:47:38,655 INFO L87 Difference]: Start difference. First operand 62 states and 67 transitions. Second operand 57 states. [2019-08-05 10:47:40,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:40,724 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2019-08-05 10:47:40,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 10:47:40,725 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 56 [2019-08-05 10:47:40,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:40,725 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:47:40,725 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 10:47:40,726 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=113, Invalid=3079, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:47:40,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 10:47:40,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 62. [2019-08-05 10:47:40,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-05 10:47:40,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2019-08-05 10:47:40,727 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 56 [2019-08-05 10:47:40,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:40,728 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2019-08-05 10:47:40,728 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 10:47:40,728 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2019-08-05 10:47:40,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-05 10:47:40,728 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:40,728 INFO L399 BasicCegarLoop]: trace histogram [51, 2, 1, 1, 1] [2019-08-05 10:47:40,729 INFO L418 AbstractCegarLoop]: === Iteration 159 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:40,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:40,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1205909040, now seen corresponding path program 103 times [2019-08-05 10:47:40,729 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:40,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:40,742 WARN L254 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 109 conjunts are in the unsatisfiable core [2019-08-05 10:47:40,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:42,145 INFO L134 CoverageAnalysis]: Checked inductivity of 1329 backedges. 1 proven. 1328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:42,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:42,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 10:47:42,146 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 10:47:42,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 10:47:42,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3077, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:47:42,147 INFO L87 Difference]: Start difference. First operand 62 states and 67 transitions. Second operand 57 states. [2019-08-05 10:47:44,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:44,069 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2019-08-05 10:47:44,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 10:47:44,069 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 56 [2019-08-05 10:47:44,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:44,069 INFO L225 Difference]: With dead ends: 65 [2019-08-05 10:47:44,069 INFO L226 Difference]: Without dead ends: 62 [2019-08-05 10:47:44,070 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=115, Invalid=3077, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:47:44,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-05 10:47:44,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-08-05 10:47:44,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-05 10:47:44,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2019-08-05 10:47:44,071 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 56 [2019-08-05 10:47:44,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:44,071 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2019-08-05 10:47:44,071 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 10:47:44,071 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2019-08-05 10:47:44,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-05 10:47:44,071 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:44,071 INFO L399 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2019-08-05 10:47:44,072 INFO L418 AbstractCegarLoop]: === Iteration 160 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:44,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:44,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1273895574, now seen corresponding path program 54 times [2019-08-05 10:47:44,072 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:44,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:44,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 113 conjunts are in the unsatisfiable core [2019-08-05 10:47:44,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:45,831 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:45,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:45,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 10:47:45,832 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 10:47:45,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 10:47:45,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=3192, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:47:45,833 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand 58 states. [2019-08-05 10:47:47,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:47,802 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2019-08-05 10:47:47,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 10:47:47,802 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 57 [2019-08-05 10:47:47,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:47,803 INFO L225 Difference]: With dead ends: 69 [2019-08-05 10:47:47,803 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:47:47,803 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=114, Invalid=3192, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:47:47,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:47:47,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 63. [2019-08-05 10:47:47,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 10:47:47,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2019-08-05 10:47:47,805 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 57 [2019-08-05 10:47:47,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:47,805 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2019-08-05 10:47:47,805 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 10:47:47,805 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2019-08-05 10:47:47,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-05 10:47:47,806 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:47,806 INFO L399 BasicCegarLoop]: trace histogram [53, 1, 1, 1, 1] [2019-08-05 10:47:47,806 INFO L418 AbstractCegarLoop]: === Iteration 161 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:47,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:47,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1273893187, now seen corresponding path program 104 times [2019-08-05 10:47:47,807 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:47,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:47,819 WARN L254 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 112 conjunts are in the unsatisfiable core [2019-08-05 10:47:47,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:49,556 INFO L134 CoverageAnalysis]: Checked inductivity of 1432 backedges. 0 proven. 1432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:49,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:49,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 10:47:49,557 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 10:47:49,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 10:47:49,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3191, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:47:49,557 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand 58 states. [2019-08-05 10:47:51,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:51,639 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2019-08-05 10:47:51,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 10:47:51,640 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 57 [2019-08-05 10:47:51,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:51,640 INFO L225 Difference]: With dead ends: 68 [2019-08-05 10:47:51,641 INFO L226 Difference]: Without dead ends: 68 [2019-08-05 10:47:51,641 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=115, Invalid=3191, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:47:51,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-05 10:47:51,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 63. [2019-08-05 10:47:51,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 10:47:51,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2019-08-05 10:47:51,642 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 57 [2019-08-05 10:47:51,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:51,643 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2019-08-05 10:47:51,643 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 10:47:51,643 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2019-08-05 10:47:51,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-05 10:47:51,643 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:51,644 INFO L399 BasicCegarLoop]: trace histogram [52, 2, 1, 1, 1] [2019-08-05 10:47:51,644 INFO L418 AbstractCegarLoop]: === Iteration 162 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:51,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:51,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1273819190, now seen corresponding path program 105 times [2019-08-05 10:47:51,645 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:51,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:51,657 WARN L254 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 111 conjunts are in the unsatisfiable core [2019-08-05 10:47:51,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:53,140 INFO L134 CoverageAnalysis]: Checked inductivity of 1381 backedges. 1 proven. 1380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:53,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:53,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 10:47:53,141 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 10:47:53,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 10:47:53,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3189, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:47:53,141 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand 58 states. [2019-08-05 10:47:55,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:55,331 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2019-08-05 10:47:55,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 10:47:55,332 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 57 [2019-08-05 10:47:55,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:55,332 INFO L225 Difference]: With dead ends: 66 [2019-08-05 10:47:55,332 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:47:55,333 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=117, Invalid=3189, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:47:55,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:47:55,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-08-05 10:47:55,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 10:47:55,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2019-08-05 10:47:55,334 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 57 [2019-08-05 10:47:55,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:55,334 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2019-08-05 10:47:55,335 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 10:47:55,335 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2019-08-05 10:47:55,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 10:47:55,335 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:55,335 INFO L399 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2019-08-05 10:47:55,336 INFO L418 AbstractCegarLoop]: === Iteration 163 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:55,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:55,336 INFO L82 PathProgramCache]: Analyzing trace with hash -836059376, now seen corresponding path program 55 times [2019-08-05 10:47:55,336 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:55,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:55,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 115 conjunts are in the unsatisfiable core [2019-08-05 10:47:55,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:56,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:56,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:56,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 10:47:56,976 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 10:47:56,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 10:47:56,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=3306, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:47:56,976 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 59 states. [2019-08-05 10:47:59,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:59,124 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2019-08-05 10:47:59,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 10:47:59,125 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 58 [2019-08-05 10:47:59,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:59,125 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:47:59,126 INFO L226 Difference]: Without dead ends: 70 [2019-08-05 10:47:59,126 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=116, Invalid=3306, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:47:59,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-05 10:47:59,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 64. [2019-08-05 10:47:59,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-05 10:47:59,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 69 transitions. [2019-08-05 10:47:59,128 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 69 transitions. Word has length 58 [2019-08-05 10:47:59,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:59,128 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 69 transitions. [2019-08-05 10:47:59,128 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 10:47:59,128 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 69 transitions. [2019-08-05 10:47:59,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 10:47:59,128 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:59,129 INFO L399 BasicCegarLoop]: trace histogram [54, 1, 1, 1, 1] [2019-08-05 10:47:59,129 INFO L418 AbstractCegarLoop]: === Iteration 164 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:59,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:59,129 INFO L82 PathProgramCache]: Analyzing trace with hash -836056989, now seen corresponding path program 106 times [2019-08-05 10:47:59,130 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:59,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:59,143 WARN L254 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 114 conjunts are in the unsatisfiable core [2019-08-05 10:47:59,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2019-08-05 10:47:59,850 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2019-08-05 10:47:59,851 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 10:47:59,855 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 10:47:59,855 INFO L202 PluginConnector]: Adding new model DynamicUnsatCoresHelpful01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:47:59 BoogieIcfgContainer [2019-08-05 10:47:59,855 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:47:59,864 INFO L168 Benchmark]: Toolchain (without parser) took 245144.11 ms. Allocated memory was 142.1 MB in the beginning and 205.5 MB in the end (delta: 63.4 MB). Free memory was 110.3 MB in the beginning and 154.8 MB in the end (delta: -44.5 MB). Peak memory consumption was 150.7 MB. Max. memory is 7.1 GB. [2019-08-05 10:47:59,865 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 142.1 MB. Free memory was 111.5 MB in the beginning and 111.3 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-08-05 10:47:59,866 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.00 ms. Allocated memory is still 142.1 MB. Free memory was 110.3 MB in the beginning and 108.5 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-08-05 10:47:59,866 INFO L168 Benchmark]: Boogie Preprocessor took 21.74 ms. Allocated memory is still 142.1 MB. Free memory was 108.5 MB in the beginning and 107.2 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:47:59,867 INFO L168 Benchmark]: RCFGBuilder took 333.24 ms. Allocated memory is still 142.1 MB. Free memory was 107.2 MB in the beginning and 96.7 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. [2019-08-05 10:47:59,868 INFO L168 Benchmark]: TraceAbstraction took 244742.58 ms. Allocated memory was 142.1 MB in the beginning and 210.2 MB in the end (delta: 68.2 MB). Free memory was 96.5 MB in the beginning and 157.3 MB in the end (delta: -60.8 MB). Peak memory consumption was 136.9 MB. Max. memory is 7.1 GB. [2019-08-05 10:47:59,870 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.21 ms. Allocated memory is still 142.1 MB. Free memory was 111.5 MB in the beginning and 111.3 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 35.00 ms. Allocated memory is still 142.1 MB. Free memory was 110.3 MB in the beginning and 108.5 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 21.74 ms. Allocated memory is still 142.1 MB. Free memory was 108.5 MB in the beginning and 107.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 333.24 ms. Allocated memory is still 142.1 MB. Free memory was 107.2 MB in the beginning and 96.7 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 244742.58 ms. Allocated memory was 142.1 MB in the beginning and 210.2 MB in the end (delta: 68.2 MB). Free memory was 96.5 MB in the beginning and 157.3 MB in the end (delta: -60.8 MB). Peak memory consumption was 136.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 32]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 32). Cancelled while BasicCegarLoop was analyzing trace of length 59 with TraceHistMax 54,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. TIMEOUT Result, 244.6s OverallTime, 164 OverallIterations, 55 TraceHistogramMax, 124.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 761 SDtfs, 900 SDslu, 15019 SDs, 0 SdLazy, 186689 SolverSat, 358 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 102.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4835 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4833 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 114.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=64occurred in iteration=163, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 163 MinimizatonAttempts, 597 StatesRemovedByMinimization, 110 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 116.7s InterpolantComputationTime, 4998 NumberOfCodeBlocks, 4998 NumberOfCodeBlocksAsserted, 163 NumberOfCheckSat, 4835 ConstructedInterpolants, 0 QuantifiedInterpolants, 1352512 SizeOfPredicates, 52 NumberOfNonLiveVariables, 19349 ConjunctsInSsa, 9670 ConjunctsInUnsatCore, 163 InterpolantComputations, 2 PerfectInterpolantSequences, 55/80512 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown