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/tooDifficultLoopInvariant/HierarchicalTraceAbstraction/GeometricalCake.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-04 21:46:50,529 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-04 21:46:50,532 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-04 21:46:50,548 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-04 21:46:50,548 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-04 21:46:50,549 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-04 21:46:50,552 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-04 21:46:50,554 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-04 21:46:50,557 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-04 21:46:50,560 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-04 21:46:50,561 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-04 21:46:50,561 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-04 21:46:50,562 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-04 21:46:50,563 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-04 21:46:50,564 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-04 21:46:50,565 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-04 21:46:50,566 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-04 21:46:50,566 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-04 21:46:50,570 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-04 21:46:50,572 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-04 21:46:50,577 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-04 21:46:50,578 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-04 21:46:50,583 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-04 21:46:50,584 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-04 21:46:50,588 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-04 21:46:50,588 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-04 21:46:50,588 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-04 21:46:50,591 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-04 21:46:50,592 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-04 21:46:50,593 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-04 21:46:50,593 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-04 21:46:50,594 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-04 21:46:50,597 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-04 21:46:50,598 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-04 21:46:50,599 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-04 21:46:50,599 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-04 21:46:50,600 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-04 21:46:50,600 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-04 21:46:50,600 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-04 21:46:50,601 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-04 21:46:50,602 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-04 21:46:50,630 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-04 21:46:50,644 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-04 21:46:50,648 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-04 21:46:50,650 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-04 21:46:50,651 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-04 21:46:50,652 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HierarchicalTraceAbstraction/GeometricalCake.bpl [2019-08-04 21:46:50,652 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HierarchicalTraceAbstraction/GeometricalCake.bpl' [2019-08-04 21:46:50,681 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-04 21:46:50,683 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-04 21:46:50,684 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-04 21:46:50,684 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-04 21:46:50,684 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-04 21:46:50,703 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:46:50" (1/1) ... [2019-08-04 21:46:50,712 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:46:50" (1/1) ... [2019-08-04 21:46:50,719 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-04 21:46:50,719 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-04 21:46:50,720 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-04 21:46:50,722 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-04 21:46:50,722 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-04 21:46:50,723 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-04 21:46:50,723 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-04 21:46:50,736 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:46:50" (1/1) ... [2019-08-04 21:46:50,736 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:46:50" (1/1) ... [2019-08-04 21:46:50,736 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:46:50" (1/1) ... [2019-08-04 21:46:50,737 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:46:50" (1/1) ... [2019-08-04 21:46:50,740 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:46:50" (1/1) ... [2019-08-04 21:46:50,745 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:46:50" (1/1) ... [2019-08-04 21:46:50,746 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:46:50" (1/1) ... [2019-08-04 21:46:50,747 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-04 21:46:50,748 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-04 21:46:50,748 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-04 21:46:50,748 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-04 21:46:50,749 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:46:50" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-04 21:46:50,825 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-08-04 21:46:50,826 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-04 21:46:50,826 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-04 21:46:51,077 INFO L275 CfgBuilder]: Using library mode [2019-08-04 21:46:51,077 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-08-04 21:46:51,079 INFO L202 PluginConnector]: Adding new model GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 09:46:51 BoogieIcfgContainer [2019-08-04 21:46:51,079 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-04 21:46:51,082 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-04 21:46:51,082 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-04 21:46:51,086 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-04 21:46:51,087 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:46:50" (1/2) ... [2019-08-04 21:46:51,088 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5beb9556 and model type GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 09:46:51, skipping insertion in model container [2019-08-04 21:46:51,088 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 09:46:51" (2/2) ... [2019-08-04 21:46:51,090 INFO L109 eAbstractionObserver]: Analyzing ICFG GeometricalCake.bpl [2019-08-04 21:46:51,099 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-04 21:46:51,107 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-04 21:46:51,124 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-04 21:46:51,148 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-04 21:46:51,149 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-04 21:46:51,149 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-04 21:46:51,149 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-04 21:46:51,149 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-04 21:46:51,149 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-04 21:46:51,150 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-04 21:46:51,150 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-04 21:46:51,150 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-04 21:46:51,164 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states. [2019-08-04 21:46:51,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-08-04 21:46:51,173 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:51,174 INFO L399 BasicCegarLoop]: trace histogram [1, 1] [2019-08-04 21:46:51,176 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:46:51,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:51,183 INFO L82 PathProgramCache]: Analyzing trace with hash 967, now seen corresponding path program 1 times [2019-08-04 21:46:51,232 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:51,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:51,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-04 21:46:51,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:51,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:51,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:46:51,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-04 21:46:51,314 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-04 21:46:51,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-04 21:46:51,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-04 21:46:51,330 INFO L87 Difference]: Start difference. First operand 4 states. Second operand 3 states. [2019-08-04 21:46:51,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:51,405 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-04 21:46:51,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-04 21:46:51,407 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-08-04 21:46:51,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:51,418 INFO L225 Difference]: With dead ends: 6 [2019-08-04 21:46:51,419 INFO L226 Difference]: Without dead ends: 4 [2019-08-04 21:46:51,421 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-04 21:46:51,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4 states. [2019-08-04 21:46:51,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4 to 4. [2019-08-04 21:46:51,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-08-04 21:46:51,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4 transitions. [2019-08-04 21:46:51,455 INFO L78 Accepts]: Start accepts. Automaton has 4 states and 4 transitions. Word has length 2 [2019-08-04 21:46:51,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:51,455 INFO L475 AbstractCegarLoop]: Abstraction has 4 states and 4 transitions. [2019-08-04 21:46:51,455 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-04 21:46:51,456 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states and 4 transitions. [2019-08-04 21:46:51,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-04 21:46:51,456 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:51,456 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-04 21:46:51,457 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:46:51,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:51,457 INFO L82 PathProgramCache]: Analyzing trace with hash 29921, now seen corresponding path program 1 times [2019-08-04 21:46:51,458 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:51,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:51,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-04 21:46:51,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:51,727 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:51,728 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:51,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2019-08-04 21:46:51,730 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-04 21:46:51,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-04 21:46:51,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-04 21:46:51,731 INFO L87 Difference]: Start difference. First operand 4 states and 4 transitions. Second operand 4 states. [2019-08-04 21:46:51,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:51,807 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-08-04 21:46:51,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-04 21:46:51,808 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-08-04 21:46:51,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:51,809 INFO L225 Difference]: With dead ends: 5 [2019-08-04 21:46:51,809 INFO L226 Difference]: Without dead ends: 5 [2019-08-04 21:46:51,810 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-04 21:46:51,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-04 21:46:51,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-04 21:46:51,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-04 21:46:51,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-04 21:46:51,812 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-04 21:46:51,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:51,813 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-04 21:46:51,813 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-04 21:46:51,813 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-04 21:46:51,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-04 21:46:51,814 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:51,814 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1] [2019-08-04 21:46:51,814 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:46:51,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:51,815 INFO L82 PathProgramCache]: Analyzing trace with hash 927495, now seen corresponding path program 2 times [2019-08-04 21:46:51,816 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:51,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:51,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-04 21:46:51,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:52,019 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-04 21:46:52,019 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:52,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-04 21:46:52,020 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-04 21:46:52,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-04 21:46:52,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-04 21:46:52,021 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 5 states. [2019-08-04 21:46:52,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:52,085 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-04 21:46:52,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-04 21:46:52,087 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2019-08-04 21:46:52,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:52,088 INFO L225 Difference]: With dead ends: 6 [2019-08-04 21:46:52,088 INFO L226 Difference]: Without dead ends: 6 [2019-08-04 21:46:52,089 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-04 21:46:52,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-04 21:46:52,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-04 21:46:52,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-04 21:46:52,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-04 21:46:52,091 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-04 21:46:52,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:52,092 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-04 21:46:52,092 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-04 21:46:52,092 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-04 21:46:52,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-04 21:46:52,093 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:52,093 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1] [2019-08-04 21:46:52,093 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:46:52,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:52,094 INFO L82 PathProgramCache]: Analyzing trace with hash 28752289, now seen corresponding path program 3 times [2019-08-04 21:46:52,095 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:52,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:52,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-04 21:46:52,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:52,261 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-04 21:46:52,261 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:52,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-04 21:46:52,262 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-04 21:46:52,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-04 21:46:52,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-08-04 21:46:52,264 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 6 states. [2019-08-04 21:46:52,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:52,354 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-04 21:46:52,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-04 21:46:52,355 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-08-04 21:46:52,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:52,355 INFO L225 Difference]: With dead ends: 7 [2019-08-04 21:46:52,355 INFO L226 Difference]: Without dead ends: 7 [2019-08-04 21:46:52,356 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-08-04 21:46:52,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-04 21:46:52,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-04 21:46:52,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-04 21:46:52,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-04 21:46:52,358 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-04 21:46:52,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:52,358 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-04 21:46:52,359 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-04 21:46:52,359 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-04 21:46:52,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-04 21:46:52,359 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:52,359 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1] [2019-08-04 21:46:52,360 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:46:52,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:52,360 INFO L82 PathProgramCache]: Analyzing trace with hash 891320903, now seen corresponding path program 4 times [2019-08-04 21:46:52,361 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:52,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:52,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-04 21:46:52,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:52,723 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-04 21:46:52,724 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:52,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-04 21:46:52,724 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-04 21:46:52,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-04 21:46:52,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:46:52,726 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 7 states. [2019-08-04 21:46:52,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:52,782 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-04 21:46:52,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-04 21:46:52,783 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-08-04 21:46:52,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:52,784 INFO L225 Difference]: With dead ends: 8 [2019-08-04 21:46:52,784 INFO L226 Difference]: Without dead ends: 8 [2019-08-04 21:46:52,785 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:46:52,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-04 21:46:52,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-04 21:46:52,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-04 21:46:52,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-04 21:46:52,788 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-04 21:46:52,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:52,790 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-04 21:46:52,790 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-04 21:46:52,790 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-04 21:46:52,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-04 21:46:52,791 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:52,791 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1] [2019-08-04 21:46:52,791 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:46:52,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:52,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144161, now seen corresponding path program 5 times [2019-08-04 21:46:52,792 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:52,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:52,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-04 21:46:52,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:53,106 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-04 21:46:53,106 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:53,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-04 21:46:53,107 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-04 21:46:53,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-04 21:46:53,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:46:53,109 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 8 states. [2019-08-04 21:46:53,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:53,230 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-04 21:46:53,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-04 21:46:53,230 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-08-04 21:46:53,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:53,231 INFO L225 Difference]: With dead ends: 9 [2019-08-04 21:46:53,231 INFO L226 Difference]: Without dead ends: 9 [2019-08-04 21:46:53,231 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:46:53,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-04 21:46:53,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-04 21:46:53,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-04 21:46:53,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-04 21:46:53,234 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-04 21:46:53,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:53,234 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-04 21:46:53,234 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-04 21:46:53,234 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-04 21:46:53,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-04 21:46:53,235 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:53,235 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1] [2019-08-04 21:46:53,235 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:46:53,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:53,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894087, now seen corresponding path program 6 times [2019-08-04 21:46:53,237 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:53,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:53,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-04 21:46:53,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:53,694 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-04 21:46:53,695 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:53,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-04 21:46:53,695 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-04 21:46:53,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-04 21:46:53,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:46:53,697 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 9 states. [2019-08-04 21:46:53,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:53,988 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-04 21:46:53,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-04 21:46:53,989 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-08-04 21:46:53,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:53,989 INFO L225 Difference]: With dead ends: 10 [2019-08-04 21:46:53,989 INFO L226 Difference]: Without dead ends: 10 [2019-08-04 21:46:53,990 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:46:53,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-04 21:46:53,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-04 21:46:53,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-04 21:46:53,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-04 21:46:53,992 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-08-04 21:46:53,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:53,993 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-04 21:46:53,993 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-04 21:46:53,993 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-04 21:46:53,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-04 21:46:53,993 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:53,994 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1] [2019-08-04 21:46:53,994 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:46:53,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:53,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141793, now seen corresponding path program 7 times [2019-08-04 21:46:53,995 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:54,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:54,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-04 21:46:54,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:54,372 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-04 21:46:54,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:54,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-04 21:46:54,373 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-04 21:46:54,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-04 21:46:54,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:46:54,374 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 10 states. [2019-08-04 21:46:54,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:54,500 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-04 21:46:54,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-04 21:46:54,501 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-08-04 21:46:54,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:54,502 INFO L225 Difference]: With dead ends: 11 [2019-08-04 21:46:54,502 INFO L226 Difference]: Without dead ends: 11 [2019-08-04 21:46:54,503 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:46:54,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-04 21:46:54,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-04 21:46:54,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-04 21:46:54,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-04 21:46:54,505 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-08-04 21:46:54,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:54,506 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-04 21:46:54,506 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-04 21:46:54,506 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-04 21:46:54,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-04 21:46:54,506 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:54,507 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1] [2019-08-04 21:46:54,507 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:46:54,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:54,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820679, now seen corresponding path program 8 times [2019-08-04 21:46:54,508 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:54,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:54,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-04 21:46:54,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:54,973 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-04 21:46:54,974 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:54,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-04 21:46:54,974 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-04 21:46:54,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-04 21:46:54,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-08-04 21:46:54,978 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 11 states. [2019-08-04 21:46:55,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:55,102 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-04 21:46:55,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-04 21:46:55,103 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 [2019-08-04 21:46:55,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:55,104 INFO L225 Difference]: With dead ends: 12 [2019-08-04 21:46:55,104 INFO L226 Difference]: Without dead ends: 12 [2019-08-04 21:46:55,105 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-08-04 21:46:55,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-04 21:46:55,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-04 21:46:55,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-04 21:46:55,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-04 21:46:55,107 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-08-04 21:46:55,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:55,108 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-04 21:46:55,108 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-04 21:46:55,108 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-04 21:46:55,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-04 21:46:55,109 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:55,109 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1] [2019-08-04 21:46:55,109 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:46:55,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:55,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166559, now seen corresponding path program 9 times [2019-08-04 21:46:55,110 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:55,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:55,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-04 21:46:55,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:55,845 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-04 21:46:55,846 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:55,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-04 21:46:55,846 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-04 21:46:55,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-04 21:46:55,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-08-04 21:46:55,848 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 12 states. [2019-08-04 21:46:56,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:56,034 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-04 21:46:56,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-04 21:46:56,034 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2019-08-04 21:46:56,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:56,035 INFO L225 Difference]: With dead ends: 13 [2019-08-04 21:46:56,035 INFO L226 Difference]: Without dead ends: 13 [2019-08-04 21:46:56,036 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-08-04 21:46:56,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-04 21:46:56,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-04 21:46:56,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-04 21:46:56,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-04 21:46:56,039 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-08-04 21:46:56,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:56,040 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-04 21:46:56,040 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-04 21:46:56,040 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-04 21:46:56,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-04 21:46:56,040 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:56,041 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1] [2019-08-04 21:46:56,041 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:46:56,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:56,041 INFO L82 PathProgramCache]: Analyzing trace with hash -562523129, now seen corresponding path program 10 times [2019-08-04 21:46:56,042 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:56,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:56,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-04 21:46:56,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:56,356 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-04 21:46:56,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:56,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-04 21:46:56,357 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-04 21:46:56,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-04 21:46:56,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-08-04 21:46:56,358 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 13 states. [2019-08-04 21:46:56,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:56,509 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-04 21:46:56,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-04 21:46:56,509 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 12 [2019-08-04 21:46:56,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:56,510 INFO L225 Difference]: With dead ends: 14 [2019-08-04 21:46:56,510 INFO L226 Difference]: Without dead ends: 14 [2019-08-04 21:46:56,511 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-08-04 21:46:56,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-04 21:46:56,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-04 21:46:56,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-04 21:46:56,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-04 21:46:56,514 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-08-04 21:46:56,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:56,514 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-04 21:46:56,514 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-04 21:46:56,514 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-04 21:46:56,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-04 21:46:56,515 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:56,515 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1] [2019-08-04 21:46:56,515 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:46:56,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:56,515 INFO L82 PathProgramCache]: Analyzing trace with hash -258347871, now seen corresponding path program 11 times [2019-08-04 21:46:56,516 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:56,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:56,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-04 21:46:56,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:57,065 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-04 21:46:57,066 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:57,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-04 21:46:57,067 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-04 21:46:57,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-04 21:46:57,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-08-04 21:46:57,068 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 14 states. [2019-08-04 21:46:57,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:57,301 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-04 21:46:57,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-04 21:46:57,301 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2019-08-04 21:46:57,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:57,302 INFO L225 Difference]: With dead ends: 15 [2019-08-04 21:46:57,302 INFO L226 Difference]: Without dead ends: 15 [2019-08-04 21:46:57,303 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-08-04 21:46:57,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-04 21:46:57,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-04 21:46:57,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-04 21:46:57,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-04 21:46:57,306 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-08-04 21:46:57,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:57,306 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-04 21:46:57,306 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-04 21:46:57,306 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-04 21:46:57,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-04 21:46:57,307 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:57,307 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1] [2019-08-04 21:46:57,307 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:46:57,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:57,308 INFO L82 PathProgramCache]: Analyzing trace with hash 581150535, now seen corresponding path program 12 times [2019-08-04 21:46:57,308 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:57,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:57,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-04 21:46:57,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:57,888 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-04 21:46:57,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:57,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-04 21:46:57,889 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-04 21:46:57,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-04 21:46:57,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-08-04 21:46:57,890 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 15 states. [2019-08-04 21:46:58,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:58,100 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-04 21:46:58,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-04 21:46:58,101 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 14 [2019-08-04 21:46:58,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:58,101 INFO L225 Difference]: With dead ends: 16 [2019-08-04 21:46:58,102 INFO L226 Difference]: Without dead ends: 16 [2019-08-04 21:46:58,102 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-08-04 21:46:58,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-04 21:46:58,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-04 21:46:58,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-04 21:46:58,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-04 21:46:58,106 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-08-04 21:46:58,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:58,106 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-04 21:46:58,106 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-04 21:46:58,107 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-04 21:46:58,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-04 21:46:58,107 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:58,107 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1] [2019-08-04 21:46:58,108 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:46:58,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:58,108 INFO L82 PathProgramCache]: Analyzing trace with hash 835797345, now seen corresponding path program 13 times [2019-08-04 21:46:58,109 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:58,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:58,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-04 21:46:58,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:58,913 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-04 21:46:58,914 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:58,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-04 21:46:58,915 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-04 21:46:58,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-04 21:46:58,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-08-04 21:46:58,915 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 16 states. [2019-08-04 21:46:59,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:59,663 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-04 21:46:59,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-04 21:46:59,664 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 15 [2019-08-04 21:46:59,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:59,664 INFO L225 Difference]: With dead ends: 17 [2019-08-04 21:46:59,665 INFO L226 Difference]: Without dead ends: 17 [2019-08-04 21:46:59,665 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-08-04 21:46:59,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-04 21:46:59,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-04 21:46:59,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-04 21:46:59,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-04 21:46:59,669 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-08-04 21:46:59,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:59,669 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-04 21:46:59,669 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-04 21:46:59,669 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-04 21:46:59,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-04 21:46:59,670 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:59,670 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1] [2019-08-04 21:46:59,670 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:46:59,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:59,670 INFO L82 PathProgramCache]: Analyzing trace with hash 139913863, now seen corresponding path program 14 times [2019-08-04 21:46:59,671 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:59,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:59,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-04 21:46:59,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:00,256 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-04 21:47:00,257 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:00,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-04 21:47:00,257 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-04 21:47:00,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-04 21:47:00,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-08-04 21:47:00,259 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 17 states. [2019-08-04 21:47:00,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:00,573 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-04 21:47:00,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-04 21:47:00,574 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2019-08-04 21:47:00,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:00,575 INFO L225 Difference]: With dead ends: 18 [2019-08-04 21:47:00,575 INFO L226 Difference]: Without dead ends: 18 [2019-08-04 21:47:00,576 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-08-04 21:47:00,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-04 21:47:00,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-04 21:47:00,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-04 21:47:00,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-08-04 21:47:00,579 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-08-04 21:47:00,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:00,579 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-08-04 21:47:00,579 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-04 21:47:00,580 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-08-04 21:47:00,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-04 21:47:00,580 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:00,580 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1] [2019-08-04 21:47:00,581 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:47:00,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:00,581 INFO L82 PathProgramCache]: Analyzing trace with hash 42362401, now seen corresponding path program 15 times [2019-08-04 21:47:00,582 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:00,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:00,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-04 21:47:00,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:01,209 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-04 21:47:01,209 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:01,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-04 21:47:01,209 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-04 21:47:01,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-04 21:47:01,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-08-04 21:47:01,210 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 18 states. [2019-08-04 21:47:01,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:01,515 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-04 21:47:01,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-04 21:47:01,516 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 17 [2019-08-04 21:47:01,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:01,517 INFO L225 Difference]: With dead ends: 19 [2019-08-04 21:47:01,517 INFO L226 Difference]: Without dead ends: 19 [2019-08-04 21:47:01,518 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-08-04 21:47:01,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-04 21:47:01,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-04 21:47:01,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-04 21:47:01,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-04 21:47:01,521 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-08-04 21:47:01,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:01,521 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-04 21:47:01,521 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-04 21:47:01,521 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-04 21:47:01,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-04 21:47:01,522 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:01,522 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1] [2019-08-04 21:47:01,522 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:47:01,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:01,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1313234375, now seen corresponding path program 16 times [2019-08-04 21:47:01,523 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:01,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:01,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-04 21:47:01,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:02,016 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-04 21:47:02,016 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:02,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-04 21:47:02,017 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-04 21:47:02,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-04 21:47:02,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-08-04 21:47:02,018 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 19 states. [2019-08-04 21:47:02,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:02,387 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-04 21:47:02,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-04 21:47:02,387 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 18 [2019-08-04 21:47:02,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:02,388 INFO L225 Difference]: With dead ends: 20 [2019-08-04 21:47:02,388 INFO L226 Difference]: Without dead ends: 20 [2019-08-04 21:47:02,389 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-08-04 21:47:02,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-04 21:47:02,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-04 21:47:02,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-04 21:47:02,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-04 21:47:02,391 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-08-04 21:47:02,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:02,391 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-04 21:47:02,392 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-04 21:47:02,392 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-04 21:47:02,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-04 21:47:02,392 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:02,392 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1] [2019-08-04 21:47:02,393 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:47:02,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:02,393 INFO L82 PathProgramCache]: Analyzing trace with hash 2055559905, now seen corresponding path program 17 times [2019-08-04 21:47:02,394 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:02,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:02,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-04 21:47:02,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:03,076 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-04 21:47:03,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:03,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-04 21:47:03,077 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-04 21:47:03,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-04 21:47:03,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2019-08-04 21:47:03,077 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 20 states. [2019-08-04 21:47:03,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:03,563 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-08-04 21:47:03,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-04 21:47:03,564 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2019-08-04 21:47:03,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:03,565 INFO L225 Difference]: With dead ends: 21 [2019-08-04 21:47:03,565 INFO L226 Difference]: Without dead ends: 21 [2019-08-04 21:47:03,566 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2019-08-04 21:47:03,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-04 21:47:03,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-04 21:47:03,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-04 21:47:03,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-04 21:47:03,569 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-08-04 21:47:03,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:03,569 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-04 21:47:03,569 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-04 21:47:03,570 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-04 21:47:03,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-04 21:47:03,570 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:03,570 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1] [2019-08-04 21:47:03,570 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:47:03,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:03,571 INFO L82 PathProgramCache]: Analyzing trace with hash -702152441, now seen corresponding path program 18 times [2019-08-04 21:47:03,572 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:03,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:03,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-04 21:47:03,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:04,218 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-04 21:47:04,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:04,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-04 21:47:04,219 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-04 21:47:04,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-04 21:47:04,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2019-08-04 21:47:04,220 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 21 states. [2019-08-04 21:47:04,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:04,699 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-04 21:47:04,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-04 21:47:04,700 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 20 [2019-08-04 21:47:04,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:04,701 INFO L225 Difference]: With dead ends: 22 [2019-08-04 21:47:04,701 INFO L226 Difference]: Without dead ends: 22 [2019-08-04 21:47:04,702 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2019-08-04 21:47:04,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-04 21:47:04,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-04 21:47:04,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-04 21:47:04,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-08-04 21:47:04,706 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-08-04 21:47:04,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:04,706 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-08-04 21:47:04,706 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-04 21:47:04,706 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-08-04 21:47:04,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-04 21:47:04,707 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:04,707 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1] [2019-08-04 21:47:04,707 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:47:04,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:04,708 INFO L82 PathProgramCache]: Analyzing trace with hash -291889247, now seen corresponding path program 19 times [2019-08-04 21:47:04,708 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:04,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:04,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-04 21:47:04,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:05,435 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-04 21:47:05,436 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:05,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-04 21:47:05,437 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-04 21:47:05,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-04 21:47:05,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2019-08-04 21:47:05,437 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 22 states. [2019-08-04 21:47:05,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:05,972 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-08-04 21:47:05,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-04 21:47:05,973 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 21 [2019-08-04 21:47:05,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:05,973 INFO L225 Difference]: With dead ends: 23 [2019-08-04 21:47:05,973 INFO L226 Difference]: Without dead ends: 23 [2019-08-04 21:47:05,974 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2019-08-04 21:47:05,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-04 21:47:05,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-04 21:47:05,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-04 21:47:05,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-08-04 21:47:05,977 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-08-04 21:47:05,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:05,977 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-08-04 21:47:05,977 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-04 21:47:05,978 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-08-04 21:47:05,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-04 21:47:05,978 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:05,978 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1] [2019-08-04 21:47:05,979 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:47:05,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:05,979 INFO L82 PathProgramCache]: Analyzing trace with hash -458632121, now seen corresponding path program 20 times [2019-08-04 21:47:05,980 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:06,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:06,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-04 21:47:06,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:06,690 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-04 21:47:06,691 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:06,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-04 21:47:06,691 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-04 21:47:06,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-04 21:47:06,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2019-08-04 21:47:06,692 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 23 states. [2019-08-04 21:47:07,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:07,252 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-08-04 21:47:07,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-04 21:47:07,252 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 22 [2019-08-04 21:47:07,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:07,253 INFO L225 Difference]: With dead ends: 24 [2019-08-04 21:47:07,253 INFO L226 Difference]: Without dead ends: 24 [2019-08-04 21:47:07,254 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2019-08-04 21:47:07,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-04 21:47:07,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-04 21:47:07,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-04 21:47:07,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-08-04 21:47:07,257 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-08-04 21:47:07,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:07,257 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-08-04 21:47:07,257 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-04 21:47:07,258 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-08-04 21:47:07,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-04 21:47:07,258 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:07,258 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1] [2019-08-04 21:47:07,259 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:47:07,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:07,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1332693919, now seen corresponding path program 21 times [2019-08-04 21:47:07,260 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:07,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:07,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-04 21:47:07,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:08,145 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-04 21:47:08,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:08,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-04 21:47:08,146 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-04 21:47:08,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-04 21:47:08,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2019-08-04 21:47:08,147 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 24 states. [2019-08-04 21:47:08,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:08,949 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-08-04 21:47:08,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-04 21:47:08,952 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 23 [2019-08-04 21:47:08,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:08,953 INFO L225 Difference]: With dead ends: 25 [2019-08-04 21:47:08,953 INFO L226 Difference]: Without dead ends: 25 [2019-08-04 21:47:08,954 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2019-08-04 21:47:08,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-04 21:47:08,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-04 21:47:08,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-04 21:47:08,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-08-04 21:47:08,956 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-08-04 21:47:08,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:08,957 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-08-04 21:47:08,957 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-04 21:47:08,957 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-08-04 21:47:08,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-04 21:47:08,958 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:08,958 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1] [2019-08-04 21:47:08,958 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:47:08,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:08,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1636161415, now seen corresponding path program 22 times [2019-08-04 21:47:08,959 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:09,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:09,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-04 21:47:09,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:09,884 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-04 21:47:09,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:09,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-04 21:47:09,885 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-04 21:47:09,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-04 21:47:09,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2019-08-04 21:47:09,886 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 25 states. [2019-08-04 21:47:10,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:10,725 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-08-04 21:47:10,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-04 21:47:10,726 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 24 [2019-08-04 21:47:10,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:10,727 INFO L225 Difference]: With dead ends: 26 [2019-08-04 21:47:10,727 INFO L226 Difference]: Without dead ends: 26 [2019-08-04 21:47:10,728 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2019-08-04 21:47:10,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-04 21:47:10,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-08-04 21:47:10,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-04 21:47:10,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-08-04 21:47:10,730 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-08-04 21:47:10,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:10,731 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-08-04 21:47:10,731 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-04 21:47:10,731 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-08-04 21:47:10,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-04 21:47:10,731 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:10,731 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1] [2019-08-04 21:47:10,732 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:47:10,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:10,732 INFO L82 PathProgramCache]: Analyzing trace with hash -818603743, now seen corresponding path program 23 times [2019-08-04 21:47:10,733 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:10,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:10,840 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-04 21:47:10,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:11,658 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-04 21:47:11,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:11,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-04 21:47:11,659 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-04 21:47:11,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-04 21:47:11,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2019-08-04 21:47:11,660 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 26 states. [2019-08-04 21:47:12,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:12,783 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-08-04 21:47:12,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-04 21:47:12,784 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 25 [2019-08-04 21:47:12,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:12,785 INFO L225 Difference]: With dead ends: 27 [2019-08-04 21:47:12,785 INFO L226 Difference]: Without dead ends: 27 [2019-08-04 21:47:12,786 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2019-08-04 21:47:12,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-04 21:47:12,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-08-04 21:47:12,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-04 21:47:12,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-08-04 21:47:12,788 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-08-04 21:47:12,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:12,789 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-08-04 21:47:12,789 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-04 21:47:12,789 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-08-04 21:47:12,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-04 21:47:12,789 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:12,789 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1] [2019-08-04 21:47:12,790 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:47:12,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:12,790 INFO L82 PathProgramCache]: Analyzing trace with hash 393087687, now seen corresponding path program 24 times [2019-08-04 21:47:12,791 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:12,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:12,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-04 21:47:12,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:14,135 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-04 21:47:14,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:14,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-04 21:47:14,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-04 21:47:14,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-04 21:47:14,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2019-08-04 21:47:14,137 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 27 states. [2019-08-04 21:47:15,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:15,133 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-08-04 21:47:15,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-04 21:47:15,138 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 26 [2019-08-04 21:47:15,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:15,139 INFO L225 Difference]: With dead ends: 28 [2019-08-04 21:47:15,139 INFO L226 Difference]: Without dead ends: 28 [2019-08-04 21:47:15,139 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2019-08-04 21:47:15,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-04 21:47:15,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-04 21:47:15,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-04 21:47:15,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-08-04 21:47:15,142 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-08-04 21:47:15,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:15,142 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-08-04 21:47:15,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-04 21:47:15,142 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-08-04 21:47:15,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-04 21:47:15,143 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:15,143 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1] [2019-08-04 21:47:15,143 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:47:15,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:15,144 INFO L82 PathProgramCache]: Analyzing trace with hash -699183647, now seen corresponding path program 25 times [2019-08-04 21:47:15,145 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:15,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:15,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-04 21:47:15,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:16,277 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-04 21:47:16,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:16,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-04 21:47:16,278 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-04 21:47:16,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-04 21:47:16,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2019-08-04 21:47:16,279 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 28 states. [2019-08-04 21:47:17,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:17,195 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-08-04 21:47:17,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-04 21:47:17,195 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 27 [2019-08-04 21:47:17,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:17,196 INFO L225 Difference]: With dead ends: 29 [2019-08-04 21:47:17,196 INFO L226 Difference]: Without dead ends: 29 [2019-08-04 21:47:17,197 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2019-08-04 21:47:17,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-04 21:47:17,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-04 21:47:17,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-04 21:47:17,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-08-04 21:47:17,201 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-08-04 21:47:17,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:17,201 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-08-04 21:47:17,201 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-04 21:47:17,201 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-08-04 21:47:17,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-04 21:47:17,202 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:17,202 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1] [2019-08-04 21:47:17,202 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:47:17,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:17,202 INFO L82 PathProgramCache]: Analyzing trace with hash -199856633, now seen corresponding path program 26 times [2019-08-04 21:47:17,203 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:17,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:17,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-04 21:47:17,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:19,612 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-04 21:47:19,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:19,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-04 21:47:19,612 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-04 21:47:19,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-04 21:47:19,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2019-08-04 21:47:19,613 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 29 states. [2019-08-04 21:47:20,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:20,621 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-08-04 21:47:20,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-04 21:47:20,621 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 28 [2019-08-04 21:47:20,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:20,622 INFO L225 Difference]: With dead ends: 30 [2019-08-04 21:47:20,622 INFO L226 Difference]: Without dead ends: 30 [2019-08-04 21:47:20,623 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2019-08-04 21:47:20,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-04 21:47:20,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-08-04 21:47:20,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-04 21:47:20,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-08-04 21:47:20,626 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-08-04 21:47:20,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:20,626 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-08-04 21:47:20,626 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-04 21:47:20,626 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-08-04 21:47:20,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-04 21:47:20,627 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:20,627 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1] [2019-08-04 21:47:20,627 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:47:20,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:20,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1900588383, now seen corresponding path program 27 times [2019-08-04 21:47:20,628 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:20,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:20,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-04 21:47:20,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:22,839 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-04 21:47:22,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:22,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-04 21:47:22,840 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-04 21:47:22,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-04 21:47:22,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2019-08-04 21:47:22,841 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 30 states. [2019-08-04 21:47:23,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:23,977 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-08-04 21:47:23,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-04 21:47:23,977 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 29 [2019-08-04 21:47:23,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:23,978 INFO L225 Difference]: With dead ends: 31 [2019-08-04 21:47:23,978 INFO L226 Difference]: Without dead ends: 31 [2019-08-04 21:47:23,978 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2019-08-04 21:47:23,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-04 21:47:23,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-04 21:47:23,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-04 21:47:23,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-08-04 21:47:23,981 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-08-04 21:47:23,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:23,982 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-08-04 21:47:23,982 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-04 21:47:23,982 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-08-04 21:47:23,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-04 21:47:23,983 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:23,983 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1] [2019-08-04 21:47:23,983 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:47:23,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:23,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1211302215, now seen corresponding path program 28 times [2019-08-04 21:47:23,984 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:24,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:24,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-04 21:47:24,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:25,578 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-04 21:47:25,578 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:25,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-04 21:47:25,579 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-04 21:47:25,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-04 21:47:25,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2019-08-04 21:47:25,579 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 31 states. [2019-08-04 21:47:26,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:26,782 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-08-04 21:47:26,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-04 21:47:26,782 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 30 [2019-08-04 21:47:26,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:26,783 INFO L225 Difference]: With dead ends: 32 [2019-08-04 21:47:26,783 INFO L226 Difference]: Without dead ends: 32 [2019-08-04 21:47:26,784 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2019-08-04 21:47:26,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-04 21:47:26,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-08-04 21:47:26,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-04 21:47:26,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-08-04 21:47:26,788 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-08-04 21:47:26,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:26,788 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-08-04 21:47:26,788 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-04 21:47:26,788 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-08-04 21:47:26,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-04 21:47:26,789 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:26,789 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1] [2019-08-04 21:47:26,789 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:47:26,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:26,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1104337055, now seen corresponding path program 29 times [2019-08-04 21:47:26,790 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:26,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:27,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-04 21:47:27,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:28,382 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-04 21:47:28,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:28,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-04 21:47:28,383 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-04 21:47:28,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-04 21:47:28,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2019-08-04 21:47:28,384 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 32 states. [2019-08-04 21:47:29,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:29,720 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-08-04 21:47:29,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-04 21:47:29,721 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 31 [2019-08-04 21:47:29,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:29,721 INFO L225 Difference]: With dead ends: 33 [2019-08-04 21:47:29,721 INFO L226 Difference]: Without dead ends: 33 [2019-08-04 21:47:29,723 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2019-08-04 21:47:29,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-04 21:47:29,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-08-04 21:47:29,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-04 21:47:29,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-08-04 21:47:29,725 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-08-04 21:47:29,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:29,726 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-08-04 21:47:29,726 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-04 21:47:29,726 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-08-04 21:47:29,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-04 21:47:29,726 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:29,726 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1] [2019-08-04 21:47:29,727 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:47:29,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:29,727 INFO L82 PathProgramCache]: Analyzing trace with hash 125289607, now seen corresponding path program 30 times [2019-08-04 21:47:29,728 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:29,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:29,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-04 21:47:29,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:31,394 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-04 21:47:31,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:31,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-04 21:47:31,395 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-04 21:47:31,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-04 21:47:31,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2019-08-04 21:47:31,395 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 33 states. [2019-08-04 21:47:32,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:32,812 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-08-04 21:47:32,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-04 21:47:32,813 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 32 [2019-08-04 21:47:32,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:32,814 INFO L225 Difference]: With dead ends: 34 [2019-08-04 21:47:32,814 INFO L226 Difference]: Without dead ends: 34 [2019-08-04 21:47:32,815 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2019-08-04 21:47:32,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-04 21:47:32,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-08-04 21:47:32,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-04 21:47:32,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-08-04 21:47:32,818 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-08-04 21:47:32,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:32,818 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-08-04 21:47:32,818 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-04 21:47:32,818 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-08-04 21:47:32,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-04 21:47:32,819 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:32,819 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1] [2019-08-04 21:47:32,819 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:47:32,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:32,819 INFO L82 PathProgramCache]: Analyzing trace with hash -410989535, now seen corresponding path program 31 times [2019-08-04 21:47:32,820 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:32,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:33,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-04 21:47:33,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:35,024 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-04 21:47:35,025 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:35,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-04 21:47:35,025 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-04 21:47:35,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-04 21:47:35,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1026, Unknown=0, NotChecked=0, Total=1122 [2019-08-04 21:47:35,026 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 34 states. [2019-08-04 21:47:36,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:36,541 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-08-04 21:47:36,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-04 21:47:36,542 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 33 [2019-08-04 21:47:36,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:36,543 INFO L225 Difference]: With dead ends: 35 [2019-08-04 21:47:36,543 INFO L226 Difference]: Without dead ends: 35 [2019-08-04 21:47:36,544 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=96, Invalid=1026, Unknown=0, NotChecked=0, Total=1122 [2019-08-04 21:47:36,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-04 21:47:36,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-04 21:47:36,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-04 21:47:36,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-08-04 21:47:36,547 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-08-04 21:47:36,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:36,547 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-08-04 21:47:36,547 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-04 21:47:36,547 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-08-04 21:47:36,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-04 21:47:36,548 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:36,548 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1] [2019-08-04 21:47:36,548 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:47:36,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:36,548 INFO L82 PathProgramCache]: Analyzing trace with hash 144226247, now seen corresponding path program 32 times [2019-08-04 21:47:36,549 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:36,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:36,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-04 21:47:36,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:38,491 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-04 21:47:38,492 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:38,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-04 21:47:38,492 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-04 21:47:38,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-04 21:47:38,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2019-08-04 21:47:38,493 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 35 states. [2019-08-04 21:47:40,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:40,127 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-08-04 21:47:40,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-04 21:47:40,127 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 34 [2019-08-04 21:47:40,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:40,128 INFO L225 Difference]: With dead ends: 36 [2019-08-04 21:47:40,128 INFO L226 Difference]: Without dead ends: 36 [2019-08-04 21:47:40,129 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2019-08-04 21:47:40,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-04 21:47:40,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-04 21:47:40,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-04 21:47:40,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-08-04 21:47:40,132 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-08-04 21:47:40,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:40,132 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-08-04 21:47:40,132 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-04 21:47:40,132 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-08-04 21:47:40,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-04 21:47:40,133 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:40,133 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1] [2019-08-04 21:47:40,133 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:47:40,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:40,134 INFO L82 PathProgramCache]: Analyzing trace with hash 176046305, now seen corresponding path program 33 times [2019-08-04 21:47:40,134 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:40,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:40,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-04 21:47:40,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:42,650 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-04 21:47:42,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:42,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-04 21:47:42,650 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-04 21:47:42,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-04 21:47:42,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1158, Unknown=0, NotChecked=0, Total=1260 [2019-08-04 21:47:42,651 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 36 states. [2019-08-04 21:47:44,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:44,403 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-08-04 21:47:44,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-04 21:47:44,403 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 35 [2019-08-04 21:47:44,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:44,404 INFO L225 Difference]: With dead ends: 37 [2019-08-04 21:47:44,404 INFO L226 Difference]: Without dead ends: 37 [2019-08-04 21:47:44,405 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=102, Invalid=1158, Unknown=0, NotChecked=0, Total=1260 [2019-08-04 21:47:44,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-04 21:47:44,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-04 21:47:44,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-04 21:47:44,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-08-04 21:47:44,407 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-08-04 21:47:44,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:44,408 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-08-04 21:47:44,408 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-04 21:47:44,408 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-08-04 21:47:44,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-04 21:47:44,408 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:44,408 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1] [2019-08-04 21:47:44,408 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:47:44,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:44,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1162468103, now seen corresponding path program 34 times [2019-08-04 21:47:44,409 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:44,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:44,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 71 conjunts are in the unsatisfiable core [2019-08-04 21:47:44,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:46,814 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-04 21:47:46,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:46,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-04 21:47:46,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-04 21:47:46,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-04 21:47:46,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1227, Unknown=0, NotChecked=0, Total=1332 [2019-08-04 21:47:46,816 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 37 states. [2019-08-04 21:47:48,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:48,715 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-08-04 21:47:48,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-04 21:47:48,715 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 36 [2019-08-04 21:47:48,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:48,716 INFO L225 Difference]: With dead ends: 38 [2019-08-04 21:47:48,716 INFO L226 Difference]: Without dead ends: 38 [2019-08-04 21:47:48,717 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=105, Invalid=1227, Unknown=0, NotChecked=0, Total=1332 [2019-08-04 21:47:48,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-04 21:47:48,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-08-04 21:47:48,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-04 21:47:48,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-08-04 21:47:48,720 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-08-04 21:47:48,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:48,720 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-08-04 21:47:48,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-04 21:47:48,720 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-08-04 21:47:48,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-04 21:47:48,720 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:48,720 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1] [2019-08-04 21:47:48,721 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:47:48,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:48,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1676772769, now seen corresponding path program 35 times [2019-08-04 21:47:48,721 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:48,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:49,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 73 conjunts are in the unsatisfiable core [2019-08-04 21:47:49,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:51,731 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-04 21:47:51,732 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:51,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-04 21:47:51,732 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-04 21:47:51,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-04 21:47:51,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1298, Unknown=0, NotChecked=0, Total=1406 [2019-08-04 21:47:51,733 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 38 states. [2019-08-04 21:47:53,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:53,754 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-08-04 21:47:53,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-04 21:47:53,754 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 37 [2019-08-04 21:47:53,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:53,755 INFO L225 Difference]: With dead ends: 39 [2019-08-04 21:47:53,755 INFO L226 Difference]: Without dead ends: 39 [2019-08-04 21:47:53,756 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=108, Invalid=1298, Unknown=0, NotChecked=0, Total=1406 [2019-08-04 21:47:53,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-04 21:47:53,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-08-04 21:47:53,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-04 21:47:53,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-08-04 21:47:53,759 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-08-04 21:47:53,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:53,759 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-08-04 21:47:53,759 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-04 21:47:53,759 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-08-04 21:47:53,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-04 21:47:53,760 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:53,760 INFO L399 BasicCegarLoop]: trace histogram [36, 1, 1] [2019-08-04 21:47:53,760 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:47:53,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:53,761 INFO L82 PathProgramCache]: Analyzing trace with hash 440348231, now seen corresponding path program 36 times [2019-08-04 21:47:53,761 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:53,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:54,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-04 21:47:54,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:56,585 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-04 21:47:56,585 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:56,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-04 21:47:56,586 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-04 21:47:56,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-04 21:47:56,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1371, Unknown=0, NotChecked=0, Total=1482 [2019-08-04 21:47:56,587 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 39 states. [2019-08-04 21:47:58,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:58,765 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-08-04 21:47:58,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-04 21:47:58,766 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 38 [2019-08-04 21:47:58,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:58,766 INFO L225 Difference]: With dead ends: 40 [2019-08-04 21:47:58,767 INFO L226 Difference]: Without dead ends: 40 [2019-08-04 21:47:58,768 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=111, Invalid=1371, Unknown=0, NotChecked=0, Total=1482 [2019-08-04 21:47:58,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-04 21:47:58,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-08-04 21:47:58,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-04 21:47:58,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-08-04 21:47:58,770 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-08-04 21:47:58,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:58,770 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-08-04 21:47:58,771 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-04 21:47:58,771 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-08-04 21:47:58,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-04 21:47:58,771 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:58,771 INFO L399 BasicCegarLoop]: trace histogram [37, 1, 1] [2019-08-04 21:47:58,771 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:47:58,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:58,772 INFO L82 PathProgramCache]: Analyzing trace with hash 765893217, now seen corresponding path program 37 times [2019-08-04 21:47:58,772 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:58,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:59,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 77 conjunts are in the unsatisfiable core [2019-08-04 21:47:59,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:48:01,852 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-04 21:48:01,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:48:01,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-04 21:48:01,853 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-04 21:48:01,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-04 21:48:01,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1446, Unknown=0, NotChecked=0, Total=1560 [2019-08-04 21:48:01,854 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 40 states. [2019-08-04 21:48:04,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:48:04,240 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-08-04 21:48:04,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-04 21:48:04,240 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 39 [2019-08-04 21:48:04,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:48:04,241 INFO L225 Difference]: With dead ends: 41 [2019-08-04 21:48:04,241 INFO L226 Difference]: Without dead ends: 41 [2019-08-04 21:48:04,241 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=114, Invalid=1446, Unknown=0, NotChecked=0, Total=1560 [2019-08-04 21:48:04,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-04 21:48:04,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-08-04 21:48:04,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-04 21:48:04,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-08-04 21:48:04,243 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-08-04 21:48:04,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:48:04,243 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-08-04 21:48:04,243 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-04 21:48:04,243 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-08-04 21:48:04,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-04 21:48:04,243 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:48:04,244 INFO L399 BasicCegarLoop]: trace histogram [38, 1, 1] [2019-08-04 21:48:04,244 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:48:04,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:48:04,244 INFO L82 PathProgramCache]: Analyzing trace with hash -2027114105, now seen corresponding path program 38 times [2019-08-04 21:48:04,245 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:48:04,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:48:04,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 79 conjunts are in the unsatisfiable core [2019-08-04 21:48:04,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:48:07,424 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-04 21:48:07,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:48:07,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-04 21:48:07,425 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-04 21:48:07,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-04 21:48:07,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1523, Unknown=0, NotChecked=0, Total=1640 [2019-08-04 21:48:07,425 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 41 states. [2019-08-04 21:48:10,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:48:10,051 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-08-04 21:48:10,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-04 21:48:10,051 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 40 [2019-08-04 21:48:10,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:48:10,052 INFO L225 Difference]: With dead ends: 42 [2019-08-04 21:48:10,052 INFO L226 Difference]: Without dead ends: 42 [2019-08-04 21:48:10,053 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=117, Invalid=1523, Unknown=0, NotChecked=0, Total=1640 [2019-08-04 21:48:10,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-04 21:48:10,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-08-04 21:48:10,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-04 21:48:10,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-08-04 21:48:10,055 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-08-04 21:48:10,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:48:10,056 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-08-04 21:48:10,056 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-04 21:48:10,056 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-08-04 21:48:10,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-04 21:48:10,056 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:48:10,056 INFO L399 BasicCegarLoop]: trace histogram [39, 1, 1] [2019-08-04 21:48:10,057 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:48:10,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:48:10,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1583972129, now seen corresponding path program 39 times [2019-08-04 21:48:10,058 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:48:10,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:48:10,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 81 conjunts are in the unsatisfiable core [2019-08-04 21:48:10,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:48:13,284 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-04 21:48:13,285 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:48:13,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-04 21:48:13,285 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-04 21:48:13,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-04 21:48:13,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1602, Unknown=0, NotChecked=0, Total=1722 [2019-08-04 21:48:13,286 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 42 states. [2019-08-04 21:48:16,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:48:16,029 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-08-04 21:48:16,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-04 21:48:16,029 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 41 [2019-08-04 21:48:16,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:48:16,030 INFO L225 Difference]: With dead ends: 43 [2019-08-04 21:48:16,030 INFO L226 Difference]: Without dead ends: 43 [2019-08-04 21:48:16,031 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=120, Invalid=1602, Unknown=0, NotChecked=0, Total=1722 [2019-08-04 21:48:16,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-04 21:48:16,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-04 21:48:16,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-04 21:48:16,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-08-04 21:48:16,033 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-08-04 21:48:16,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:48:16,033 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-08-04 21:48:16,033 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-04 21:48:16,034 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-08-04 21:48:16,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-04 21:48:16,034 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:48:16,034 INFO L399 BasicCegarLoop]: trace histogram [40, 1, 1] [2019-08-04 21:48:16,034 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:48:16,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:48:16,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1858495687, now seen corresponding path program 40 times [2019-08-04 21:48:16,035 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:48:16,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:48:16,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 83 conjunts are in the unsatisfiable core [2019-08-04 21:48:16,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:48:19,538 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-04 21:48:19,539 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:48:19,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-04 21:48:19,539 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-04 21:48:19,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-04 21:48:19,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1683, Unknown=0, NotChecked=0, Total=1806 [2019-08-04 21:48:19,540 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 43 states. [2019-08-04 21:48:22,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:48:22,542 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-08-04 21:48:22,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-04 21:48:22,543 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 42 [2019-08-04 21:48:22,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:48:22,543 INFO L225 Difference]: With dead ends: 44 [2019-08-04 21:48:22,544 INFO L226 Difference]: Without dead ends: 44 [2019-08-04 21:48:22,545 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=123, Invalid=1683, Unknown=0, NotChecked=0, Total=1806 [2019-08-04 21:48:22,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-04 21:48:22,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-08-04 21:48:22,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-04 21:48:22,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-08-04 21:48:22,548 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-08-04 21:48:22,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:48:22,548 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-08-04 21:48:22,548 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-04 21:48:22,548 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-08-04 21:48:22,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-04 21:48:22,549 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:48:22,549 INFO L399 BasicCegarLoop]: trace histogram [41, 1, 1] [2019-08-04 21:48:22,549 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:48:22,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:48:22,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1778791393, now seen corresponding path program 41 times [2019-08-04 21:48:22,550 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:48:22,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:48:23,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 85 conjunts are in the unsatisfiable core [2019-08-04 21:48:23,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:48:26,406 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-04 21:48:26,406 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:48:26,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-04 21:48:26,406 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-04 21:48:26,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-04 21:48:26,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1766, Unknown=0, NotChecked=0, Total=1892 [2019-08-04 21:48:26,407 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 44 states. [2019-08-04 21:48:29,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:48:29,524 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-08-04 21:48:29,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-04 21:48:29,524 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 43 [2019-08-04 21:48:29,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:48:29,525 INFO L225 Difference]: With dead ends: 45 [2019-08-04 21:48:29,525 INFO L226 Difference]: Without dead ends: 45 [2019-08-04 21:48:29,526 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=126, Invalid=1766, Unknown=0, NotChecked=0, Total=1892 [2019-08-04 21:48:29,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-04 21:48:29,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-04 21:48:29,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-04 21:48:29,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-08-04 21:48:29,527 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-08-04 21:48:29,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:48:29,527 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-08-04 21:48:29,527 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-04 21:48:29,528 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-08-04 21:48:29,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-04 21:48:29,528 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:48:29,528 INFO L399 BasicCegarLoop]: trace histogram [42, 1, 1] [2019-08-04 21:48:29,528 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:48:29,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:48:29,528 INFO L82 PathProgramCache]: Analyzing trace with hash -692041721, now seen corresponding path program 42 times [2019-08-04 21:48:29,529 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:48:29,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:48:30,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-04 21:48:30,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:48:33,720 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-04 21:48:33,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:48:33,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-04 21:48:33,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-04 21:48:33,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-04 21:48:33,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1851, Unknown=0, NotChecked=0, Total=1980 [2019-08-04 21:48:33,723 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 45 states. [2019-08-04 21:48:37,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:48:37,140 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-08-04 21:48:37,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-04 21:48:37,140 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 44 [2019-08-04 21:48:37,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:48:37,141 INFO L225 Difference]: With dead ends: 46 [2019-08-04 21:48:37,141 INFO L226 Difference]: Without dead ends: 46 [2019-08-04 21:48:37,142 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=129, Invalid=1851, Unknown=0, NotChecked=0, Total=1980 [2019-08-04 21:48:37,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-04 21:48:37,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-08-04 21:48:37,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-04 21:48:37,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-08-04 21:48:37,144 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-08-04 21:48:37,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:48:37,144 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-08-04 21:48:37,144 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-04 21:48:37,144 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-08-04 21:48:37,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-04 21:48:37,145 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:48:37,145 INFO L399 BasicCegarLoop]: trace histogram [43, 1, 1] [2019-08-04 21:48:37,145 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:48:37,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:48:37,145 INFO L82 PathProgramCache]: Analyzing trace with hash 21543073, now seen corresponding path program 43 times [2019-08-04 21:48:37,146 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:48:37,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:48:37,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-04 21:48:37,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:48:41,410 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-04 21:48:41,410 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:48:41,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-04 21:48:41,411 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-04 21:48:41,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-04 21:48:41,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1938, Unknown=0, NotChecked=0, Total=2070 [2019-08-04 21:48:41,412 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 46 states. [2019-08-04 21:48:44,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:48:44,981 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-08-04 21:48:44,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-04 21:48:44,981 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 45 [2019-08-04 21:48:44,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:48:44,982 INFO L225 Difference]: With dead ends: 47 [2019-08-04 21:48:44,982 INFO L226 Difference]: Without dead ends: 47 [2019-08-04 21:48:44,983 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=132, Invalid=1938, Unknown=0, NotChecked=0, Total=2070 [2019-08-04 21:48:44,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-04 21:48:44,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-08-04 21:48:44,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-04 21:48:44,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-08-04 21:48:44,985 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-08-04 21:48:44,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:48:44,985 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-08-04 21:48:44,985 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-04 21:48:44,985 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-08-04 21:48:44,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-04 21:48:44,986 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:48:44,986 INFO L399 BasicCegarLoop]: trace histogram [44, 1, 1] [2019-08-04 21:48:44,986 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:48:44,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:48:44,986 INFO L82 PathProgramCache]: Analyzing trace with hash 667835207, now seen corresponding path program 44 times [2019-08-04 21:48:44,987 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:48:45,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:48:45,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 91 conjunts are in the unsatisfiable core [2019-08-04 21:48:45,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:48:49,761 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-04 21:48:49,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:48:49,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-04 21:48:49,762 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-04 21:48:49,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-04 21:48:49,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=2027, Unknown=0, NotChecked=0, Total=2162 [2019-08-04 21:48:49,763 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 47 states. [2019-08-04 21:48:53,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:48:53,540 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-08-04 21:48:53,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-04 21:48:53,540 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 46 [2019-08-04 21:48:53,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:48:53,541 INFO L225 Difference]: With dead ends: 48 [2019-08-04 21:48:53,541 INFO L226 Difference]: Without dead ends: 48 [2019-08-04 21:48:53,542 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=135, Invalid=2027, Unknown=0, NotChecked=0, Total=2162 [2019-08-04 21:48:53,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-04 21:48:53,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-08-04 21:48:53,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-04 21:48:53,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-08-04 21:48:53,544 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2019-08-04 21:48:53,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:48:53,544 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-08-04 21:48:53,544 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-04 21:48:53,544 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-08-04 21:48:53,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-04 21:48:53,545 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:48:53,545 INFO L399 BasicCegarLoop]: trace histogram [45, 1, 1] [2019-08-04 21:48:53,545 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:48:53,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:48:53,546 INFO L82 PathProgramCache]: Analyzing trace with hash -771945119, now seen corresponding path program 45 times [2019-08-04 21:48:53,546 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:48:53,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:48:54,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 93 conjunts are in the unsatisfiable core [2019-08-04 21:48:54,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:48:58,429 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-04 21:48:58,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:48:58,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-04 21:48:58,430 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-04 21:48:58,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-04 21:48:58,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=2118, Unknown=0, NotChecked=0, Total=2256 [2019-08-04 21:48:58,431 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 48 states. [2019-08-04 21:49:02,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:49:02,439 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-08-04 21:49:02,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-04 21:49:02,442 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 47 [2019-08-04 21:49:02,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:49:02,442 INFO L225 Difference]: With dead ends: 49 [2019-08-04 21:49:02,443 INFO L226 Difference]: Without dead ends: 49 [2019-08-04 21:49:02,443 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=138, Invalid=2118, Unknown=0, NotChecked=0, Total=2256 [2019-08-04 21:49:02,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-04 21:49:02,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-08-04 21:49:02,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-04 21:49:02,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-08-04 21:49:02,445 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2019-08-04 21:49:02,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:49:02,445 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-08-04 21:49:02,446 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-04 21:49:02,446 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-08-04 21:49:02,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-04 21:49:02,446 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:49:02,446 INFO L399 BasicCegarLoop]: trace histogram [46, 1, 1] [2019-08-04 21:49:02,446 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:49:02,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:49:02,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1839505031, now seen corresponding path program 46 times [2019-08-04 21:49:02,447 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:49:02,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:49:03,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 95 conjunts are in the unsatisfiable core [2019-08-04 21:49:03,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:49:07,612 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-04 21:49:07,613 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:49:07,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-04 21:49:07,613 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-04 21:49:07,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-04 21:49:07,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=2211, Unknown=0, NotChecked=0, Total=2352 [2019-08-04 21:49:07,614 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 49 states. [2019-08-04 21:49:11,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:49:11,742 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-08-04 21:49:11,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-04 21:49:11,743 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 48 [2019-08-04 21:49:11,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:49:11,744 INFO L225 Difference]: With dead ends: 50 [2019-08-04 21:49:11,744 INFO L226 Difference]: Without dead ends: 50 [2019-08-04 21:49:11,744 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=141, Invalid=2211, Unknown=0, NotChecked=0, Total=2352 [2019-08-04 21:49:11,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-04 21:49:11,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-08-04 21:49:11,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-04 21:49:11,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-08-04 21:49:11,747 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2019-08-04 21:49:11,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:49:11,747 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-08-04 21:49:11,747 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-04 21:49:11,747 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-08-04 21:49:11,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-04 21:49:11,748 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:49:11,748 INFO L399 BasicCegarLoop]: trace histogram [47, 1, 1] [2019-08-04 21:49:11,748 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:49:11,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:49:11,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1190081057, now seen corresponding path program 47 times [2019-08-04 21:49:11,749 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:49:11,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:49:12,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 97 conjunts are in the unsatisfiable core [2019-08-04 21:49:12,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:49:17,168 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-04 21:49:17,169 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:49:17,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-04 21:49:17,169 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-04 21:49:17,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-04 21:49:17,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=2306, Unknown=0, NotChecked=0, Total=2450 [2019-08-04 21:49:17,169 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 50 states. [2019-08-04 21:49:21,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:49:21,561 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-08-04 21:49:21,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-04 21:49:21,562 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 49 [2019-08-04 21:49:21,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:49:21,562 INFO L225 Difference]: With dead ends: 51 [2019-08-04 21:49:21,563 INFO L226 Difference]: Without dead ends: 51 [2019-08-04 21:49:21,563 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=144, Invalid=2306, Unknown=0, NotChecked=0, Total=2450 [2019-08-04 21:49:21,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-04 21:49:21,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-08-04 21:49:21,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-04 21:49:21,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-08-04 21:49:21,566 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-08-04 21:49:21,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:49:21,566 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-08-04 21:49:21,566 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-04 21:49:21,566 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-08-04 21:49:21,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-04 21:49:21,566 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:49:21,566 INFO L399 BasicCegarLoop]: trace histogram [48, 1, 1] [2019-08-04 21:49:21,566 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:49:21,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:49:21,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1762192953, now seen corresponding path program 48 times [2019-08-04 21:49:21,567 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:49:21,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:49:22,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 99 conjunts are in the unsatisfiable core [2019-08-04 21:49:22,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:49:27,348 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-04 21:49:27,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:49:27,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-04 21:49:27,348 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-04 21:49:27,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-04 21:49:27,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=2403, Unknown=0, NotChecked=0, Total=2550 [2019-08-04 21:49:27,349 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 51 states. [2019-08-04 21:49:32,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:49:32,125 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-08-04 21:49:32,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-04 21:49:32,125 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 50 [2019-08-04 21:49:32,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:49:32,126 INFO L225 Difference]: With dead ends: 52 [2019-08-04 21:49:32,126 INFO L226 Difference]: Without dead ends: 52 [2019-08-04 21:49:32,127 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=147, Invalid=2403, Unknown=0, NotChecked=0, Total=2550 [2019-08-04 21:49:32,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-04 21:49:32,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-04 21:49:32,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-04 21:49:32,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-08-04 21:49:32,130 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2019-08-04 21:49:32,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:49:32,130 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-08-04 21:49:32,130 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-04 21:49:32,130 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-08-04 21:49:32,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-04 21:49:32,131 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:49:32,131 INFO L399 BasicCegarLoop]: trace histogram [49, 1, 1] [2019-08-04 21:49:32,131 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:49:32,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:49:32,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1206593249, now seen corresponding path program 49 times [2019-08-04 21:49:32,132 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:49:32,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:49:33,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 101 conjunts are in the unsatisfiable core [2019-08-04 21:49:33,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:49:38,236 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-04 21:49:38,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:49:38,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-04 21:49:38,236 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-04 21:49:38,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-04 21:49:38,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=2502, Unknown=0, NotChecked=0, Total=2652 [2019-08-04 21:49:38,237 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 52 states. [2019-08-04 21:49:43,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:49:43,088 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-08-04 21:49:43,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-04 21:49:43,089 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 51 [2019-08-04 21:49:43,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:49:43,089 INFO L225 Difference]: With dead ends: 53 [2019-08-04 21:49:43,090 INFO L226 Difference]: Without dead ends: 53 [2019-08-04 21:49:43,090 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=150, Invalid=2502, Unknown=0, NotChecked=0, Total=2652 [2019-08-04 21:49:43,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-04 21:49:43,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-08-04 21:49:43,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-04 21:49:43,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-08-04 21:49:43,093 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2019-08-04 21:49:43,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:49:43,093 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-08-04 21:49:43,093 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-04 21:49:43,093 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-08-04 21:49:43,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-04 21:49:43,094 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:49:43,094 INFO L399 BasicCegarLoop]: trace histogram [50, 1, 1] [2019-08-04 21:49:43,094 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:49:43,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:49:43,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1250315001, now seen corresponding path program 50 times [2019-08-04 21:49:43,095 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:49:43,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:49:44,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 103 conjunts are in the unsatisfiable core [2019-08-04 21:49:44,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:49:49,645 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-04 21:49:49,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:49:49,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-04 21:49:49,646 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-04 21:49:49,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-04 21:49:49,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=2603, Unknown=0, NotChecked=0, Total=2756 [2019-08-04 21:49:49,646 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 53 states. [2019-08-04 21:49:54,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:49:54,827 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-08-04 21:49:54,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-04 21:49:54,827 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 52 [2019-08-04 21:49:54,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:49:54,828 INFO L225 Difference]: With dead ends: 54 [2019-08-04 21:49:54,828 INFO L226 Difference]: Without dead ends: 54 [2019-08-04 21:49:54,829 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=153, Invalid=2603, Unknown=0, NotChecked=0, Total=2756 [2019-08-04 21:49:54,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-04 21:49:54,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-08-04 21:49:54,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-04 21:49:54,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-08-04 21:49:54,831 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2019-08-04 21:49:54,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:49:54,832 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-08-04 21:49:54,832 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-04 21:49:54,832 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-08-04 21:49:54,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-04 21:49:54,832 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:49:54,832 INFO L399 BasicCegarLoop]: trace histogram [51, 1, 1] [2019-08-04 21:49:54,833 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:49:54,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:49:54,833 INFO L82 PathProgramCache]: Analyzing trace with hash -105059423, now seen corresponding path program 51 times [2019-08-04 21:49:54,834 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:49:55,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:49:56,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 105 conjunts are in the unsatisfiable core [2019-08-04 21:49:56,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:50:01,752 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-04 21:50:01,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:50:01,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-04 21:50:01,753 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-04 21:50:01,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-04 21:50:01,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=2706, Unknown=0, NotChecked=0, Total=2862 [2019-08-04 21:50:01,753 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 54 states. [2019-08-04 21:50:07,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:50:07,185 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-08-04 21:50:07,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-04 21:50:07,185 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 53 [2019-08-04 21:50:07,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:50:07,186 INFO L225 Difference]: With dead ends: 55 [2019-08-04 21:50:07,186 INFO L226 Difference]: Without dead ends: 55 [2019-08-04 21:50:07,187 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=156, Invalid=2706, Unknown=0, NotChecked=0, Total=2862 [2019-08-04 21:50:07,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-04 21:50:07,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-08-04 21:50:07,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-04 21:50:07,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-08-04 21:50:07,190 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2019-08-04 21:50:07,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:50:07,190 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-08-04 21:50:07,190 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-04 21:50:07,190 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-08-04 21:50:07,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-04 21:50:07,190 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:50:07,191 INFO L399 BasicCegarLoop]: trace histogram [52, 1, 1] [2019-08-04 21:50:07,191 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:50:07,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:50:07,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1038125127, now seen corresponding path program 52 times [2019-08-04 21:50:07,192 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:50:07,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:50:08,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 107 conjunts are in the unsatisfiable core [2019-08-04 21:50:08,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:50:14,375 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-04 21:50:14,375 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:50:14,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-04 21:50:14,375 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-04 21:50:14,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-04 21:50:14,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=2811, Unknown=0, NotChecked=0, Total=2970 [2019-08-04 21:50:14,376 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 55 states. [2019-08-04 21:50:20,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:50:20,094 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-08-04 21:50:20,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-04 21:50:20,095 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 54 [2019-08-04 21:50:20,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:50:20,095 INFO L225 Difference]: With dead ends: 56 [2019-08-04 21:50:20,096 INFO L226 Difference]: Without dead ends: 56 [2019-08-04 21:50:20,096 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=159, Invalid=2811, Unknown=0, NotChecked=0, Total=2970 [2019-08-04 21:50:20,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-04 21:50:20,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-08-04 21:50:20,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-04 21:50:20,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-08-04 21:50:20,098 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2019-08-04 21:50:20,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:50:20,099 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-08-04 21:50:20,099 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-04 21:50:20,099 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-08-04 21:50:20,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-04 21:50:20,099 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:50:20,099 INFO L399 BasicCegarLoop]: trace histogram [53, 1, 1] [2019-08-04 21:50:20,100 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:50:20,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:50:20,100 INFO L82 PathProgramCache]: Analyzing trace with hash 2117107809, now seen corresponding path program 53 times [2019-08-04 21:50:20,100 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:50:20,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:50:21,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 109 conjunts are in the unsatisfiable core [2019-08-04 21:50:21,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:50:27,779 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-04 21:50:27,779 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:50:27,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-04 21:50:27,779 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-04 21:50:27,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-04 21:50:27,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=2918, Unknown=0, NotChecked=0, Total=3080 [2019-08-04 21:50:27,780 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 56 states. [2019-08-04 21:50:33,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:50:33,817 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-08-04 21:50:33,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-04 21:50:33,818 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 55 [2019-08-04 21:50:33,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:50:33,819 INFO L225 Difference]: With dead ends: 57 [2019-08-04 21:50:33,819 INFO L226 Difference]: Without dead ends: 57 [2019-08-04 21:50:33,819 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=162, Invalid=2918, Unknown=0, NotChecked=0, Total=3080 [2019-08-04 21:50:33,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-04 21:50:33,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-08-04 21:50:33,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-04 21:50:33,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-08-04 21:50:33,821 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2019-08-04 21:50:33,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:50:33,821 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-08-04 21:50:33,821 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-04 21:50:33,821 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-08-04 21:50:33,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-04 21:50:33,822 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:50:33,822 INFO L399 BasicCegarLoop]: trace histogram [54, 1, 1] [2019-08-04 21:50:33,822 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:50:33,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:50:33,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1205832583, now seen corresponding path program 54 times [2019-08-04 21:50:33,823 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:50:34,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:50:35,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 111 conjunts are in the unsatisfiable core [2019-08-04 21:50:35,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:50:41,749 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-04 21:50:41,750 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:50:41,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-04 21:50:41,750 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-04 21:50:41,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-04 21:50:41,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=3027, Unknown=0, NotChecked=0, Total=3192 [2019-08-04 21:50:41,751 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 57 states. [2019-08-04 21:50:48,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:50:48,116 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-08-04 21:50:48,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-04 21:50:48,116 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 56 [2019-08-04 21:50:48,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:50:48,117 INFO L225 Difference]: With dead ends: 58 [2019-08-04 21:50:48,117 INFO L226 Difference]: Without dead ends: 58 [2019-08-04 21:50:48,117 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=165, Invalid=3027, Unknown=0, NotChecked=0, Total=3192 [2019-08-04 21:50:48,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-04 21:50:48,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-08-04 21:50:48,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-04 21:50:48,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-08-04 21:50:48,118 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2019-08-04 21:50:48,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:50:48,119 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-08-04 21:50:48,119 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-04 21:50:48,119 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-08-04 21:50:48,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-04 21:50:48,119 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:50:48,119 INFO L399 BasicCegarLoop]: trace histogram [55, 1, 1] [2019-08-04 21:50:48,119 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:50:48,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:50:48,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1273895647, now seen corresponding path program 55 times [2019-08-04 21:50:48,120 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:50:48,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:50:49,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 113 conjunts are in the unsatisfiable core [2019-08-04 21:50:49,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:50:56,477 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-04 21:50:56,477 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:50:56,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-04 21:50:56,477 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-04 21:50:56,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-04 21:50:56,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=3138, Unknown=0, NotChecked=0, Total=3306 [2019-08-04 21:50:56,478 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 58 states. [2019-08-04 21:51:03,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:51:03,040 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-08-04 21:51:03,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-04 21:51:03,041 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 57 [2019-08-04 21:51:03,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:51:03,041 INFO L225 Difference]: With dead ends: 59 [2019-08-04 21:51:03,041 INFO L226 Difference]: Without dead ends: 59 [2019-08-04 21:51:03,042 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=168, Invalid=3138, Unknown=0, NotChecked=0, Total=3306 [2019-08-04 21:51:03,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-04 21:51:03,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-08-04 21:51:03,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-04 21:51:03,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-08-04 21:51:03,043 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2019-08-04 21:51:03,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:51:03,044 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-08-04 21:51:03,044 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-04 21:51:03,044 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-08-04 21:51:03,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-04 21:51:03,044 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:51:03,044 INFO L399 BasicCegarLoop]: trace histogram [56, 1, 1] [2019-08-04 21:51:03,045 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:51:03,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:51:03,045 INFO L82 PathProgramCache]: Analyzing trace with hash -836059449, now seen corresponding path program 56 times [2019-08-04 21:51:03,045 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:51:03,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:51:04,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 115 conjunts are in the unsatisfiable core [2019-08-04 21:51:04,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:51:11,953 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:51:11,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:51:11,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-04 21:51:11,954 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-04 21:51:11,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-04 21:51:11,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=3251, Unknown=0, NotChecked=0, Total=3422 [2019-08-04 21:51:11,954 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 59 states. [2019-08-04 21:51:18,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:51:18,675 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-08-04 21:51:18,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-04 21:51:18,676 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 58 [2019-08-04 21:51:18,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:51:18,677 INFO L225 Difference]: With dead ends: 60 [2019-08-04 21:51:18,677 INFO L226 Difference]: Without dead ends: 60 [2019-08-04 21:51:18,678 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=171, Invalid=3251, Unknown=0, NotChecked=0, Total=3422 [2019-08-04 21:51:18,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-04 21:51:18,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-08-04 21:51:18,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-04 21:51:18,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-08-04 21:51:18,680 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2019-08-04 21:51:18,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:51:18,680 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-08-04 21:51:18,680 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-04 21:51:18,681 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-08-04 21:51:18,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-04 21:51:18,681 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:51:18,681 INFO L399 BasicCegarLoop]: trace histogram [57, 1, 1] [2019-08-04 21:51:18,681 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:51:18,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:51:18,682 INFO L82 PathProgramCache]: Analyzing trace with hash -148039199, now seen corresponding path program 57 times [2019-08-04 21:51:18,682 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy Received shutdown request... [2019-08-04 21:51:19,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:51:20,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 117 conjunts are in the unsatisfiable core [2019-08-04 21:51:20,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:51:20,750 WARN L196 SmtUtils]: Removed 1 from assertion stack [2019-08-04 21:51:20,750 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2019-08-04 21:51:20,750 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-04 21:51:20,754 WARN L223 ceAbstractionStarter]: Timeout [2019-08-04 21:51:20,754 INFO L202 PluginConnector]: Adding new model GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 09:51:20 BoogieIcfgContainer [2019-08-04 21:51:20,754 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-04 21:51:20,756 INFO L168 Benchmark]: Toolchain (without parser) took 270073.04 ms. Allocated memory was 140.0 MB in the beginning and 276.8 MB in the end (delta: 136.8 MB). Free memory was 107.2 MB in the beginning and 30.8 MB in the end (delta: 76.4 MB). Peak memory consumption was 213.3 MB. Max. memory is 7.1 GB. [2019-08-04 21:51:20,757 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 140.0 MB. Free memory was 108.4 MB in the beginning and 108.2 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-08-04 21:51:20,758 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.01 ms. Allocated memory is still 140.0 MB. Free memory was 107.2 MB in the beginning and 105.3 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-08-04 21:51:20,759 INFO L168 Benchmark]: Boogie Preprocessor took 25.23 ms. Allocated memory is still 140.0 MB. Free memory was 105.3 MB in the beginning and 104.1 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-08-04 21:51:20,759 INFO L168 Benchmark]: RCFGBuilder took 330.88 ms. Allocated memory is still 140.0 MB. Free memory was 104.1 MB in the beginning and 95.2 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 7.1 GB. [2019-08-04 21:51:20,760 INFO L168 Benchmark]: TraceAbstraction took 269672.44 ms. Allocated memory was 140.0 MB in the beginning and 276.8 MB in the end (delta: 136.8 MB). Free memory was 95.0 MB in the beginning and 30.8 MB in the end (delta: 64.2 MB). Peak memory consumption was 201.0 MB. Max. memory is 7.1 GB. [2019-08-04 21:51:20,763 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.20 ms. Allocated memory is still 140.0 MB. Free memory was 108.4 MB in the beginning and 108.2 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 38.01 ms. Allocated memory is still 140.0 MB. Free memory was 107.2 MB in the beginning and 105.3 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 25.23 ms. Allocated memory is still 140.0 MB. Free memory was 105.3 MB in the beginning and 104.1 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 330.88 ms. Allocated memory is still 140.0 MB. Free memory was 104.1 MB in the beginning and 95.2 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 269672.44 ms. Allocated memory was 140.0 MB in the beginning and 276.8 MB in the end (delta: 136.8 MB). Free memory was 95.0 MB in the beginning and 30.8 MB in the end (delta: 64.2 MB). Peak memory consumption was 201.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 21]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 21). Cancelled while BasicCegarLoop was analyzing trace of length 60 with TraceHistMax 57,while TraceCheckSpWp was constructing forward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 7 for 0ms.. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 4 locations, 1 error locations. TIMEOUT Result, 269.6s OverallTime, 58 OverallIterations, 57 TraceHistogramMax, 116.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 114 SDtfs, 1 SDslu, 0 SDs, 0 SdLazy, 62731 SolverSat, 1596 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 108.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1653 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1653 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 123.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=57, 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.1s AutomataMinimizationTime, 57 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 5.9s SatisfiabilityAnalysisTime, 144.7s InterpolantComputationTime, 1710 NumberOfCodeBlocks, 1710 NumberOfCodeBlocksAsserted, 57 NumberOfCheckSat, 1653 ConstructedInterpolants, 0 QuantifiedInterpolants, 677183 SizeOfPredicates, 56 NumberOfNonLiveVariables, 6783 ConjunctsInSsa, 3362 ConjunctsInUnsatCore, 57 InterpolantComputations, 1 PerfectInterpolantSequences, 0/30856 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown