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/20170304-DifficultPathPrograms/nested1.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:17:57,559 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:17:57,561 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:17:57,577 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:17:57,577 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:17:57,579 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:17:57,581 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:17:57,583 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:17:57,586 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:17:57,586 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:17:57,595 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:17:57,596 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:17:57,596 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:17:57,597 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:17:57,598 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:17:57,599 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:17:57,600 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:17:57,601 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:17:57,602 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:17:57,604 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:17:57,606 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:17:57,607 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:17:57,609 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:17:57,610 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:17:57,613 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:17:57,613 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:17:57,614 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:17:57,616 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:17:57,616 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:17:57,621 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:17:57,621 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:17:57,622 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:17:57,622 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:17:57,623 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:17:57,626 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:17:57,626 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:17:57,627 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:17:57,628 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:17:57,628 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:17:57,629 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:17:57,630 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:17:57,680 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:17:57,694 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:17:57,696 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:17:57,698 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:17:57,698 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:17:57,698 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/nested1.i_4.bpl [2019-08-05 10:17:57,699 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/nested1.i_4.bpl' [2019-08-05 10:17:57,729 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:17:57,730 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:17:57,731 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:17:57,731 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:17:57,731 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:17:57,748 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "nested1.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:17:57" (1/1) ... [2019-08-05 10:17:57,757 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "nested1.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:17:57" (1/1) ... [2019-08-05 10:17:57,767 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:17:57,768 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:17:57,768 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:17:57,769 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:17:57,780 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "nested1.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:17:57" (1/1) ... [2019-08-05 10:17:57,782 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "nested1.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:17:57" (1/1) ... [2019-08-05 10:17:57,782 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "nested1.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:17:57" (1/1) ... [2019-08-05 10:17:57,783 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "nested1.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:17:57" (1/1) ... [2019-08-05 10:17:57,787 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "nested1.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:17:57" (1/1) ... [2019-08-05 10:17:57,789 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "nested1.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:17:57" (1/1) ... [2019-08-05 10:17:57,790 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "nested1.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:17:57" (1/1) ... [2019-08-05 10:17:57,792 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:17:57,793 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:17:57,793 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:17:57,793 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:17:57,794 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "nested1.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:17:57" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 10:17:57,856 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 10:17:57,856 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 10:17:58,081 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2019-08-05 10:17:58,083 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 10:17:58,083 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-08-05 10:17:58,084 INFO L202 PluginConnector]: Adding new model nested1.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:17:58 BoogieIcfgContainer [2019-08-05 10:17:58,084 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:17:58,085 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:17:58,086 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:17:58,088 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:17:58,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "nested1.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:17:57" (1/2) ... [2019-08-05 10:17:58,090 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46a127dd and model type nested1.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:17:58, skipping insertion in model container [2019-08-05 10:17:58,090 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "nested1.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:17:58" (2/2) ... [2019-08-05 10:17:58,092 INFO L109 eAbstractionObserver]: Analyzing ICFG nested1.i_4.bpl [2019-08-05 10:17:58,099 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:17:58,105 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:17:58,119 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:17:58,142 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:17:58,143 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:17:58,143 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:17:58,143 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:17:58,143 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:17:58,144 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:17:58,144 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:17:58,144 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:17:58,144 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:17:58,158 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-05 10:17:58,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 10:17:58,167 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:58,167 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 10:17:58,172 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:58,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:58,180 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2019-08-05 10:17:58,223 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:58,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:58,269 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:17:58,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:58,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:58,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:17:58,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:17:58,326 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:17:58,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:17:58,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:17:58,342 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-05 10:17:58,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:58,399 INFO L93 Difference]: Finished difference Result 7 states and 9 transitions. [2019-08-05 10:17:58,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:17:58,401 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 10:17:58,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:58,414 INFO L225 Difference]: With dead ends: 7 [2019-08-05 10:17:58,414 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 10:17:58,416 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:17:58,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 10:17:58,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2019-08-05 10:17:58,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 10:17:58,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2019-08-05 10:17:58,459 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 7 transitions. Word has length 3 [2019-08-05 10:17:58,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:58,460 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 7 transitions. [2019-08-05 10:17:58,460 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:17:58,461 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 7 transitions. [2019-08-05 10:17:58,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:17:58,461 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:58,461 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-05 10:17:58,462 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:58,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:58,462 INFO L82 PathProgramCache]: Analyzing trace with hash 28852267, now seen corresponding path program 1 times [2019-08-05 10:17:58,464 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:58,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:58,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:17:58,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:58,541 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:58,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:17:58,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:17:58,544 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:17:58,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:17:58,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:17:58,545 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. Second operand 3 states. [2019-08-05 10:17:58,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:58,605 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. [2019-08-05 10:17:58,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:17:58,606 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-08-05 10:17:58,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:58,607 INFO L225 Difference]: With dead ends: 7 [2019-08-05 10:17:58,607 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 10:17:58,608 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:17:58,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 10:17:58,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 10:17:58,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:17:58,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-08-05 10:17:58,611 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 5 [2019-08-05 10:17:58,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:58,611 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-08-05 10:17:58,611 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:17:58,612 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-08-05 10:17:58,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:17:58,615 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:58,616 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-05 10:17:58,616 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:58,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:58,616 INFO L82 PathProgramCache]: Analyzing trace with hash 894489354, now seen corresponding path program 1 times [2019-08-05 10:17:58,617 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:58,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:58,657 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:17:58,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:58,725 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:58,725 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:58,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:17:58,726 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:17:58,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:17:58,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:17:58,727 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 4 states. [2019-08-05 10:17:58,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:58,791 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2019-08-05 10:17:58,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:17:58,792 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-08-05 10:17:58,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:58,793 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:17:58,793 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:17:58,794 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:17:58,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:17:58,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 10:17:58,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:17:58,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2019-08-05 10:17:58,796 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 6 [2019-08-05 10:17:58,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:58,797 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2019-08-05 10:17:58,797 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:17:58,797 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2019-08-05 10:17:58,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:17:58,799 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:58,799 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-08-05 10:17:58,799 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:58,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:58,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1959435275, now seen corresponding path program 2 times [2019-08-05 10:17:58,801 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:58,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:58,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:17:58,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:58,896 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:58,897 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:58,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:17:58,897 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:17:58,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:17:58,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:17:58,898 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand 5 states. [2019-08-05 10:17:58,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:58,970 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-08-05 10:17:58,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:17:58,970 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-08-05 10:17:58,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:58,971 INFO L225 Difference]: With dead ends: 9 [2019-08-05 10:17:58,972 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 10:17:58,973 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:17:58,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 10:17:58,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 10:17:58,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:17:58,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-08-05 10:17:58,977 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 7 [2019-08-05 10:17:58,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:58,977 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-08-05 10:17:58,977 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:17:58,977 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2019-08-05 10:17:58,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:17:58,978 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:58,978 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1] [2019-08-05 10:17:58,978 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:58,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:58,979 INFO L82 PathProgramCache]: Analyzing trace with hash 613020458, now seen corresponding path program 3 times [2019-08-05 10:17:58,980 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:59,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:59,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:17:59,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:59,098 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:59,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:59,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:17:59,099 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:17:59,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:17:59,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:17:59,100 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 6 states. [2019-08-05 10:17:59,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:59,191 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2019-08-05 10:17:59,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:17:59,193 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2019-08-05 10:17:59,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:59,194 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:17:59,194 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:17:59,194 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:17:59,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:17:59,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 10:17:59,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:17:59,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2019-08-05 10:17:59,197 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 8 [2019-08-05 10:17:59,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:59,197 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2019-08-05 10:17:59,197 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:17:59,197 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2019-08-05 10:17:59,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:17:59,198 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:59,198 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1] [2019-08-05 10:17:59,198 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:59,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:59,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1823834091, now seen corresponding path program 4 times [2019-08-05 10:17:59,199 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:59,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:59,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:17:59,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:59,450 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:59,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:59,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:17:59,451 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:17:59,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:17:59,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:17:59,451 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand 7 states. [2019-08-05 10:17:59,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:59,580 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2019-08-05 10:17:59,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:17:59,583 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2019-08-05 10:17:59,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:59,584 INFO L225 Difference]: With dead ends: 11 [2019-08-05 10:17:59,584 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 10:17:59,584 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:17:59,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 10:17:59,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 10:17:59,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:17:59,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2019-08-05 10:17:59,587 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 9 [2019-08-05 10:17:59,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:59,587 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-08-05 10:17:59,587 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:17:59,587 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2019-08-05 10:17:59,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:17:59,588 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:59,588 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1] [2019-08-05 10:17:59,588 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:59,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:59,589 INFO L82 PathProgramCache]: Analyzing trace with hash 704351050, now seen corresponding path program 5 times [2019-08-05 10:17:59,590 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:59,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:59,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:17:59,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:59,713 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:59,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:59,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:17:59,714 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:17:59,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:17:59,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:17:59,715 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 8 states. [2019-08-05 10:17:59,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:59,798 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2019-08-05 10:17:59,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:17:59,799 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2019-08-05 10:17:59,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:59,800 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:17:59,800 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:17:59,800 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:17:59,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:17:59,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 10:17:59,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:17:59,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2019-08-05 10:17:59,803 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 10 [2019-08-05 10:17:59,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:59,803 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-08-05 10:17:59,803 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:17:59,803 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2019-08-05 10:17:59,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:17:59,804 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:59,804 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1] [2019-08-05 10:17:59,804 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:59,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:59,805 INFO L82 PathProgramCache]: Analyzing trace with hash 360115147, now seen corresponding path program 6 times [2019-08-05 10:17:59,806 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:59,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:59,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 10:17:59,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:59,949 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:59,950 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:59,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:17:59,950 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:17:59,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:17:59,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:17:59,951 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand 9 states. [2019-08-05 10:18:00,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:00,113 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2019-08-05 10:18:00,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:18:00,116 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 11 [2019-08-05 10:18:00,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:00,116 INFO L225 Difference]: With dead ends: 13 [2019-08-05 10:18:00,116 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 10:18:00,117 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:18:00,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 10:18:00,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 10:18:00,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:18:00,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-08-05 10:18:00,120 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2019-08-05 10:18:00,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:00,120 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-08-05 10:18:00,120 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:18:00,120 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-08-05 10:18:00,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:18:00,121 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:00,121 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1] [2019-08-05 10:18:00,121 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:00,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:00,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1721263254, now seen corresponding path program 7 times [2019-08-05 10:18:00,123 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:00,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:00,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:18:00,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:00,361 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 1 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:00,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:00,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:18:00,362 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:18:00,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:18:00,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:18:00,363 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 10 states. [2019-08-05 10:18:00,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:00,734 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2019-08-05 10:18:00,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:18:00,734 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 12 [2019-08-05 10:18:00,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:00,735 INFO L225 Difference]: With dead ends: 14 [2019-08-05 10:18:00,735 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 10:18:00,736 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:18:00,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 10:18:00,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 10:18:00,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 10:18:00,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-08-05 10:18:00,739 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 12 [2019-08-05 10:18:00,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:00,739 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-08-05 10:18:00,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:18:00,740 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-08-05 10:18:00,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:18:00,740 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:00,740 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1] [2019-08-05 10:18:00,741 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:00,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:00,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1819484245, now seen corresponding path program 8 times [2019-08-05 10:18:00,742 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:00,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:00,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 10:18:00,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:00,936 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 1 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:00,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:00,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:18:00,937 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:18:00,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:18:00,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:18:00,938 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 11 states. [2019-08-05 10:18:01,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:01,051 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2019-08-05 10:18:01,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:18:01,051 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 13 [2019-08-05 10:18:01,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:01,052 INFO L225 Difference]: With dead ends: 15 [2019-08-05 10:18:01,052 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 10:18:01,053 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:18:01,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 10:18:01,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 10:18:01,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 10:18:01,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-08-05 10:18:01,056 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 13 [2019-08-05 10:18:01,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:01,057 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-08-05 10:18:01,057 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:18:01,057 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2019-08-05 10:18:01,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:18:01,058 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:01,058 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1] [2019-08-05 10:18:01,058 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:01,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:01,059 INFO L82 PathProgramCache]: Analyzing trace with hash -569367670, now seen corresponding path program 9 times [2019-08-05 10:18:01,059 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:01,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:01,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 10:18:01,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:01,335 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 1 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:01,335 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:01,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:18:01,336 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:18:01,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:18:01,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:18:01,336 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 12 states. [2019-08-05 10:18:01,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:01,505 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2019-08-05 10:18:01,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:18:01,506 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 14 [2019-08-05 10:18:01,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:01,507 INFO L225 Difference]: With dead ends: 16 [2019-08-05 10:18:01,507 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 10:18:01,508 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:18:01,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 10:18:01,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 10:18:01,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 10:18:01,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2019-08-05 10:18:01,511 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 14 [2019-08-05 10:18:01,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:01,511 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2019-08-05 10:18:01,511 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:18:01,511 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2019-08-05 10:18:01,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:18:01,512 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:01,512 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1] [2019-08-05 10:18:01,512 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:01,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:01,513 INFO L82 PathProgramCache]: Analyzing trace with hash -470459509, now seen corresponding path program 10 times [2019-08-05 10:18:01,513 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:01,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:01,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:18:01,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:01,592 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-08-05 10:18:01,592 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:01,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:18:01,593 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:18:01,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:18:01,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:18:01,593 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 4 states. [2019-08-05 10:18:01,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:01,638 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2019-08-05 10:18:01,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:18:01,640 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-08-05 10:18:01,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:01,640 INFO L225 Difference]: With dead ends: 39 [2019-08-05 10:18:01,640 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 10:18:01,641 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:18:01,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 10:18:01,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 28. [2019-08-05 10:18:01,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:18:01,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2019-08-05 10:18:01,645 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 15 [2019-08-05 10:18:01,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:01,645 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2019-08-05 10:18:01,645 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:18:01,645 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2019-08-05 10:18:01,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:18:01,646 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:01,646 INFO L399 BasicCegarLoop]: trace histogram [20, 2, 2, 1, 1, 1] [2019-08-05 10:18:01,647 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:01,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:01,647 INFO L82 PathProgramCache]: Analyzing trace with hash -413354477, now seen corresponding path program 11 times [2019-08-05 10:18:01,648 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:01,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:01,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:18:01,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:01,873 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 0 proven. 124 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-08-05 10:18:01,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:01,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:18:01,874 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:18:01,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:18:01,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:18:01,875 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 5 states. [2019-08-05 10:18:01,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:01,905 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2019-08-05 10:18:01,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:18:01,905 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-08-05 10:18:01,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:01,906 INFO L225 Difference]: With dead ends: 51 [2019-08-05 10:18:01,907 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:18:01,907 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:18:01,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:18:01,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 40. [2019-08-05 10:18:01,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:18:01,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2019-08-05 10:18:01,912 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 27 [2019-08-05 10:18:01,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:01,913 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2019-08-05 10:18:01,913 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:18:01,913 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2019-08-05 10:18:01,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 10:18:01,914 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:01,914 INFO L399 BasicCegarLoop]: trace histogram [30, 3, 3, 1, 1, 1] [2019-08-05 10:18:01,914 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:01,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:01,915 INFO L82 PathProgramCache]: Analyzing trace with hash -836205413, now seen corresponding path program 12 times [2019-08-05 10:18:01,915 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:01,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:01,948 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:18:01,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:02,283 INFO L134 CoverageAnalysis]: Checked inductivity of 534 backedges. 0 proven. 369 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2019-08-05 10:18:02,284 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:02,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:18:02,284 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:18:02,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:18:02,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:18:02,285 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 6 states. [2019-08-05 10:18:02,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:02,430 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2019-08-05 10:18:02,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:18:02,431 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2019-08-05 10:18:02,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:02,432 INFO L225 Difference]: With dead ends: 63 [2019-08-05 10:18:02,433 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:18:02,433 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:18:02,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:18:02,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 52. [2019-08-05 10:18:02,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:18:02,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2019-08-05 10:18:02,439 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 39 [2019-08-05 10:18:02,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:02,440 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2019-08-05 10:18:02,440 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:18:02,440 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2019-08-05 10:18:02,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 10:18:02,442 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:02,442 INFO L399 BasicCegarLoop]: trace histogram [40, 4, 4, 1, 1, 1] [2019-08-05 10:18:02,442 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:02,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:02,442 INFO L82 PathProgramCache]: Analyzing trace with hash 21677859, now seen corresponding path program 13 times [2019-08-05 10:18:02,443 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:02,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:02,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:18:02,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:02,768 INFO L134 CoverageAnalysis]: Checked inductivity of 956 backedges. 0 proven. 736 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-08-05 10:18:02,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:02,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:18:02,769 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:18:02,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:18:02,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:18:02,769 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 7 states. [2019-08-05 10:18:02,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:02,870 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2019-08-05 10:18:02,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:18:02,871 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-08-05 10:18:02,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:02,872 INFO L225 Difference]: With dead ends: 75 [2019-08-05 10:18:02,872 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 10:18:02,872 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:18:02,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 10:18:02,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 64. [2019-08-05 10:18:02,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-05 10:18:02,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 69 transitions. [2019-08-05 10:18:02,878 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 69 transitions. Word has length 51 [2019-08-05 10:18:02,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:02,878 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 69 transitions. [2019-08-05 10:18:02,878 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:18:02,879 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 69 transitions. [2019-08-05 10:18:02,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-05 10:18:02,880 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:02,880 INFO L399 BasicCegarLoop]: trace histogram [50, 5, 5, 1, 1, 1] [2019-08-05 10:18:02,880 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:02,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:02,881 INFO L82 PathProgramCache]: Analyzing trace with hash 246775211, now seen corresponding path program 14 times [2019-08-05 10:18:02,882 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:02,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:02,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:18:02,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:03,029 INFO L134 CoverageAnalysis]: Checked inductivity of 1500 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2019-08-05 10:18:03,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:03,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:18:03,030 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:18:03,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:18:03,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:18:03,031 INFO L87 Difference]: Start difference. First operand 64 states and 69 transitions. Second operand 8 states. [2019-08-05 10:18:03,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:03,154 INFO L93 Difference]: Finished difference Result 87 states and 94 transitions. [2019-08-05 10:18:03,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:18:03,155 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2019-08-05 10:18:03,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:03,157 INFO L225 Difference]: With dead ends: 87 [2019-08-05 10:18:03,157 INFO L226 Difference]: Without dead ends: 87 [2019-08-05 10:18:03,158 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:18:03,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-08-05 10:18:03,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 76. [2019-08-05 10:18:03,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-05 10:18:03,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2019-08-05 10:18:03,164 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 63 [2019-08-05 10:18:03,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:03,164 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2019-08-05 10:18:03,164 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:18:03,165 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2019-08-05 10:18:03,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-05 10:18:03,166 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:03,166 INFO L399 BasicCegarLoop]: trace histogram [60, 6, 6, 1, 1, 1] [2019-08-05 10:18:03,166 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:03,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:03,167 INFO L82 PathProgramCache]: Analyzing trace with hash 693807155, now seen corresponding path program 15 times [2019-08-05 10:18:03,168 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:03,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:03,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 10:18:03,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:03,319 INFO L134 CoverageAnalysis]: Checked inductivity of 2166 backedges. 0 proven. 1836 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2019-08-05 10:18:03,319 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:03,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:18:03,320 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:18:03,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:18:03,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:18:03,321 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand 9 states. [2019-08-05 10:18:03,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:03,485 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2019-08-05 10:18:03,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:18:03,485 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 75 [2019-08-05 10:18:03,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:03,487 INFO L225 Difference]: With dead ends: 99 [2019-08-05 10:18:03,487 INFO L226 Difference]: Without dead ends: 99 [2019-08-05 10:18:03,487 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:18:03,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-08-05 10:18:03,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 88. [2019-08-05 10:18:03,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-08-05 10:18:03,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2019-08-05 10:18:03,495 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 75 [2019-08-05 10:18:03,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:03,495 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2019-08-05 10:18:03,495 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:18:03,495 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2019-08-05 10:18:03,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-08-05 10:18:03,497 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:03,497 INFO L399 BasicCegarLoop]: trace histogram [70, 7, 7, 1, 1, 1] [2019-08-05 10:18:03,497 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:03,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:03,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1456716101, now seen corresponding path program 16 times [2019-08-05 10:18:03,498 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:03,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:03,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:18:03,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:03,753 INFO L134 CoverageAnalysis]: Checked inductivity of 2954 backedges. 0 proven. 2569 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2019-08-05 10:18:03,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:03,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:18:03,754 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:18:03,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:18:03,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:18:03,755 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand 10 states. [2019-08-05 10:18:03,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:03,942 INFO L93 Difference]: Finished difference Result 111 states and 120 transitions. [2019-08-05 10:18:03,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:18:03,943 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 87 [2019-08-05 10:18:03,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:03,944 INFO L225 Difference]: With dead ends: 111 [2019-08-05 10:18:03,944 INFO L226 Difference]: Without dead ends: 111 [2019-08-05 10:18:03,944 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:18:03,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-08-05 10:18:03,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 100. [2019-08-05 10:18:03,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-08-05 10:18:03,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2019-08-05 10:18:03,950 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 87 [2019-08-05 10:18:03,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:03,951 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2019-08-05 10:18:03,951 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:18:03,951 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2019-08-05 10:18:03,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-08-05 10:18:03,953 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:03,953 INFO L399 BasicCegarLoop]: trace histogram [80, 8, 8, 1, 1, 1] [2019-08-05 10:18:03,953 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:03,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:03,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1961076413, now seen corresponding path program 17 times [2019-08-05 10:18:03,954 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:04,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:04,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 10:18:04,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:04,475 INFO L134 CoverageAnalysis]: Checked inductivity of 3864 backedges. 0 proven. 3424 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2019-08-05 10:18:04,476 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:04,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:18:04,476 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:18:04,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:18:04,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:18:04,477 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand 11 states. [2019-08-05 10:18:05,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:05,125 INFO L93 Difference]: Finished difference Result 123 states and 133 transitions. [2019-08-05 10:18:05,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:18:05,126 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 99 [2019-08-05 10:18:05,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:05,127 INFO L225 Difference]: With dead ends: 123 [2019-08-05 10:18:05,127 INFO L226 Difference]: Without dead ends: 123 [2019-08-05 10:18:05,128 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:18:05,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-08-05 10:18:05,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 112. [2019-08-05 10:18:05,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-08-05 10:18:05,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 121 transitions. [2019-08-05 10:18:05,133 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 121 transitions. Word has length 99 [2019-08-05 10:18:05,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:05,134 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 121 transitions. [2019-08-05 10:18:05,134 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:18:05,134 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 121 transitions. [2019-08-05 10:18:05,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-08-05 10:18:05,135 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:05,136 INFO L399 BasicCegarLoop]: trace histogram [90, 9, 9, 1, 1, 1] [2019-08-05 10:18:05,136 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:05,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:05,137 INFO L82 PathProgramCache]: Analyzing trace with hash -249765941, now seen corresponding path program 18 times [2019-08-05 10:18:05,137 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:05,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:05,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:18:05,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:05,780 INFO L134 CoverageAnalysis]: Checked inductivity of 4896 backedges. 0 proven. 4401 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2019-08-05 10:18:05,780 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:05,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:18:05,781 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:18:05,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:18:05,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:18:05,782 INFO L87 Difference]: Start difference. First operand 112 states and 121 transitions. Second operand 12 states. [2019-08-05 10:18:06,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:06,194 INFO L93 Difference]: Finished difference Result 135 states and 146 transitions. [2019-08-05 10:18:06,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:18:06,195 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 111 [2019-08-05 10:18:06,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:06,196 INFO L225 Difference]: With dead ends: 135 [2019-08-05 10:18:06,196 INFO L226 Difference]: Without dead ends: 135 [2019-08-05 10:18:06,196 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:18:06,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-08-05 10:18:06,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 124. [2019-08-05 10:18:06,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-08-05 10:18:06,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 134 transitions. [2019-08-05 10:18:06,202 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 134 transitions. Word has length 111 [2019-08-05 10:18:06,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:06,202 INFO L475 AbstractCegarLoop]: Abstraction has 124 states and 134 transitions. [2019-08-05 10:18:06,202 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:18:06,202 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 134 transitions. [2019-08-05 10:18:06,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-08-05 10:18:06,204 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:06,204 INFO L399 BasicCegarLoop]: trace histogram [100, 10, 10, 1, 1, 1] [2019-08-05 10:18:06,204 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:06,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:06,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1574970797, now seen corresponding path program 19 times [2019-08-05 10:18:06,205 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:06,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:06,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 10:18:06,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:06,721 INFO L134 CoverageAnalysis]: Checked inductivity of 6050 backedges. 0 proven. 5500 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2019-08-05 10:18:06,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:06,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:18:06,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:18:06,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:18:06,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:18:06,722 INFO L87 Difference]: Start difference. First operand 124 states and 134 transitions. Second operand 13 states. [2019-08-05 10:18:07,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:07,056 INFO L93 Difference]: Finished difference Result 147 states and 159 transitions. [2019-08-05 10:18:07,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:18:07,056 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 123 [2019-08-05 10:18:07,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:07,058 INFO L225 Difference]: With dead ends: 147 [2019-08-05 10:18:07,058 INFO L226 Difference]: Without dead ends: 147 [2019-08-05 10:18:07,059 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:18:07,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-08-05 10:18:07,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 136. [2019-08-05 10:18:07,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-08-05 10:18:07,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 147 transitions. [2019-08-05 10:18:07,063 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 147 transitions. Word has length 123 [2019-08-05 10:18:07,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:07,064 INFO L475 AbstractCegarLoop]: Abstraction has 136 states and 147 transitions. [2019-08-05 10:18:07,064 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:18:07,064 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 147 transitions. [2019-08-05 10:18:07,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-08-05 10:18:07,066 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:07,066 INFO L399 BasicCegarLoop]: trace histogram [110, 11, 11, 1, 1, 1] [2019-08-05 10:18:07,066 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:07,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:07,066 INFO L82 PathProgramCache]: Analyzing trace with hash -1978185509, now seen corresponding path program 20 times [2019-08-05 10:18:07,067 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:07,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:07,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 10:18:07,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:07,379 INFO L134 CoverageAnalysis]: Checked inductivity of 7326 backedges. 0 proven. 6721 refuted. 0 times theorem prover too weak. 605 trivial. 0 not checked. [2019-08-05 10:18:07,379 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:07,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:18:07,379 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:18:07,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:18:07,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:18:07,380 INFO L87 Difference]: Start difference. First operand 136 states and 147 transitions. Second operand 14 states. [2019-08-05 10:18:07,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:07,778 INFO L93 Difference]: Finished difference Result 159 states and 172 transitions. [2019-08-05 10:18:07,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:18:07,781 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 135 [2019-08-05 10:18:07,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:07,782 INFO L225 Difference]: With dead ends: 159 [2019-08-05 10:18:07,782 INFO L226 Difference]: Without dead ends: 159 [2019-08-05 10:18:07,783 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:18:07,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-08-05 10:18:07,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 148. [2019-08-05 10:18:07,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-08-05 10:18:07,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 160 transitions. [2019-08-05 10:18:07,786 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 160 transitions. Word has length 135 [2019-08-05 10:18:07,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:07,787 INFO L475 AbstractCegarLoop]: Abstraction has 148 states and 160 transitions. [2019-08-05 10:18:07,787 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:18:07,787 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 160 transitions. [2019-08-05 10:18:07,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-08-05 10:18:07,788 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:07,789 INFO L399 BasicCegarLoop]: trace histogram [120, 12, 12, 1, 1, 1] [2019-08-05 10:18:07,789 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:07,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:07,789 INFO L82 PathProgramCache]: Analyzing trace with hash 972368739, now seen corresponding path program 21 times [2019-08-05 10:18:07,790 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:07,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:07,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 10:18:07,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:08,509 INFO L134 CoverageAnalysis]: Checked inductivity of 8724 backedges. 0 proven. 8064 refuted. 0 times theorem prover too weak. 660 trivial. 0 not checked. [2019-08-05 10:18:08,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:08,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:18:08,510 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:18:08,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:18:08,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:18:08,510 INFO L87 Difference]: Start difference. First operand 148 states and 160 transitions. Second operand 15 states. [2019-08-05 10:18:08,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:08,851 INFO L93 Difference]: Finished difference Result 171 states and 185 transitions. [2019-08-05 10:18:08,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:18:08,852 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 147 [2019-08-05 10:18:08,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:08,854 INFO L225 Difference]: With dead ends: 171 [2019-08-05 10:18:08,854 INFO L226 Difference]: Without dead ends: 171 [2019-08-05 10:18:08,855 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:18:08,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-08-05 10:18:08,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 160. [2019-08-05 10:18:08,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-08-05 10:18:08,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 173 transitions. [2019-08-05 10:18:08,858 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 173 transitions. Word has length 147 [2019-08-05 10:18:08,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:08,859 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 173 transitions. [2019-08-05 10:18:08,859 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:18:08,859 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 173 transitions. [2019-08-05 10:18:08,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-08-05 10:18:08,860 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:08,861 INFO L399 BasicCegarLoop]: trace histogram [130, 13, 13, 1, 1, 1] [2019-08-05 10:18:08,861 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:08,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:08,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1739293163, now seen corresponding path program 22 times [2019-08-05 10:18:08,862 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:08,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:08,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 10:18:08,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:09,624 INFO L134 CoverageAnalysis]: Checked inductivity of 10244 backedges. 0 proven. 9529 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2019-08-05 10:18:09,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:09,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:18:09,625 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:18:09,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:18:09,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:18:09,625 INFO L87 Difference]: Start difference. First operand 160 states and 173 transitions. Second operand 16 states. [2019-08-05 10:18:10,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:10,027 INFO L93 Difference]: Finished difference Result 183 states and 198 transitions. [2019-08-05 10:18:10,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:18:10,027 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 159 [2019-08-05 10:18:10,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:10,029 INFO L225 Difference]: With dead ends: 183 [2019-08-05 10:18:10,029 INFO L226 Difference]: Without dead ends: 183 [2019-08-05 10:18:10,029 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:18:10,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-08-05 10:18:10,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 172. [2019-08-05 10:18:10,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-08-05 10:18:10,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 186 transitions. [2019-08-05 10:18:10,034 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 186 transitions. Word has length 159 [2019-08-05 10:18:10,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:10,034 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 186 transitions. [2019-08-05 10:18:10,034 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:18:10,034 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 186 transitions. [2019-08-05 10:18:10,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-08-05 10:18:10,036 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:10,036 INFO L399 BasicCegarLoop]: trace histogram [140, 14, 14, 1, 1, 1] [2019-08-05 10:18:10,036 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:10,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:10,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1848396915, now seen corresponding path program 23 times [2019-08-05 10:18:10,037 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:10,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:10,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 10:18:10,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:11,396 INFO L134 CoverageAnalysis]: Checked inductivity of 11886 backedges. 0 proven. 11116 refuted. 0 times theorem prover too weak. 770 trivial. 0 not checked. [2019-08-05 10:18:11,396 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:11,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:18:11,397 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:18:11,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:18:11,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:18:11,397 INFO L87 Difference]: Start difference. First operand 172 states and 186 transitions. Second operand 17 states. [2019-08-05 10:18:11,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:11,774 INFO L93 Difference]: Finished difference Result 195 states and 211 transitions. [2019-08-05 10:18:11,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:18:11,776 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 171 [2019-08-05 10:18:11,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:11,778 INFO L225 Difference]: With dead ends: 195 [2019-08-05 10:18:11,778 INFO L226 Difference]: Without dead ends: 195 [2019-08-05 10:18:11,778 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:18:11,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-08-05 10:18:11,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 184. [2019-08-05 10:18:11,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-08-05 10:18:11,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 199 transitions. [2019-08-05 10:18:11,782 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 199 transitions. Word has length 171 [2019-08-05 10:18:11,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:11,783 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 199 transitions. [2019-08-05 10:18:11,783 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:18:11,783 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 199 transitions. [2019-08-05 10:18:11,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-08-05 10:18:11,784 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:11,785 INFO L399 BasicCegarLoop]: trace histogram [150, 15, 15, 1, 1, 1] [2019-08-05 10:18:11,785 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:11,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:11,785 INFO L82 PathProgramCache]: Analyzing trace with hash -848721157, now seen corresponding path program 24 times [2019-08-05 10:18:11,787 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:11,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:11,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 10:18:11,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:12,841 INFO L134 CoverageAnalysis]: Checked inductivity of 13650 backedges. 0 proven. 12825 refuted. 0 times theorem prover too weak. 825 trivial. 0 not checked. [2019-08-05 10:18:12,842 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:12,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:18:12,842 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:18:12,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:18:12,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:18:12,843 INFO L87 Difference]: Start difference. First operand 184 states and 199 transitions. Second operand 18 states. [2019-08-05 10:18:13,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:13,320 INFO L93 Difference]: Finished difference Result 207 states and 224 transitions. [2019-08-05 10:18:13,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:18:13,320 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 183 [2019-08-05 10:18:13,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:13,322 INFO L225 Difference]: With dead ends: 207 [2019-08-05 10:18:13,323 INFO L226 Difference]: Without dead ends: 207 [2019-08-05 10:18:13,323 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:18:13,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-08-05 10:18:13,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 196. [2019-08-05 10:18:13,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-08-05 10:18:13,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 212 transitions. [2019-08-05 10:18:13,327 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 212 transitions. Word has length 183 [2019-08-05 10:18:13,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:13,328 INFO L475 AbstractCegarLoop]: Abstraction has 196 states and 212 transitions. [2019-08-05 10:18:13,328 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:18:13,328 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 212 transitions. [2019-08-05 10:18:13,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-08-05 10:18:13,329 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:13,329 INFO L399 BasicCegarLoop]: trace histogram [160, 16, 16, 1, 1, 1] [2019-08-05 10:18:13,329 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:13,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:13,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1437254269, now seen corresponding path program 25 times [2019-08-05 10:18:13,330 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:13,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:13,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 590 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 10:18:13,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:13,734 INFO L134 CoverageAnalysis]: Checked inductivity of 15536 backedges. 0 proven. 14656 refuted. 0 times theorem prover too weak. 880 trivial. 0 not checked. [2019-08-05 10:18:13,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:13,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:18:13,735 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:18:13,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:18:13,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:18:13,736 INFO L87 Difference]: Start difference. First operand 196 states and 212 transitions. Second operand 19 states. [2019-08-05 10:18:14,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:14,405 INFO L93 Difference]: Finished difference Result 219 states and 237 transitions. [2019-08-05 10:18:14,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:18:14,406 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 195 [2019-08-05 10:18:14,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:14,408 INFO L225 Difference]: With dead ends: 219 [2019-08-05 10:18:14,408 INFO L226 Difference]: Without dead ends: 219 [2019-08-05 10:18:14,409 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:18:14,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-08-05 10:18:14,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 208. [2019-08-05 10:18:14,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-08-05 10:18:14,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 225 transitions. [2019-08-05 10:18:14,413 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 225 transitions. Word has length 195 [2019-08-05 10:18:14,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:14,414 INFO L475 AbstractCegarLoop]: Abstraction has 208 states and 225 transitions. [2019-08-05 10:18:14,414 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:18:14,414 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 225 transitions. [2019-08-05 10:18:14,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-08-05 10:18:14,415 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:14,415 INFO L399 BasicCegarLoop]: trace histogram [170, 17, 17, 1, 1, 1] [2019-08-05 10:18:14,415 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:14,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:14,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1323394059, now seen corresponding path program 26 times [2019-08-05 10:18:14,417 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:14,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:14,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 626 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 10:18:14,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:15,228 INFO L134 CoverageAnalysis]: Checked inductivity of 17544 backedges. 0 proven. 16609 refuted. 0 times theorem prover too weak. 935 trivial. 0 not checked. [2019-08-05 10:18:15,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:15,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:18:15,229 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:18:15,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:18:15,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:18:15,230 INFO L87 Difference]: Start difference. First operand 208 states and 225 transitions. Second operand 20 states. [2019-08-05 10:18:15,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:15,780 INFO L93 Difference]: Finished difference Result 231 states and 250 transitions. [2019-08-05 10:18:15,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:18:15,782 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 207 [2019-08-05 10:18:15,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:15,784 INFO L225 Difference]: With dead ends: 231 [2019-08-05 10:18:15,784 INFO L226 Difference]: Without dead ends: 231 [2019-08-05 10:18:15,785 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:18:15,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2019-08-05 10:18:15,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 220. [2019-08-05 10:18:15,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-08-05 10:18:15,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 238 transitions. [2019-08-05 10:18:15,789 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 238 transitions. Word has length 207 [2019-08-05 10:18:15,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:15,790 INFO L475 AbstractCegarLoop]: Abstraction has 220 states and 238 transitions. [2019-08-05 10:18:15,790 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:18:15,790 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 238 transitions. [2019-08-05 10:18:15,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-08-05 10:18:15,791 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:15,791 INFO L399 BasicCegarLoop]: trace histogram [180, 18, 18, 1, 1, 1] [2019-08-05 10:18:15,791 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:15,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:15,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1442840941, now seen corresponding path program 27 times [2019-08-05 10:18:15,792 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:15,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:15,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 662 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 10:18:15,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:17,067 INFO L134 CoverageAnalysis]: Checked inductivity of 19674 backedges. 0 proven. 18684 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-08-05 10:18:17,067 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:17,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:18:17,068 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:18:17,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:18:17,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:18:17,069 INFO L87 Difference]: Start difference. First operand 220 states and 238 transitions. Second operand 21 states. [2019-08-05 10:18:17,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:17,879 INFO L93 Difference]: Finished difference Result 243 states and 263 transitions. [2019-08-05 10:18:17,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:18:17,879 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 219 [2019-08-05 10:18:17,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:17,881 INFO L225 Difference]: With dead ends: 243 [2019-08-05 10:18:17,881 INFO L226 Difference]: Without dead ends: 243 [2019-08-05 10:18:17,882 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:18:17,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-08-05 10:18:17,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 232. [2019-08-05 10:18:17,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-08-05 10:18:17,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 251 transitions. [2019-08-05 10:18:17,887 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 251 transitions. Word has length 219 [2019-08-05 10:18:17,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:17,888 INFO L475 AbstractCegarLoop]: Abstraction has 232 states and 251 transitions. [2019-08-05 10:18:17,888 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:18:17,888 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 251 transitions. [2019-08-05 10:18:17,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-08-05 10:18:17,889 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:17,890 INFO L399 BasicCegarLoop]: trace histogram [190, 19, 19, 1, 1, 1] [2019-08-05 10:18:17,890 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:17,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:17,890 INFO L82 PathProgramCache]: Analyzing trace with hash -811397861, now seen corresponding path program 28 times [2019-08-05 10:18:17,891 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:18,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:18,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 698 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 10:18:18,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:19,221 INFO L134 CoverageAnalysis]: Checked inductivity of 21926 backedges. 0 proven. 20881 refuted. 0 times theorem prover too weak. 1045 trivial. 0 not checked. [2019-08-05 10:18:19,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:19,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:18:19,222 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:18:19,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:18:19,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:18:19,223 INFO L87 Difference]: Start difference. First operand 232 states and 251 transitions. Second operand 22 states. [2019-08-05 10:18:19,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:19,847 INFO L93 Difference]: Finished difference Result 255 states and 276 transitions. [2019-08-05 10:18:19,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:18:19,852 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 231 [2019-08-05 10:18:19,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:19,854 INFO L225 Difference]: With dead ends: 255 [2019-08-05 10:18:19,854 INFO L226 Difference]: Without dead ends: 255 [2019-08-05 10:18:19,855 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:18:19,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-08-05 10:18:19,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 244. [2019-08-05 10:18:19,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2019-08-05 10:18:19,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 264 transitions. [2019-08-05 10:18:19,860 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 264 transitions. Word has length 231 [2019-08-05 10:18:19,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:19,861 INFO L475 AbstractCegarLoop]: Abstraction has 244 states and 264 transitions. [2019-08-05 10:18:19,861 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:18:19,861 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 264 transitions. [2019-08-05 10:18:19,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-08-05 10:18:19,862 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:19,863 INFO L399 BasicCegarLoop]: trace histogram [200, 20, 20, 1, 1, 1] [2019-08-05 10:18:19,863 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:19,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:19,863 INFO L82 PathProgramCache]: Analyzing trace with hash 2025623459, now seen corresponding path program 29 times [2019-08-05 10:18:19,864 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:19,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:19,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 734 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 10:18:19,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:20,324 INFO L134 CoverageAnalysis]: Checked inductivity of 24300 backedges. 0 proven. 23200 refuted. 0 times theorem prover too weak. 1100 trivial. 0 not checked. [2019-08-05 10:18:20,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:20,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:18:20,325 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:18:20,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:18:20,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:18:20,326 INFO L87 Difference]: Start difference. First operand 244 states and 264 transitions. Second operand 23 states. [2019-08-05 10:18:20,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:20,980 INFO L93 Difference]: Finished difference Result 267 states and 289 transitions. [2019-08-05 10:18:20,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:18:20,981 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 243 [2019-08-05 10:18:20,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:20,983 INFO L225 Difference]: With dead ends: 267 [2019-08-05 10:18:20,983 INFO L226 Difference]: Without dead ends: 267 [2019-08-05 10:18:20,984 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:18:20,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2019-08-05 10:18:20,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 256. [2019-08-05 10:18:20,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-08-05 10:18:20,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 277 transitions. [2019-08-05 10:18:20,989 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 277 transitions. Word has length 243 [2019-08-05 10:18:20,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:20,990 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 277 transitions. [2019-08-05 10:18:20,990 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:18:20,990 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 277 transitions. [2019-08-05 10:18:20,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-08-05 10:18:20,991 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:20,991 INFO L399 BasicCegarLoop]: trace histogram [210, 21, 21, 1, 1, 1] [2019-08-05 10:18:20,992 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:20,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:20,992 INFO L82 PathProgramCache]: Analyzing trace with hash -2093054421, now seen corresponding path program 30 times [2019-08-05 10:18:20,993 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:21,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:21,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 770 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-05 10:18:21,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:21,653 INFO L134 CoverageAnalysis]: Checked inductivity of 26796 backedges. 0 proven. 25641 refuted. 0 times theorem prover too weak. 1155 trivial. 0 not checked. [2019-08-05 10:18:21,653 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:21,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:18:21,653 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:18:21,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:18:21,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:18:21,654 INFO L87 Difference]: Start difference. First operand 256 states and 277 transitions. Second operand 24 states. [2019-08-05 10:18:22,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:22,388 INFO L93 Difference]: Finished difference Result 279 states and 302 transitions. [2019-08-05 10:18:22,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:18:22,389 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 255 [2019-08-05 10:18:22,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:22,391 INFO L225 Difference]: With dead ends: 279 [2019-08-05 10:18:22,391 INFO L226 Difference]: Without dead ends: 279 [2019-08-05 10:18:22,392 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:18:22,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-08-05 10:18:22,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 268. [2019-08-05 10:18:22,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-08-05 10:18:22,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 290 transitions. [2019-08-05 10:18:22,397 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 290 transitions. Word has length 255 [2019-08-05 10:18:22,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:22,398 INFO L475 AbstractCegarLoop]: Abstraction has 268 states and 290 transitions. [2019-08-05 10:18:22,398 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:18:22,398 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 290 transitions. [2019-08-05 10:18:22,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2019-08-05 10:18:22,399 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:22,399 INFO L399 BasicCegarLoop]: trace histogram [220, 22, 22, 1, 1, 1] [2019-08-05 10:18:22,400 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:22,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:22,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1914368179, now seen corresponding path program 31 times [2019-08-05 10:18:22,401 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:22,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:22,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 806 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 10:18:22,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:23,234 INFO L134 CoverageAnalysis]: Checked inductivity of 29414 backedges. 0 proven. 28204 refuted. 0 times theorem prover too weak. 1210 trivial. 0 not checked. [2019-08-05 10:18:23,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:23,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:18:23,235 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:18:23,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:18:23,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:18:23,236 INFO L87 Difference]: Start difference. First operand 268 states and 290 transitions. Second operand 25 states. [2019-08-05 10:18:24,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:24,037 INFO L93 Difference]: Finished difference Result 291 states and 315 transitions. [2019-08-05 10:18:24,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:18:24,037 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 267 [2019-08-05 10:18:24,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:24,040 INFO L225 Difference]: With dead ends: 291 [2019-08-05 10:18:24,040 INFO L226 Difference]: Without dead ends: 291 [2019-08-05 10:18:24,041 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:18:24,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-08-05 10:18:24,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 280. [2019-08-05 10:18:24,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-08-05 10:18:24,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 303 transitions. [2019-08-05 10:18:24,046 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 303 transitions. Word has length 267 [2019-08-05 10:18:24,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:24,047 INFO L475 AbstractCegarLoop]: Abstraction has 280 states and 303 transitions. [2019-08-05 10:18:24,047 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:18:24,047 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 303 transitions. [2019-08-05 10:18:24,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2019-08-05 10:18:24,049 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:24,049 INFO L399 BasicCegarLoop]: trace histogram [230, 23, 23, 1, 1, 1] [2019-08-05 10:18:24,049 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:24,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:24,050 INFO L82 PathProgramCache]: Analyzing trace with hash -314323141, now seen corresponding path program 32 times [2019-08-05 10:18:24,050 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:24,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:24,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 842 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 10:18:24,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:25,751 INFO L134 CoverageAnalysis]: Checked inductivity of 32154 backedges. 0 proven. 30889 refuted. 0 times theorem prover too weak. 1265 trivial. 0 not checked. [2019-08-05 10:18:25,751 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:25,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:18:25,752 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:18:25,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:18:25,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:18:25,753 INFO L87 Difference]: Start difference. First operand 280 states and 303 transitions. Second operand 26 states. [2019-08-05 10:18:26,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:26,641 INFO L93 Difference]: Finished difference Result 303 states and 328 transitions. [2019-08-05 10:18:26,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:18:26,641 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 279 [2019-08-05 10:18:26,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:26,644 INFO L225 Difference]: With dead ends: 303 [2019-08-05 10:18:26,644 INFO L226 Difference]: Without dead ends: 303 [2019-08-05 10:18:26,645 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:18:26,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-08-05 10:18:26,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 292. [2019-08-05 10:18:26,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-08-05 10:18:26,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 316 transitions. [2019-08-05 10:18:26,650 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 316 transitions. Word has length 279 [2019-08-05 10:18:26,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:26,651 INFO L475 AbstractCegarLoop]: Abstraction has 292 states and 316 transitions. [2019-08-05 10:18:26,651 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:18:26,651 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 316 transitions. [2019-08-05 10:18:26,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2019-08-05 10:18:26,652 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:26,653 INFO L399 BasicCegarLoop]: trace histogram [240, 24, 24, 1, 1, 1] [2019-08-05 10:18:26,653 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:26,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:26,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1101734339, now seen corresponding path program 33 times [2019-08-05 10:18:26,654 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:26,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:26,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 878 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-05 10:18:26,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:27,257 INFO L134 CoverageAnalysis]: Checked inductivity of 35016 backedges. 0 proven. 33696 refuted. 0 times theorem prover too weak. 1320 trivial. 0 not checked. [2019-08-05 10:18:27,258 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:27,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:18:27,258 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:18:27,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:18:27,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:18:27,259 INFO L87 Difference]: Start difference. First operand 292 states and 316 transitions. Second operand 27 states. [2019-08-05 10:18:28,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:28,349 INFO L93 Difference]: Finished difference Result 315 states and 341 transitions. [2019-08-05 10:18:28,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:18:28,349 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 291 [2019-08-05 10:18:28,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:28,352 INFO L225 Difference]: With dead ends: 315 [2019-08-05 10:18:28,352 INFO L226 Difference]: Without dead ends: 315 [2019-08-05 10:18:28,353 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:18:28,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-08-05 10:18:28,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 304. [2019-08-05 10:18:28,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-08-05 10:18:28,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 329 transitions. [2019-08-05 10:18:28,357 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 329 transitions. Word has length 291 [2019-08-05 10:18:28,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:28,358 INFO L475 AbstractCegarLoop]: Abstraction has 304 states and 329 transitions. [2019-08-05 10:18:28,358 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:18:28,358 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 329 transitions. [2019-08-05 10:18:28,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2019-08-05 10:18:28,359 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:28,360 INFO L399 BasicCegarLoop]: trace histogram [250, 25, 25, 1, 1, 1] [2019-08-05 10:18:28,360 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:28,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:28,360 INFO L82 PathProgramCache]: Analyzing trace with hash -515708853, now seen corresponding path program 34 times [2019-08-05 10:18:28,361 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:28,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:28,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 914 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 10:18:28,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:29,067 INFO L134 CoverageAnalysis]: Checked inductivity of 38000 backedges. 0 proven. 36625 refuted. 0 times theorem prover too weak. 1375 trivial. 0 not checked. [2019-08-05 10:18:29,067 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:29,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 10:18:29,068 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:18:29,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:18:29,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:18:29,069 INFO L87 Difference]: Start difference. First operand 304 states and 329 transitions. Second operand 28 states. [2019-08-05 10:18:30,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:30,057 INFO L93 Difference]: Finished difference Result 327 states and 354 transitions. [2019-08-05 10:18:30,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:18:30,058 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 303 [2019-08-05 10:18:30,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:30,060 INFO L225 Difference]: With dead ends: 327 [2019-08-05 10:18:30,060 INFO L226 Difference]: Without dead ends: 327 [2019-08-05 10:18:30,061 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:18:30,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2019-08-05 10:18:30,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 316. [2019-08-05 10:18:30,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2019-08-05 10:18:30,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 342 transitions. [2019-08-05 10:18:30,066 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 342 transitions. Word has length 303 [2019-08-05 10:18:30,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:30,066 INFO L475 AbstractCegarLoop]: Abstraction has 316 states and 342 transitions. [2019-08-05 10:18:30,067 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:18:30,067 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 342 transitions. [2019-08-05 10:18:30,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2019-08-05 10:18:30,068 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:30,069 INFO L399 BasicCegarLoop]: trace histogram [260, 26, 26, 1, 1, 1] [2019-08-05 10:18:30,069 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:30,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:30,069 INFO L82 PathProgramCache]: Analyzing trace with hash -486726957, now seen corresponding path program 35 times [2019-08-05 10:18:30,070 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:30,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:30,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 950 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-05 10:18:30,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:30,741 INFO L134 CoverageAnalysis]: Checked inductivity of 41106 backedges. 0 proven. 39676 refuted. 0 times theorem prover too weak. 1430 trivial. 0 not checked. [2019-08-05 10:18:30,741 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:30,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 10:18:30,742 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 10:18:30,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 10:18:30,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:18:30,742 INFO L87 Difference]: Start difference. First operand 316 states and 342 transitions. Second operand 29 states. [2019-08-05 10:18:31,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:31,773 INFO L93 Difference]: Finished difference Result 339 states and 367 transitions. [2019-08-05 10:18:31,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:18:31,773 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 315 [2019-08-05 10:18:31,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:31,775 INFO L225 Difference]: With dead ends: 339 [2019-08-05 10:18:31,775 INFO L226 Difference]: Without dead ends: 339 [2019-08-05 10:18:31,776 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:18:31,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2019-08-05 10:18:31,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 328. [2019-08-05 10:18:31,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-08-05 10:18:31,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 355 transitions. [2019-08-05 10:18:31,781 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 355 transitions. Word has length 315 [2019-08-05 10:18:31,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:31,781 INFO L475 AbstractCegarLoop]: Abstraction has 328 states and 355 transitions. [2019-08-05 10:18:31,781 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 10:18:31,782 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 355 transitions. [2019-08-05 10:18:31,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2019-08-05 10:18:31,783 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:31,783 INFO L399 BasicCegarLoop]: trace histogram [270, 27, 27, 1, 1, 1] [2019-08-05 10:18:31,784 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:31,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:31,784 INFO L82 PathProgramCache]: Analyzing trace with hash -2100571813, now seen corresponding path program 36 times [2019-08-05 10:18:31,785 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:31,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:31,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 986 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-05 10:18:31,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:32,465 INFO L134 CoverageAnalysis]: Checked inductivity of 44334 backedges. 0 proven. 42849 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2019-08-05 10:18:32,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:32,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 10:18:32,466 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:18:32,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:18:32,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:18:32,467 INFO L87 Difference]: Start difference. First operand 328 states and 355 transitions. Second operand 30 states. [2019-08-05 10:18:33,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:33,824 INFO L93 Difference]: Finished difference Result 351 states and 380 transitions. [2019-08-05 10:18:33,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 10:18:33,824 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 327 [2019-08-05 10:18:33,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:33,827 INFO L225 Difference]: With dead ends: 351 [2019-08-05 10:18:33,827 INFO L226 Difference]: Without dead ends: 351 [2019-08-05 10:18:33,828 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:18:33,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2019-08-05 10:18:33,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 340. [2019-08-05 10:18:33,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-08-05 10:18:33,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 368 transitions. [2019-08-05 10:18:33,832 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 368 transitions. Word has length 327 [2019-08-05 10:18:33,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:33,833 INFO L475 AbstractCegarLoop]: Abstraction has 340 states and 368 transitions. [2019-08-05 10:18:33,833 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:18:33,833 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 368 transitions. [2019-08-05 10:18:33,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2019-08-05 10:18:33,835 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:33,835 INFO L399 BasicCegarLoop]: trace histogram [280, 28, 28, 1, 1, 1] [2019-08-05 10:18:33,835 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:33,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:33,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1583287325, now seen corresponding path program 37 times [2019-08-05 10:18:33,836 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:34,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:34,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 1022 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-05 10:18:34,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:34,550 INFO L134 CoverageAnalysis]: Checked inductivity of 47684 backedges. 0 proven. 46144 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2019-08-05 10:18:34,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:34,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 10:18:34,551 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 10:18:34,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 10:18:34,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:18:34,552 INFO L87 Difference]: Start difference. First operand 340 states and 368 transitions. Second operand 31 states. [2019-08-05 10:18:35,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:35,726 INFO L93 Difference]: Finished difference Result 363 states and 393 transitions. [2019-08-05 10:18:35,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 10:18:35,727 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 339 [2019-08-05 10:18:35,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:35,729 INFO L225 Difference]: With dead ends: 363 [2019-08-05 10:18:35,729 INFO L226 Difference]: Without dead ends: 363 [2019-08-05 10:18:35,730 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:18:35,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-08-05 10:18:35,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 352. [2019-08-05 10:18:35,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-08-05 10:18:35,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 381 transitions. [2019-08-05 10:18:35,735 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 381 transitions. Word has length 339 [2019-08-05 10:18:35,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:35,736 INFO L475 AbstractCegarLoop]: Abstraction has 352 states and 381 transitions. [2019-08-05 10:18:35,736 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 10:18:35,736 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 381 transitions. [2019-08-05 10:18:35,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2019-08-05 10:18:35,738 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:35,738 INFO L399 BasicCegarLoop]: trace histogram [290, 29, 29, 1, 1, 1] [2019-08-05 10:18:35,738 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:35,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:35,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1164872299, now seen corresponding path program 38 times [2019-08-05 10:18:35,740 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:35,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:35,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 1058 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-05 10:18:35,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:36,503 INFO L134 CoverageAnalysis]: Checked inductivity of 51156 backedges. 0 proven. 49561 refuted. 0 times theorem prover too weak. 1595 trivial. 0 not checked. [2019-08-05 10:18:36,503 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:36,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 10:18:36,504 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:18:36,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:18:36,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:18:36,504 INFO L87 Difference]: Start difference. First operand 352 states and 381 transitions. Second operand 32 states. [2019-08-05 10:18:37,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:37,791 INFO L93 Difference]: Finished difference Result 375 states and 406 transitions. [2019-08-05 10:18:37,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:18:37,791 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 351 [2019-08-05 10:18:37,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:37,794 INFO L225 Difference]: With dead ends: 375 [2019-08-05 10:18:37,794 INFO L226 Difference]: Without dead ends: 375 [2019-08-05 10:18:37,795 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 320 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:18:37,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2019-08-05 10:18:37,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 364. [2019-08-05 10:18:37,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2019-08-05 10:18:37,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 394 transitions. [2019-08-05 10:18:37,800 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 394 transitions. Word has length 351 [2019-08-05 10:18:37,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:37,801 INFO L475 AbstractCegarLoop]: Abstraction has 364 states and 394 transitions. [2019-08-05 10:18:37,801 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:18:37,801 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 394 transitions. [2019-08-05 10:18:37,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2019-08-05 10:18:37,803 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:37,803 INFO L399 BasicCegarLoop]: trace histogram [300, 30, 30, 1, 1, 1] [2019-08-05 10:18:37,803 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:37,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:37,804 INFO L82 PathProgramCache]: Analyzing trace with hash 421958899, now seen corresponding path program 39 times [2019-08-05 10:18:37,804 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:38,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:38,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 1094 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-05 10:18:38,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:38,825 INFO L134 CoverageAnalysis]: Checked inductivity of 54750 backedges. 0 proven. 53100 refuted. 0 times theorem prover too weak. 1650 trivial. 0 not checked. [2019-08-05 10:18:38,825 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:38,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:18:38,825 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 10:18:38,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 10:18:38,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:18:38,826 INFO L87 Difference]: Start difference. First operand 364 states and 394 transitions. Second operand 33 states. [2019-08-05 10:18:40,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:40,246 INFO L93 Difference]: Finished difference Result 387 states and 419 transitions. [2019-08-05 10:18:40,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 10:18:40,246 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 363 [2019-08-05 10:18:40,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:40,249 INFO L225 Difference]: With dead ends: 387 [2019-08-05 10:18:40,249 INFO L226 Difference]: Without dead ends: 387 [2019-08-05 10:18:40,250 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 331 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:18:40,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2019-08-05 10:18:40,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 376. [2019-08-05 10:18:40,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2019-08-05 10:18:40,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 407 transitions. [2019-08-05 10:18:40,255 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 407 transitions. Word has length 363 [2019-08-05 10:18:40,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:40,256 INFO L475 AbstractCegarLoop]: Abstraction has 376 states and 407 transitions. [2019-08-05 10:18:40,256 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 10:18:40,256 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 407 transitions. [2019-08-05 10:18:40,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2019-08-05 10:18:40,258 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:40,258 INFO L399 BasicCegarLoop]: trace histogram [310, 31, 31, 1, 1, 1] [2019-08-05 10:18:40,258 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:40,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:40,259 INFO L82 PathProgramCache]: Analyzing trace with hash -323284101, now seen corresponding path program 40 times [2019-08-05 10:18:40,260 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:40,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:40,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 1130 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-05 10:18:40,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:41,044 INFO L134 CoverageAnalysis]: Checked inductivity of 58466 backedges. 0 proven. 56761 refuted. 0 times theorem prover too weak. 1705 trivial. 0 not checked. [2019-08-05 10:18:41,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:41,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:18:41,045 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:18:41,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:18:41,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:18:41,046 INFO L87 Difference]: Start difference. First operand 376 states and 407 transitions. Second operand 34 states. [2019-08-05 10:18:42,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:42,527 INFO L93 Difference]: Finished difference Result 399 states and 432 transitions. [2019-08-05 10:18:42,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:18:42,528 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 375 [2019-08-05 10:18:42,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:42,530 INFO L225 Difference]: With dead ends: 399 [2019-08-05 10:18:42,530 INFO L226 Difference]: Without dead ends: 399 [2019-08-05 10:18:42,531 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:18:42,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2019-08-05 10:18:42,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 388. [2019-08-05 10:18:42,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-08-05 10:18:42,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 420 transitions. [2019-08-05 10:18:42,536 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 420 transitions. Word has length 375 [2019-08-05 10:18:42,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:42,536 INFO L475 AbstractCegarLoop]: Abstraction has 388 states and 420 transitions. [2019-08-05 10:18:42,537 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:18:42,537 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 420 transitions. [2019-08-05 10:18:42,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2019-08-05 10:18:42,539 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:42,539 INFO L399 BasicCegarLoop]: trace histogram [320, 32, 32, 1, 1, 1] [2019-08-05 10:18:42,539 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:42,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:42,540 INFO L82 PathProgramCache]: Analyzing trace with hash 891160067, now seen corresponding path program 41 times [2019-08-05 10:18:42,540 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:42,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:42,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 1166 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-05 10:18:42,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:43,919 INFO L134 CoverageAnalysis]: Checked inductivity of 62304 backedges. 0 proven. 60544 refuted. 0 times theorem prover too weak. 1760 trivial. 0 not checked. [2019-08-05 10:18:43,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:43,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 10:18:43,920 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:18:43,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:18:43,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:18:43,921 INFO L87 Difference]: Start difference. First operand 388 states and 420 transitions. Second operand 35 states. [2019-08-05 10:18:45,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:45,439 INFO L93 Difference]: Finished difference Result 411 states and 445 transitions. [2019-08-05 10:18:45,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 10:18:45,440 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 387 [2019-08-05 10:18:45,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:45,442 INFO L225 Difference]: With dead ends: 411 [2019-08-05 10:18:45,442 INFO L226 Difference]: Without dead ends: 411 [2019-08-05 10:18:45,443 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 353 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:18:45,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2019-08-05 10:18:45,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 400. [2019-08-05 10:18:45,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2019-08-05 10:18:45,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 433 transitions. [2019-08-05 10:18:45,449 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 433 transitions. Word has length 387 [2019-08-05 10:18:45,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:45,449 INFO L475 AbstractCegarLoop]: Abstraction has 400 states and 433 transitions. [2019-08-05 10:18:45,449 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:18:45,449 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 433 transitions. [2019-08-05 10:18:45,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2019-08-05 10:18:45,451 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:45,452 INFO L399 BasicCegarLoop]: trace histogram [330, 33, 33, 1, 1, 1] [2019-08-05 10:18:45,452 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:45,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:45,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1941869429, now seen corresponding path program 42 times [2019-08-05 10:18:45,453 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:45,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:45,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 1202 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-05 10:18:45,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:46,702 INFO L134 CoverageAnalysis]: Checked inductivity of 66264 backedges. 0 proven. 64449 refuted. 0 times theorem prover too weak. 1815 trivial. 0 not checked. [2019-08-05 10:18:46,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:46,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:18:46,703 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 10:18:46,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 10:18:46,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:18:46,703 INFO L87 Difference]: Start difference. First operand 400 states and 433 transitions. Second operand 36 states. [2019-08-05 10:18:48,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:48,315 INFO L93 Difference]: Finished difference Result 423 states and 458 transitions. [2019-08-05 10:18:48,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 10:18:48,315 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 399 [2019-08-05 10:18:48,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:48,318 INFO L225 Difference]: With dead ends: 423 [2019-08-05 10:18:48,318 INFO L226 Difference]: Without dead ends: 423 [2019-08-05 10:18:48,318 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 364 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:18:48,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2019-08-05 10:18:48,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 412. [2019-08-05 10:18:48,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2019-08-05 10:18:48,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 446 transitions. [2019-08-05 10:18:48,324 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 446 transitions. Word has length 399 [2019-08-05 10:18:48,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:48,324 INFO L475 AbstractCegarLoop]: Abstraction has 412 states and 446 transitions. [2019-08-05 10:18:48,324 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 10:18:48,324 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 446 transitions. [2019-08-05 10:18:48,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2019-08-05 10:18:48,326 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:48,327 INFO L399 BasicCegarLoop]: trace histogram [340, 34, 34, 1, 1, 1] [2019-08-05 10:18:48,327 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:48,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:48,327 INFO L82 PathProgramCache]: Analyzing trace with hash 823609107, now seen corresponding path program 43 times [2019-08-05 10:18:48,328 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:48,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:48,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 1238 conjuncts, 72 conjunts are in the unsatisfiable core [2019-08-05 10:18:48,670 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:50,449 INFO L134 CoverageAnalysis]: Checked inductivity of 70346 backedges. 0 proven. 68476 refuted. 0 times theorem prover too weak. 1870 trivial. 0 not checked. [2019-08-05 10:18:50,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:50,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 10:18:50,450 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 10:18:50,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 10:18:50,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:18:50,451 INFO L87 Difference]: Start difference. First operand 412 states and 446 transitions. Second operand 37 states. [2019-08-05 10:18:52,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:52,145 INFO L93 Difference]: Finished difference Result 435 states and 471 transitions. [2019-08-05 10:18:52,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 10:18:52,145 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 411 [2019-08-05 10:18:52,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:52,148 INFO L225 Difference]: With dead ends: 435 [2019-08-05 10:18:52,148 INFO L226 Difference]: Without dead ends: 435 [2019-08-05 10:18:52,148 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 375 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:18:52,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2019-08-05 10:18:52,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 424. [2019-08-05 10:18:52,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2019-08-05 10:18:52,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 459 transitions. [2019-08-05 10:18:52,154 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 459 transitions. Word has length 411 [2019-08-05 10:18:52,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:52,154 INFO L475 AbstractCegarLoop]: Abstraction has 424 states and 459 transitions. [2019-08-05 10:18:52,154 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 10:18:52,154 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 459 transitions. [2019-08-05 10:18:52,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2019-08-05 10:18:52,156 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:52,157 INFO L399 BasicCegarLoop]: trace histogram [350, 35, 35, 1, 1, 1] [2019-08-05 10:18:52,157 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:52,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:52,157 INFO L82 PathProgramCache]: Analyzing trace with hash -2020502117, now seen corresponding path program 44 times [2019-08-05 10:18:52,158 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:52,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:52,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 1274 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-05 10:18:52,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:53,299 INFO L134 CoverageAnalysis]: Checked inductivity of 74550 backedges. 0 proven. 72625 refuted. 0 times theorem prover too weak. 1925 trivial. 0 not checked. [2019-08-05 10:18:53,299 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:53,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:18:53,299 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 10:18:53,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 10:18:53,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:18:53,300 INFO L87 Difference]: Start difference. First operand 424 states and 459 transitions. Second operand 38 states. [2019-08-05 10:18:55,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:55,344 INFO L93 Difference]: Finished difference Result 447 states and 484 transitions. [2019-08-05 10:18:55,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 10:18:55,344 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 423 [2019-08-05 10:18:55,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:55,347 INFO L225 Difference]: With dead ends: 447 [2019-08-05 10:18:55,347 INFO L226 Difference]: Without dead ends: 447 [2019-08-05 10:18:55,348 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 386 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:18:55,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2019-08-05 10:18:55,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 436. [2019-08-05 10:18:55,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2019-08-05 10:18:55,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 472 transitions. [2019-08-05 10:18:55,352 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 472 transitions. Word has length 423 [2019-08-05 10:18:55,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:55,352 INFO L475 AbstractCegarLoop]: Abstraction has 436 states and 472 transitions. [2019-08-05 10:18:55,352 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 10:18:55,352 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 472 transitions. [2019-08-05 10:18:55,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2019-08-05 10:18:55,355 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:55,355 INFO L399 BasicCegarLoop]: trace histogram [360, 36, 36, 1, 1, 1] [2019-08-05 10:18:55,355 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:55,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:55,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1734191069, now seen corresponding path program 45 times [2019-08-05 10:18:55,356 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:55,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:55,617 INFO L256 TraceCheckSpWp]: Trace formula consists of 1310 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-05 10:18:55,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:56,684 INFO L134 CoverageAnalysis]: Checked inductivity of 78876 backedges. 0 proven. 76896 refuted. 0 times theorem prover too weak. 1980 trivial. 0 not checked. [2019-08-05 10:18:56,685 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:56,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 10:18:56,685 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 10:18:56,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 10:18:56,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:18:56,686 INFO L87 Difference]: Start difference. First operand 436 states and 472 transitions. Second operand 39 states. [2019-08-05 10:18:58,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:58,595 INFO L93 Difference]: Finished difference Result 459 states and 497 transitions. [2019-08-05 10:18:58,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 10:18:58,595 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 435 [2019-08-05 10:18:58,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:58,598 INFO L225 Difference]: With dead ends: 459 [2019-08-05 10:18:58,598 INFO L226 Difference]: Without dead ends: 459 [2019-08-05 10:18:58,599 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 434 GetRequests, 397 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:18:58,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2019-08-05 10:18:58,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 448. [2019-08-05 10:18:58,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2019-08-05 10:18:58,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 485 transitions. [2019-08-05 10:18:58,603 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 485 transitions. Word has length 435 [2019-08-05 10:18:58,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:58,604 INFO L475 AbstractCegarLoop]: Abstraction has 448 states and 485 transitions. [2019-08-05 10:18:58,604 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 10:18:58,604 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 485 transitions. [2019-08-05 10:18:58,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2019-08-05 10:18:58,607 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:58,607 INFO L399 BasicCegarLoop]: trace histogram [370, 37, 37, 1, 1, 1] [2019-08-05 10:18:58,607 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:58,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:58,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1841590613, now seen corresponding path program 46 times [2019-08-05 10:18:58,608 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:58,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:58,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 1346 conjuncts, 78 conjunts are in the unsatisfiable core [2019-08-05 10:18:58,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:59,675 INFO L134 CoverageAnalysis]: Checked inductivity of 83324 backedges. 0 proven. 81289 refuted. 0 times theorem prover too weak. 2035 trivial. 0 not checked. [2019-08-05 10:18:59,675 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:59,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 10:18:59,676 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 10:18:59,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 10:18:59,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:18:59,677 INFO L87 Difference]: Start difference. First operand 448 states and 485 transitions. Second operand 40 states. [2019-08-05 10:19:01,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:01,708 INFO L93 Difference]: Finished difference Result 471 states and 510 transitions. [2019-08-05 10:19:01,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 10:19:01,709 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 447 [2019-08-05 10:19:01,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:01,711 INFO L225 Difference]: With dead ends: 471 [2019-08-05 10:19:01,712 INFO L226 Difference]: Without dead ends: 471 [2019-08-05 10:19:01,713 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 446 GetRequests, 408 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:19:01,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2019-08-05 10:19:01,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 460. [2019-08-05 10:19:01,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2019-08-05 10:19:01,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 498 transitions. [2019-08-05 10:19:01,718 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 498 transitions. Word has length 447 [2019-08-05 10:19:01,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:01,718 INFO L475 AbstractCegarLoop]: Abstraction has 460 states and 498 transitions. [2019-08-05 10:19:01,718 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 10:19:01,719 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 498 transitions. [2019-08-05 10:19:01,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2019-08-05 10:19:01,721 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:01,721 INFO L399 BasicCegarLoop]: trace histogram [380, 38, 38, 1, 1, 1] [2019-08-05 10:19:01,722 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:01,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:01,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1196374323, now seen corresponding path program 47 times [2019-08-05 10:19:01,723 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:02,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:02,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 1382 conjuncts, 80 conjunts are in the unsatisfiable core [2019-08-05 10:19:02,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:02,782 INFO L134 CoverageAnalysis]: Checked inductivity of 87894 backedges. 0 proven. 85804 refuted. 0 times theorem prover too weak. 2090 trivial. 0 not checked. [2019-08-05 10:19:02,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:02,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 10:19:02,783 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 10:19:02,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 10:19:02,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:19:02,783 INFO L87 Difference]: Start difference. First operand 460 states and 498 transitions. Second operand 41 states. [2019-08-05 10:19:05,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:05,101 INFO L93 Difference]: Finished difference Result 483 states and 523 transitions. [2019-08-05 10:19:05,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 10:19:05,102 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 459 [2019-08-05 10:19:05,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:05,105 INFO L225 Difference]: With dead ends: 483 [2019-08-05 10:19:05,105 INFO L226 Difference]: Without dead ends: 483 [2019-08-05 10:19:05,106 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 419 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:19:05,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2019-08-05 10:19:05,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 472. [2019-08-05 10:19:05,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2019-08-05 10:19:05,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 511 transitions. [2019-08-05 10:19:05,110 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 511 transitions. Word has length 459 [2019-08-05 10:19:05,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:05,111 INFO L475 AbstractCegarLoop]: Abstraction has 472 states and 511 transitions. [2019-08-05 10:19:05,111 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 10:19:05,111 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 511 transitions. [2019-08-05 10:19:05,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2019-08-05 10:19:05,113 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:05,114 INFO L399 BasicCegarLoop]: trace histogram [390, 39, 39, 1, 1, 1] [2019-08-05 10:19:05,114 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:05,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:05,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1345366085, now seen corresponding path program 48 times [2019-08-05 10:19:05,115 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:05,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:05,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 1418 conjuncts, 82 conjunts are in the unsatisfiable core [2019-08-05 10:19:05,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:06,372 INFO L134 CoverageAnalysis]: Checked inductivity of 92586 backedges. 0 proven. 90441 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2019-08-05 10:19:06,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:06,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 10:19:06,372 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:19:06,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:19:06,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:19:06,373 INFO L87 Difference]: Start difference. First operand 472 states and 511 transitions. Second operand 42 states. [2019-08-05 10:19:08,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:08,570 INFO L93 Difference]: Finished difference Result 495 states and 536 transitions. [2019-08-05 10:19:08,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 10:19:08,570 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 471 [2019-08-05 10:19:08,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:08,573 INFO L225 Difference]: With dead ends: 495 [2019-08-05 10:19:08,573 INFO L226 Difference]: Without dead ends: 495 [2019-08-05 10:19:08,574 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 470 GetRequests, 430 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:19:08,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2019-08-05 10:19:08,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 484. [2019-08-05 10:19:08,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2019-08-05 10:19:08,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 524 transitions. [2019-08-05 10:19:08,580 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 524 transitions. Word has length 471 [2019-08-05 10:19:08,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:08,580 INFO L475 AbstractCegarLoop]: Abstraction has 484 states and 524 transitions. [2019-08-05 10:19:08,580 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:19:08,580 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 524 transitions. [2019-08-05 10:19:08,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2019-08-05 10:19:08,583 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:08,583 INFO L399 BasicCegarLoop]: trace histogram [400, 40, 40, 1, 1, 1] [2019-08-05 10:19:08,583 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:08,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:08,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1756228163, now seen corresponding path program 49 times [2019-08-05 10:19:08,585 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:08,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:08,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 1454 conjuncts, 84 conjunts are in the unsatisfiable core [2019-08-05 10:19:08,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:09,982 INFO L134 CoverageAnalysis]: Checked inductivity of 97400 backedges. 0 proven. 95200 refuted. 0 times theorem prover too weak. 2200 trivial. 0 not checked. [2019-08-05 10:19:09,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:09,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 10:19:09,983 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 10:19:09,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 10:19:09,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:19:09,984 INFO L87 Difference]: Start difference. First operand 484 states and 524 transitions. Second operand 43 states. [2019-08-05 10:19:12,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:12,387 INFO L93 Difference]: Finished difference Result 507 states and 549 transitions. [2019-08-05 10:19:12,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 10:19:12,388 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 483 [2019-08-05 10:19:12,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:12,390 INFO L225 Difference]: With dead ends: 507 [2019-08-05 10:19:12,390 INFO L226 Difference]: Without dead ends: 507 [2019-08-05 10:19:12,391 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 482 GetRequests, 441 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:19:12,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2019-08-05 10:19:12,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 496. [2019-08-05 10:19:12,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 496 states. [2019-08-05 10:19:12,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 537 transitions. [2019-08-05 10:19:12,396 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 537 transitions. Word has length 483 [2019-08-05 10:19:12,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:12,397 INFO L475 AbstractCegarLoop]: Abstraction has 496 states and 537 transitions. [2019-08-05 10:19:12,397 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 10:19:12,397 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 537 transitions. [2019-08-05 10:19:12,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 496 [2019-08-05 10:19:12,400 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:12,400 INFO L399 BasicCegarLoop]: trace histogram [410, 41, 41, 1, 1, 1] [2019-08-05 10:19:12,400 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:12,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:12,401 INFO L82 PathProgramCache]: Analyzing trace with hash 870117579, now seen corresponding path program 50 times [2019-08-05 10:19:12,401 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:12,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:12,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 1490 conjuncts, 86 conjunts are in the unsatisfiable core [2019-08-05 10:19:12,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:13,788 INFO L134 CoverageAnalysis]: Checked inductivity of 102336 backedges. 0 proven. 100081 refuted. 0 times theorem prover too weak. 2255 trivial. 0 not checked. [2019-08-05 10:19:13,788 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:13,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 10:19:13,789 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 10:19:13,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 10:19:13,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:19:13,789 INFO L87 Difference]: Start difference. First operand 496 states and 537 transitions. Second operand 44 states. [2019-08-05 10:19:16,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:16,463 INFO L93 Difference]: Finished difference Result 519 states and 562 transitions. [2019-08-05 10:19:16,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:19:16,464 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 495 [2019-08-05 10:19:16,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:16,467 INFO L225 Difference]: With dead ends: 519 [2019-08-05 10:19:16,467 INFO L226 Difference]: Without dead ends: 519 [2019-08-05 10:19:16,468 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 494 GetRequests, 452 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:19:16,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2019-08-05 10:19:16,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 508. [2019-08-05 10:19:16,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2019-08-05 10:19:16,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 550 transitions. [2019-08-05 10:19:16,472 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 550 transitions. Word has length 495 [2019-08-05 10:19:16,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:16,473 INFO L475 AbstractCegarLoop]: Abstraction has 508 states and 550 transitions. [2019-08-05 10:19:16,473 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 10:19:16,473 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 550 transitions. [2019-08-05 10:19:16,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 508 [2019-08-05 10:19:16,476 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:16,476 INFO L399 BasicCegarLoop]: trace histogram [420, 42, 42, 1, 1, 1] [2019-08-05 10:19:16,476 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:16,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:16,477 INFO L82 PathProgramCache]: Analyzing trace with hash 2018405203, now seen corresponding path program 51 times [2019-08-05 10:19:16,477 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:16,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:16,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 1526 conjuncts, 88 conjunts are in the unsatisfiable core [2019-08-05 10:19:16,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:17,763 INFO L134 CoverageAnalysis]: Checked inductivity of 107394 backedges. 0 proven. 105084 refuted. 0 times theorem prover too weak. 2310 trivial. 0 not checked. [2019-08-05 10:19:17,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:17,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 10:19:17,764 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 10:19:17,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 10:19:17,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:19:17,764 INFO L87 Difference]: Start difference. First operand 508 states and 550 transitions. Second operand 45 states. [2019-08-05 10:19:20,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:20,476 INFO L93 Difference]: Finished difference Result 531 states and 575 transitions. [2019-08-05 10:19:20,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 10:19:20,476 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 507 [2019-08-05 10:19:20,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:20,479 INFO L225 Difference]: With dead ends: 531 [2019-08-05 10:19:20,479 INFO L226 Difference]: Without dead ends: 531 [2019-08-05 10:19:20,480 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 506 GetRequests, 463 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:19:20,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2019-08-05 10:19:20,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 520. [2019-08-05 10:19:20,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2019-08-05 10:19:20,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 563 transitions. [2019-08-05 10:19:20,484 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 563 transitions. Word has length 507 [2019-08-05 10:19:20,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:20,485 INFO L475 AbstractCegarLoop]: Abstraction has 520 states and 563 transitions. [2019-08-05 10:19:20,485 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 10:19:20,485 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 563 transitions. [2019-08-05 10:19:20,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 520 [2019-08-05 10:19:20,487 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:20,487 INFO L399 BasicCegarLoop]: trace histogram [430, 43, 43, 1, 1, 1] [2019-08-05 10:19:20,487 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:20,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:20,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1040950821, now seen corresponding path program 52 times [2019-08-05 10:19:20,488 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:20,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:20,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 1562 conjuncts, 90 conjunts are in the unsatisfiable core [2019-08-05 10:19:20,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:21,982 INFO L134 CoverageAnalysis]: Checked inductivity of 112574 backedges. 0 proven. 110209 refuted. 0 times theorem prover too weak. 2365 trivial. 0 not checked. [2019-08-05 10:19:21,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:21,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 10:19:21,983 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:19:21,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:19:21,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:19:21,984 INFO L87 Difference]: Start difference. First operand 520 states and 563 transitions. Second operand 46 states. [2019-08-05 10:19:24,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:24,829 INFO L93 Difference]: Finished difference Result 543 states and 588 transitions. [2019-08-05 10:19:24,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 10:19:24,830 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 519 [2019-08-05 10:19:24,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:24,833 INFO L225 Difference]: With dead ends: 543 [2019-08-05 10:19:24,833 INFO L226 Difference]: Without dead ends: 543 [2019-08-05 10:19:24,834 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 518 GetRequests, 474 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:19:24,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2019-08-05 10:19:24,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 532. [2019-08-05 10:19:24,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 532 states. [2019-08-05 10:19:24,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 576 transitions. [2019-08-05 10:19:24,838 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 576 transitions. Word has length 519 [2019-08-05 10:19:24,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:24,838 INFO L475 AbstractCegarLoop]: Abstraction has 532 states and 576 transitions. [2019-08-05 10:19:24,838 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:19:24,839 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 576 transitions. [2019-08-05 10:19:24,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2019-08-05 10:19:24,841 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:24,841 INFO L399 BasicCegarLoop]: trace histogram [440, 44, 44, 1, 1, 1] [2019-08-05 10:19:24,842 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:24,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:24,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1103150179, now seen corresponding path program 53 times [2019-08-05 10:19:24,843 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:25,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:25,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 1598 conjuncts, 92 conjunts are in the unsatisfiable core [2019-08-05 10:19:25,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:26,301 INFO L134 CoverageAnalysis]: Checked inductivity of 117876 backedges. 0 proven. 115456 refuted. 0 times theorem prover too weak. 2420 trivial. 0 not checked. [2019-08-05 10:19:26,301 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:26,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 10:19:26,302 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 10:19:26,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 10:19:26,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:19:26,302 INFO L87 Difference]: Start difference. First operand 532 states and 576 transitions. Second operand 47 states. [2019-08-05 10:19:29,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:29,109 INFO L93 Difference]: Finished difference Result 555 states and 601 transitions. [2019-08-05 10:19:29,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 10:19:29,109 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 531 [2019-08-05 10:19:29,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:29,112 INFO L225 Difference]: With dead ends: 555 [2019-08-05 10:19:29,113 INFO L226 Difference]: Without dead ends: 555 [2019-08-05 10:19:29,113 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 530 GetRequests, 485 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:19:29,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2019-08-05 10:19:29,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 544. [2019-08-05 10:19:29,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2019-08-05 10:19:29,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 589 transitions. [2019-08-05 10:19:29,117 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 589 transitions. Word has length 531 [2019-08-05 10:19:29,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:29,118 INFO L475 AbstractCegarLoop]: Abstraction has 544 states and 589 transitions. [2019-08-05 10:19:29,118 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 10:19:29,118 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 589 transitions. [2019-08-05 10:19:29,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 544 [2019-08-05 10:19:29,120 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:29,120 INFO L399 BasicCegarLoop]: trace histogram [450, 45, 45, 1, 1, 1] [2019-08-05 10:19:29,120 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:29,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:29,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1302696683, now seen corresponding path program 54 times [2019-08-05 10:19:29,121 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:29,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:29,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 1634 conjuncts, 94 conjunts are in the unsatisfiable core [2019-08-05 10:19:29,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:30,570 INFO L134 CoverageAnalysis]: Checked inductivity of 123300 backedges. 0 proven. 120825 refuted. 0 times theorem prover too weak. 2475 trivial. 0 not checked. [2019-08-05 10:19:30,570 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:30,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 10:19:30,571 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 10:19:30,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 10:19:30,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:19:30,571 INFO L87 Difference]: Start difference. First operand 544 states and 589 transitions. Second operand 48 states. [2019-08-05 10:19:33,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:33,523 INFO L93 Difference]: Finished difference Result 567 states and 614 transitions. [2019-08-05 10:19:33,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 10:19:33,525 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 543 [2019-08-05 10:19:33,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:33,528 INFO L225 Difference]: With dead ends: 567 [2019-08-05 10:19:33,528 INFO L226 Difference]: Without dead ends: 567 [2019-08-05 10:19:33,529 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 542 GetRequests, 496 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:19:33,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2019-08-05 10:19:33,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 556. [2019-08-05 10:19:33,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 556 states. [2019-08-05 10:19:33,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 602 transitions. [2019-08-05 10:19:33,533 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 602 transitions. Word has length 543 [2019-08-05 10:19:33,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:33,533 INFO L475 AbstractCegarLoop]: Abstraction has 556 states and 602 transitions. [2019-08-05 10:19:33,533 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 10:19:33,533 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 602 transitions. [2019-08-05 10:19:33,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 556 [2019-08-05 10:19:33,535 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:33,536 INFO L399 BasicCegarLoop]: trace histogram [460, 46, 46, 1, 1, 1] [2019-08-05 10:19:33,536 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:33,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:33,536 INFO L82 PathProgramCache]: Analyzing trace with hash -527114893, now seen corresponding path program 55 times [2019-08-05 10:19:33,537 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:33,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:33,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 1670 conjuncts, 96 conjunts are in the unsatisfiable core [2019-08-05 10:19:33,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:35,259 INFO L134 CoverageAnalysis]: Checked inductivity of 128846 backedges. 0 proven. 126316 refuted. 0 times theorem prover too weak. 2530 trivial. 0 not checked. [2019-08-05 10:19:35,260 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:35,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 10:19:35,260 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 10:19:35,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 10:19:35,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:19:35,261 INFO L87 Difference]: Start difference. First operand 556 states and 602 transitions. Second operand 49 states. [2019-08-05 10:19:38,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:38,278 INFO L93 Difference]: Finished difference Result 579 states and 627 transitions. [2019-08-05 10:19:38,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 10:19:38,279 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 555 [2019-08-05 10:19:38,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:38,282 INFO L225 Difference]: With dead ends: 579 [2019-08-05 10:19:38,282 INFO L226 Difference]: Without dead ends: 579 [2019-08-05 10:19:38,283 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 554 GetRequests, 507 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:19:38,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2019-08-05 10:19:38,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 568. [2019-08-05 10:19:38,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2019-08-05 10:19:38,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 615 transitions. [2019-08-05 10:19:38,287 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 615 transitions. Word has length 555 [2019-08-05 10:19:38,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:38,287 INFO L475 AbstractCegarLoop]: Abstraction has 568 states and 615 transitions. [2019-08-05 10:19:38,287 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 10:19:38,287 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 615 transitions. [2019-08-05 10:19:38,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 568 [2019-08-05 10:19:38,289 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:38,290 INFO L399 BasicCegarLoop]: trace histogram [470, 47, 47, 1, 1, 1] [2019-08-05 10:19:38,290 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:38,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:38,290 INFO L82 PathProgramCache]: Analyzing trace with hash 444636155, now seen corresponding path program 56 times [2019-08-05 10:19:38,291 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:38,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:38,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 1706 conjuncts, 98 conjunts are in the unsatisfiable core [2019-08-05 10:19:38,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:40,109 INFO L134 CoverageAnalysis]: Checked inductivity of 134514 backedges. 0 proven. 131929 refuted. 0 times theorem prover too weak. 2585 trivial. 0 not checked. [2019-08-05 10:19:40,109 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:40,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 10:19:40,110 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 10:19:40,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 10:19:40,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:19:40,111 INFO L87 Difference]: Start difference. First operand 568 states and 615 transitions. Second operand 50 states. [2019-08-05 10:19:43,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:43,261 INFO L93 Difference]: Finished difference Result 591 states and 640 transitions. [2019-08-05 10:19:43,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 10:19:43,262 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 567 [2019-08-05 10:19:43,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:43,264 INFO L225 Difference]: With dead ends: 591 [2019-08-05 10:19:43,264 INFO L226 Difference]: Without dead ends: 591 [2019-08-05 10:19:43,265 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 566 GetRequests, 518 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:19:43,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2019-08-05 10:19:43,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 580. [2019-08-05 10:19:43,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2019-08-05 10:19:43,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 628 transitions. [2019-08-05 10:19:43,269 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 628 transitions. Word has length 567 [2019-08-05 10:19:43,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:43,269 INFO L475 AbstractCegarLoop]: Abstraction has 580 states and 628 transitions. [2019-08-05 10:19:43,269 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 10:19:43,269 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 628 transitions. [2019-08-05 10:19:43,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 580 [2019-08-05 10:19:43,272 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:43,272 INFO L399 BasicCegarLoop]: trace histogram [480, 48, 48, 1, 1, 1] [2019-08-05 10:19:43,272 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:43,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:43,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1067790717, now seen corresponding path program 57 times [2019-08-05 10:19:43,274 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:43,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:43,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 1742 conjuncts, 100 conjunts are in the unsatisfiable core [2019-08-05 10:19:43,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:45,050 INFO L134 CoverageAnalysis]: Checked inductivity of 140304 backedges. 0 proven. 137664 refuted. 0 times theorem prover too weak. 2640 trivial. 0 not checked. [2019-08-05 10:19:45,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:45,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 10:19:45,051 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 10:19:45,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 10:19:45,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:19:45,051 INFO L87 Difference]: Start difference. First operand 580 states and 628 transitions. Second operand 51 states. [2019-08-05 10:19:48,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:48,377 INFO L93 Difference]: Finished difference Result 603 states and 653 transitions. [2019-08-05 10:19:48,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 10:19:48,377 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 579 [2019-08-05 10:19:48,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:48,380 INFO L225 Difference]: With dead ends: 603 [2019-08-05 10:19:48,380 INFO L226 Difference]: Without dead ends: 603 [2019-08-05 10:19:48,381 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 578 GetRequests, 529 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:19:48,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2019-08-05 10:19:48,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 592. [2019-08-05 10:19:48,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-08-05 10:19:48,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 641 transitions. [2019-08-05 10:19:48,385 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 641 transitions. Word has length 579 [2019-08-05 10:19:48,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:48,385 INFO L475 AbstractCegarLoop]: Abstraction has 592 states and 641 transitions. [2019-08-05 10:19:48,385 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 10:19:48,385 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 641 transitions. [2019-08-05 10:19:48,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 592 [2019-08-05 10:19:48,388 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:48,388 INFO L399 BasicCegarLoop]: trace histogram [490, 49, 49, 1, 1, 1] [2019-08-05 10:19:48,388 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:48,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:48,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1139444469, now seen corresponding path program 58 times [2019-08-05 10:19:48,389 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:48,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:48,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 1778 conjuncts, 102 conjunts are in the unsatisfiable core [2019-08-05 10:19:48,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:50,082 INFO L134 CoverageAnalysis]: Checked inductivity of 146216 backedges. 0 proven. 143521 refuted. 0 times theorem prover too weak. 2695 trivial. 0 not checked. [2019-08-05 10:19:50,082 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:50,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 10:19:50,083 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 10:19:50,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 10:19:50,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:19:50,083 INFO L87 Difference]: Start difference. First operand 592 states and 641 transitions. Second operand 52 states. [2019-08-05 10:19:53,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:53,549 INFO L93 Difference]: Finished difference Result 615 states and 666 transitions. [2019-08-05 10:19:53,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 10:19:53,550 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 591 [2019-08-05 10:19:53,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:53,554 INFO L225 Difference]: With dead ends: 615 [2019-08-05 10:19:53,554 INFO L226 Difference]: Without dead ends: 615 [2019-08-05 10:19:53,554 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 590 GetRequests, 540 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:19:53,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2019-08-05 10:19:53,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 604. [2019-08-05 10:19:53,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-08-05 10:19:53,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 654 transitions. [2019-08-05 10:19:53,560 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 654 transitions. Word has length 591 [2019-08-05 10:19:53,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:53,560 INFO L475 AbstractCegarLoop]: Abstraction has 604 states and 654 transitions. [2019-08-05 10:19:53,560 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 10:19:53,560 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 654 transitions. [2019-08-05 10:19:53,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 604 [2019-08-05 10:19:53,563 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:53,563 INFO L399 BasicCegarLoop]: trace histogram [500, 50, 50, 1, 1, 1] [2019-08-05 10:19:53,563 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:53,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:53,564 INFO L82 PathProgramCache]: Analyzing trace with hash -1667068013, now seen corresponding path program 59 times [2019-08-05 10:19:53,564 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:54,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:54,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 1814 conjuncts, 104 conjunts are in the unsatisfiable core [2019-08-05 10:19:54,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:55,618 INFO L134 CoverageAnalysis]: Checked inductivity of 152250 backedges. 0 proven. 149500 refuted. 0 times theorem prover too weak. 2750 trivial. 0 not checked. [2019-08-05 10:19:55,618 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:55,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 10:19:55,619 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 10:19:55,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 10:19:55,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:19:55,620 INFO L87 Difference]: Start difference. First operand 604 states and 654 transitions. Second operand 53 states. [2019-08-05 10:19:59,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:59,153 INFO L93 Difference]: Finished difference Result 627 states and 679 transitions. [2019-08-05 10:19:59,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 10:19:59,154 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 603 [2019-08-05 10:19:59,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:59,157 INFO L225 Difference]: With dead ends: 627 [2019-08-05 10:19:59,157 INFO L226 Difference]: Without dead ends: 627 [2019-08-05 10:19:59,157 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 602 GetRequests, 551 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:19:59,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2019-08-05 10:19:59,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 616. [2019-08-05 10:19:59,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 616 states. [2019-08-05 10:19:59,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 667 transitions. [2019-08-05 10:19:59,162 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 667 transitions. Word has length 603 [2019-08-05 10:19:59,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:59,162 INFO L475 AbstractCegarLoop]: Abstraction has 616 states and 667 transitions. [2019-08-05 10:19:59,162 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 10:19:59,162 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 667 transitions. [2019-08-05 10:19:59,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 616 [2019-08-05 10:19:59,165 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:59,165 INFO L399 BasicCegarLoop]: trace histogram [510, 51, 51, 1, 1, 1] [2019-08-05 10:19:59,165 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:59,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:59,166 INFO L82 PathProgramCache]: Analyzing trace with hash 368320027, now seen corresponding path program 60 times [2019-08-05 10:19:59,166 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:59,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:59,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 1850 conjuncts, 106 conjunts are in the unsatisfiable core [2019-08-05 10:19:59,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:01,130 INFO L134 CoverageAnalysis]: Checked inductivity of 158406 backedges. 0 proven. 155601 refuted. 0 times theorem prover too weak. 2805 trivial. 0 not checked. [2019-08-05 10:20:01,131 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:01,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 10:20:01,131 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 10:20:01,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 10:20:01,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:20:01,132 INFO L87 Difference]: Start difference. First operand 616 states and 667 transitions. Second operand 54 states. [2019-08-05 10:20:04,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:04,904 INFO L93 Difference]: Finished difference Result 639 states and 692 transitions. [2019-08-05 10:20:04,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 10:20:04,904 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 615 [2019-08-05 10:20:04,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:04,908 INFO L225 Difference]: With dead ends: 639 [2019-08-05 10:20:04,908 INFO L226 Difference]: Without dead ends: 639 [2019-08-05 10:20:04,908 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 614 GetRequests, 562 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:20:04,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2019-08-05 10:20:04,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 628. [2019-08-05 10:20:04,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 628 states. [2019-08-05 10:20:04,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 680 transitions. [2019-08-05 10:20:04,914 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 680 transitions. Word has length 615 [2019-08-05 10:20:04,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:04,915 INFO L475 AbstractCegarLoop]: Abstraction has 628 states and 680 transitions. [2019-08-05 10:20:04,915 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 10:20:04,915 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 680 transitions. [2019-08-05 10:20:04,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 628 [2019-08-05 10:20:04,917 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:04,918 INFO L399 BasicCegarLoop]: trace histogram [520, 52, 52, 1, 1, 1] [2019-08-05 10:20:04,918 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:04,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:04,918 INFO L82 PathProgramCache]: Analyzing trace with hash -2130960221, now seen corresponding path program 61 times [2019-08-05 10:20:04,919 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:05,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:05,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 1886 conjuncts, 108 conjunts are in the unsatisfiable core [2019-08-05 10:20:05,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:06,724 INFO L134 CoverageAnalysis]: Checked inductivity of 164684 backedges. 0 proven. 161824 refuted. 0 times theorem prover too weak. 2860 trivial. 0 not checked. [2019-08-05 10:20:06,725 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:06,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 10:20:06,726 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 10:20:06,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 10:20:06,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:20:06,727 INFO L87 Difference]: Start difference. First operand 628 states and 680 transitions. Second operand 55 states. [2019-08-05 10:20:10,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:10,837 INFO L93 Difference]: Finished difference Result 651 states and 705 transitions. [2019-08-05 10:20:10,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 10:20:10,837 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 627 [2019-08-05 10:20:10,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:10,841 INFO L225 Difference]: With dead ends: 651 [2019-08-05 10:20:10,841 INFO L226 Difference]: Without dead ends: 651 [2019-08-05 10:20:10,841 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 626 GetRequests, 573 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:20:10,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2019-08-05 10:20:10,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 640. [2019-08-05 10:20:10,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2019-08-05 10:20:10,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 693 transitions. [2019-08-05 10:20:10,848 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 693 transitions. Word has length 627 [2019-08-05 10:20:10,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:10,848 INFO L475 AbstractCegarLoop]: Abstraction has 640 states and 693 transitions. [2019-08-05 10:20:10,848 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 10:20:10,848 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 693 transitions. [2019-08-05 10:20:10,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 640 [2019-08-05 10:20:10,851 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:10,851 INFO L399 BasicCegarLoop]: trace histogram [530, 53, 53, 1, 1, 1] [2019-08-05 10:20:10,852 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:10,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:10,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1538037547, now seen corresponding path program 62 times [2019-08-05 10:20:10,853 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:11,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:11,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 1922 conjuncts, 110 conjunts are in the unsatisfiable core [2019-08-05 10:20:11,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:12,794 INFO L134 CoverageAnalysis]: Checked inductivity of 171084 backedges. 0 proven. 168169 refuted. 0 times theorem prover too weak. 2915 trivial. 0 not checked. [2019-08-05 10:20:12,794 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:12,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 10:20:12,795 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 10:20:12,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 10:20:12,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:20:12,796 INFO L87 Difference]: Start difference. First operand 640 states and 693 transitions. Second operand 56 states. [2019-08-05 10:20:16,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:16,952 INFO L93 Difference]: Finished difference Result 663 states and 718 transitions. [2019-08-05 10:20:16,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 10:20:16,952 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 639 [2019-08-05 10:20:16,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:16,955 INFO L225 Difference]: With dead ends: 663 [2019-08-05 10:20:16,955 INFO L226 Difference]: Without dead ends: 663 [2019-08-05 10:20:16,956 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 638 GetRequests, 584 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:20:16,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2019-08-05 10:20:16,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 652. [2019-08-05 10:20:16,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 652 states. [2019-08-05 10:20:16,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 706 transitions. [2019-08-05 10:20:16,963 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 706 transitions. Word has length 639 [2019-08-05 10:20:16,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:16,963 INFO L475 AbstractCegarLoop]: Abstraction has 652 states and 706 transitions. [2019-08-05 10:20:16,963 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 10:20:16,976 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 706 transitions. [2019-08-05 10:20:16,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 652 [2019-08-05 10:20:16,979 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:16,979 INFO L399 BasicCegarLoop]: trace histogram [540, 54, 54, 1, 1, 1] [2019-08-05 10:20:16,980 INFO L418 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:16,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:16,980 INFO L82 PathProgramCache]: Analyzing trace with hash -923303501, now seen corresponding path program 63 times [2019-08-05 10:20:16,981 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:17,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:17,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 1958 conjuncts, 112 conjunts are in the unsatisfiable core [2019-08-05 10:20:17,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:18,906 INFO L134 CoverageAnalysis]: Checked inductivity of 177606 backedges. 0 proven. 174636 refuted. 0 times theorem prover too weak. 2970 trivial. 0 not checked. [2019-08-05 10:20:18,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:18,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 10:20:18,907 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 10:20:18,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 10:20:18,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:20:18,908 INFO L87 Difference]: Start difference. First operand 652 states and 706 transitions. Second operand 57 states. [2019-08-05 10:20:23,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:23,105 INFO L93 Difference]: Finished difference Result 675 states and 731 transitions. [2019-08-05 10:20:23,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 10:20:23,105 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 651 [2019-08-05 10:20:23,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:23,109 INFO L225 Difference]: With dead ends: 675 [2019-08-05 10:20:23,109 INFO L226 Difference]: Without dead ends: 675 [2019-08-05 10:20:23,109 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 650 GetRequests, 595 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:20:23,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2019-08-05 10:20:23,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 664. [2019-08-05 10:20:23,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 664 states. [2019-08-05 10:20:23,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 719 transitions. [2019-08-05 10:20:23,114 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 719 transitions. Word has length 651 [2019-08-05 10:20:23,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:23,115 INFO L475 AbstractCegarLoop]: Abstraction has 664 states and 719 transitions. [2019-08-05 10:20:23,115 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 10:20:23,115 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 719 transitions. [2019-08-05 10:20:23,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 664 [2019-08-05 10:20:23,118 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:23,118 INFO L399 BasicCegarLoop]: trace histogram [550, 55, 55, 1, 1, 1] [2019-08-05 10:20:23,119 INFO L418 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:23,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:23,119 INFO L82 PathProgramCache]: Analyzing trace with hash 281993275, now seen corresponding path program 64 times [2019-08-05 10:20:23,120 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:23,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:23,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 1994 conjuncts, 114 conjunts are in the unsatisfiable core [2019-08-05 10:20:23,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:25,154 INFO L134 CoverageAnalysis]: Checked inductivity of 184250 backedges. 0 proven. 181225 refuted. 0 times theorem prover too weak. 3025 trivial. 0 not checked. [2019-08-05 10:20:25,154 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:25,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 10:20:25,154 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 10:20:25,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 10:20:25,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:20:25,155 INFO L87 Difference]: Start difference. First operand 664 states and 719 transitions. Second operand 58 states. [2019-08-05 10:20:29,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:29,581 INFO L93 Difference]: Finished difference Result 687 states and 744 transitions. [2019-08-05 10:20:29,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 10:20:29,581 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 663 [2019-08-05 10:20:29,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:29,584 INFO L225 Difference]: With dead ends: 687 [2019-08-05 10:20:29,585 INFO L226 Difference]: Without dead ends: 687 [2019-08-05 10:20:29,585 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 662 GetRequests, 606 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:20:29,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2019-08-05 10:20:29,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 676. [2019-08-05 10:20:29,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 676 states. [2019-08-05 10:20:29,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 732 transitions. [2019-08-05 10:20:29,590 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 732 transitions. Word has length 663 [2019-08-05 10:20:29,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:29,590 INFO L475 AbstractCegarLoop]: Abstraction has 676 states and 732 transitions. [2019-08-05 10:20:29,590 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 10:20:29,591 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 732 transitions. [2019-08-05 10:20:29,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 676 [2019-08-05 10:20:29,593 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:29,594 INFO L399 BasicCegarLoop]: trace histogram [560, 56, 56, 1, 1, 1] [2019-08-05 10:20:29,594 INFO L418 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:29,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:29,594 INFO L82 PathProgramCache]: Analyzing trace with hash 539275971, now seen corresponding path program 65 times [2019-08-05 10:20:29,595 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:30,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:30,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 2030 conjuncts, 116 conjunts are in the unsatisfiable core [2019-08-05 10:20:30,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:31,995 INFO L134 CoverageAnalysis]: Checked inductivity of 191016 backedges. 0 proven. 187936 refuted. 0 times theorem prover too weak. 3080 trivial. 0 not checked. [2019-08-05 10:20:31,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:31,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 10:20:31,996 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 10:20:31,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 10:20:31,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:20:31,996 INFO L87 Difference]: Start difference. First operand 676 states and 732 transitions. Second operand 59 states. [2019-08-05 10:20:36,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:36,707 INFO L93 Difference]: Finished difference Result 699 states and 757 transitions. [2019-08-05 10:20:36,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 10:20:36,707 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 675 [2019-08-05 10:20:36,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:36,711 INFO L225 Difference]: With dead ends: 699 [2019-08-05 10:20:36,711 INFO L226 Difference]: Without dead ends: 699 [2019-08-05 10:20:36,711 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 674 GetRequests, 617 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:20:36,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2019-08-05 10:20:36,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 688. [2019-08-05 10:20:36,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 688 states. [2019-08-05 10:20:36,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 745 transitions. [2019-08-05 10:20:36,716 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 745 transitions. Word has length 675 [2019-08-05 10:20:36,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:36,716 INFO L475 AbstractCegarLoop]: Abstraction has 688 states and 745 transitions. [2019-08-05 10:20:36,716 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 10:20:36,716 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 745 transitions. [2019-08-05 10:20:36,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 688 [2019-08-05 10:20:36,719 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:36,719 INFO L399 BasicCegarLoop]: trace histogram [570, 57, 57, 1, 1, 1] [2019-08-05 10:20:36,720 INFO L418 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:36,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:36,720 INFO L82 PathProgramCache]: Analyzing trace with hash 149616971, now seen corresponding path program 66 times [2019-08-05 10:20:36,720 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:37,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:37,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 2066 conjuncts, 118 conjunts are in the unsatisfiable core [2019-08-05 10:20:37,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:38,956 INFO L134 CoverageAnalysis]: Checked inductivity of 197904 backedges. 0 proven. 194769 refuted. 0 times theorem prover too weak. 3135 trivial. 0 not checked. [2019-08-05 10:20:38,956 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:38,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 10:20:38,957 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 10:20:38,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 10:20:38,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:20:38,958 INFO L87 Difference]: Start difference. First operand 688 states and 745 transitions. Second operand 60 states. [2019-08-05 10:20:43,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:43,727 INFO L93 Difference]: Finished difference Result 711 states and 770 transitions. [2019-08-05 10:20:43,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 10:20:43,727 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 687 [2019-08-05 10:20:43,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:43,731 INFO L225 Difference]: With dead ends: 711 [2019-08-05 10:20:43,731 INFO L226 Difference]: Without dead ends: 711 [2019-08-05 10:20:43,731 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 686 GetRequests, 628 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:20:43,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2019-08-05 10:20:43,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 700. [2019-08-05 10:20:43,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 700 states. [2019-08-05 10:20:43,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 758 transitions. [2019-08-05 10:20:43,736 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 758 transitions. Word has length 687 [2019-08-05 10:20:43,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:43,737 INFO L475 AbstractCegarLoop]: Abstraction has 700 states and 758 transitions. [2019-08-05 10:20:43,737 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 10:20:43,737 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 758 transitions. [2019-08-05 10:20:43,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 700 [2019-08-05 10:20:43,740 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:43,740 INFO L399 BasicCegarLoop]: trace histogram [580, 58, 58, 1, 1, 1] [2019-08-05 10:20:43,741 INFO L418 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:43,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:43,741 INFO L82 PathProgramCache]: Analyzing trace with hash -2112637997, now seen corresponding path program 67 times [2019-08-05 10:20:43,741 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:44,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:44,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 2102 conjuncts, 120 conjunts are in the unsatisfiable core [2019-08-05 10:20:44,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:46,046 INFO L134 CoverageAnalysis]: Checked inductivity of 204914 backedges. 0 proven. 201724 refuted. 0 times theorem prover too weak. 3190 trivial. 0 not checked. [2019-08-05 10:20:46,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:46,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-05 10:20:46,047 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-05 10:20:46,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-05 10:20:46,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:20:46,048 INFO L87 Difference]: Start difference. First operand 700 states and 758 transitions. Second operand 61 states. [2019-08-05 10:20:51,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:51,044 INFO L93 Difference]: Finished difference Result 723 states and 783 transitions. [2019-08-05 10:20:51,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 10:20:51,045 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 699 [2019-08-05 10:20:51,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:51,048 INFO L225 Difference]: With dead ends: 723 [2019-08-05 10:20:51,049 INFO L226 Difference]: Without dead ends: 723 [2019-08-05 10:20:51,049 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 698 GetRequests, 639 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:20:51,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2019-08-05 10:20:51,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 712. [2019-08-05 10:20:51,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 712 states. [2019-08-05 10:20:51,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 771 transitions. [2019-08-05 10:20:51,054 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 771 transitions. Word has length 699 [2019-08-05 10:20:51,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:51,054 INFO L475 AbstractCegarLoop]: Abstraction has 712 states and 771 transitions. [2019-08-05 10:20:51,054 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-05 10:20:51,054 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 771 transitions. [2019-08-05 10:20:51,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 712 [2019-08-05 10:20:51,057 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:51,057 INFO L399 BasicCegarLoop]: trace histogram [590, 59, 59, 1, 1, 1] [2019-08-05 10:20:51,058 INFO L418 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:51,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:51,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1737548379, now seen corresponding path program 68 times [2019-08-05 10:20:51,058 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:51,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:51,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 2138 conjuncts, 122 conjunts are in the unsatisfiable core [2019-08-05 10:20:51,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:53,398 INFO L134 CoverageAnalysis]: Checked inductivity of 212046 backedges. 0 proven. 208801 refuted. 0 times theorem prover too weak. 3245 trivial. 0 not checked. [2019-08-05 10:20:53,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:53,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-05 10:20:53,399 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-05 10:20:53,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-05 10:20:53,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:20:53,399 INFO L87 Difference]: Start difference. First operand 712 states and 771 transitions. Second operand 62 states. [2019-08-05 10:20:58,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:58,442 INFO L93 Difference]: Finished difference Result 735 states and 796 transitions. [2019-08-05 10:20:58,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 10:20:58,443 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 711 [2019-08-05 10:20:58,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:58,446 INFO L225 Difference]: With dead ends: 735 [2019-08-05 10:20:58,446 INFO L226 Difference]: Without dead ends: 735 [2019-08-05 10:20:58,447 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 710 GetRequests, 650 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:20:58,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2019-08-05 10:20:58,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 724. [2019-08-05 10:20:58,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 724 states. [2019-08-05 10:20:58,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 784 transitions. [2019-08-05 10:20:58,453 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 784 transitions. Word has length 711 [2019-08-05 10:20:58,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:58,453 INFO L475 AbstractCegarLoop]: Abstraction has 724 states and 784 transitions. [2019-08-05 10:20:58,453 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-05 10:20:58,453 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 784 transitions. [2019-08-05 10:20:58,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 724 [2019-08-05 10:20:58,456 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:58,457 INFO L399 BasicCegarLoop]: trace histogram [600, 60, 60, 1, 1, 1] [2019-08-05 10:20:58,457 INFO L418 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:58,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:58,457 INFO L82 PathProgramCache]: Analyzing trace with hash 978617571, now seen corresponding path program 69 times [2019-08-05 10:20:58,458 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:59,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:59,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 2174 conjuncts, 124 conjunts are in the unsatisfiable core [2019-08-05 10:20:59,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:00,872 INFO L134 CoverageAnalysis]: Checked inductivity of 219300 backedges. 0 proven. 216000 refuted. 0 times theorem prover too weak. 3300 trivial. 0 not checked. [2019-08-05 10:21:00,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:00,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-05 10:21:00,873 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-05 10:21:00,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-05 10:21:00,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:21:00,873 INFO L87 Difference]: Start difference. First operand 724 states and 784 transitions. Second operand 63 states. [2019-08-05 10:21:06,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:06,111 INFO L93 Difference]: Finished difference Result 747 states and 809 transitions. [2019-08-05 10:21:06,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 10:21:06,112 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 723 [2019-08-05 10:21:06,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:06,115 INFO L225 Difference]: With dead ends: 747 [2019-08-05 10:21:06,115 INFO L226 Difference]: Without dead ends: 747 [2019-08-05 10:21:06,116 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 722 GetRequests, 661 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:21:06,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2019-08-05 10:21:06,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 736. [2019-08-05 10:21:06,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2019-08-05 10:21:06,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 797 transitions. [2019-08-05 10:21:06,121 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 797 transitions. Word has length 723 [2019-08-05 10:21:06,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:06,121 INFO L475 AbstractCegarLoop]: Abstraction has 736 states and 797 transitions. [2019-08-05 10:21:06,121 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-05 10:21:06,121 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 797 transitions. [2019-08-05 10:21:06,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 736 [2019-08-05 10:21:06,124 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:06,125 INFO L399 BasicCegarLoop]: trace histogram [610, 61, 61, 1, 1, 1] [2019-08-05 10:21:06,125 INFO L418 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:06,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:06,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1605330069, now seen corresponding path program 70 times [2019-08-05 10:21:06,126 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:06,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:06,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 2210 conjuncts, 126 conjunts are in the unsatisfiable core [2019-08-05 10:21:06,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:08,746 INFO L134 CoverageAnalysis]: Checked inductivity of 226676 backedges. 0 proven. 223321 refuted. 0 times theorem prover too weak. 3355 trivial. 0 not checked. [2019-08-05 10:21:08,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:08,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-05 10:21:08,747 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-05 10:21:08,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-05 10:21:08,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:21:08,747 INFO L87 Difference]: Start difference. First operand 736 states and 797 transitions. Second operand 64 states. [2019-08-05 10:21:14,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:14,158 INFO L93 Difference]: Finished difference Result 759 states and 822 transitions. [2019-08-05 10:21:14,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-05 10:21:14,158 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 735 [2019-08-05 10:21:14,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:14,162 INFO L225 Difference]: With dead ends: 759 [2019-08-05 10:21:14,162 INFO L226 Difference]: Without dead ends: 759 [2019-08-05 10:21:14,162 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 734 GetRequests, 672 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:21:14,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2019-08-05 10:21:14,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 748. [2019-08-05 10:21:14,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 748 states. [2019-08-05 10:21:14,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 810 transitions. [2019-08-05 10:21:14,168 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 810 transitions. Word has length 735 [2019-08-05 10:21:14,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:14,168 INFO L475 AbstractCegarLoop]: Abstraction has 748 states and 810 transitions. [2019-08-05 10:21:14,168 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-05 10:21:14,168 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 810 transitions. [2019-08-05 10:21:14,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 748 [2019-08-05 10:21:14,172 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:14,172 INFO L399 BasicCegarLoop]: trace histogram [620, 62, 62, 1, 1, 1] [2019-08-05 10:21:14,172 INFO L418 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:14,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:14,173 INFO L82 PathProgramCache]: Analyzing trace with hash -461953549, now seen corresponding path program 71 times [2019-08-05 10:21:14,173 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:14,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:14,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 2246 conjuncts, 128 conjunts are in the unsatisfiable core [2019-08-05 10:21:14,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:16,751 INFO L134 CoverageAnalysis]: Checked inductivity of 234174 backedges. 0 proven. 230764 refuted. 0 times theorem prover too weak. 3410 trivial. 0 not checked. [2019-08-05 10:21:16,752 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:16,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-05 10:21:16,752 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-05 10:21:16,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-05 10:21:16,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:21:16,753 INFO L87 Difference]: Start difference. First operand 748 states and 810 transitions. Second operand 65 states. [2019-08-05 10:21:22,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:22,528 INFO L93 Difference]: Finished difference Result 771 states and 835 transitions. [2019-08-05 10:21:22,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-05 10:21:22,528 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 747 [2019-08-05 10:21:22,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:22,532 INFO L225 Difference]: With dead ends: 771 [2019-08-05 10:21:22,532 INFO L226 Difference]: Without dead ends: 771 [2019-08-05 10:21:22,532 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 746 GetRequests, 683 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:21:22,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2019-08-05 10:21:22,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 760. [2019-08-05 10:21:22,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 760 states. [2019-08-05 10:21:22,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 823 transitions. [2019-08-05 10:21:22,537 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 823 transitions. Word has length 747 [2019-08-05 10:21:22,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:22,538 INFO L475 AbstractCegarLoop]: Abstraction has 760 states and 823 transitions. [2019-08-05 10:21:22,538 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-05 10:21:22,538 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 823 transitions. [2019-08-05 10:21:22,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 760 [2019-08-05 10:21:22,542 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:22,542 INFO L399 BasicCegarLoop]: trace histogram [630, 63, 63, 1, 1, 1] [2019-08-05 10:21:22,542 INFO L418 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:22,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:22,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1991910523, now seen corresponding path program 72 times [2019-08-05 10:21:22,543 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:23,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:23,269 INFO L256 TraceCheckSpWp]: Trace formula consists of 2282 conjuncts, 130 conjunts are in the unsatisfiable core [2019-08-05 10:21:23,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:25,144 INFO L134 CoverageAnalysis]: Checked inductivity of 241794 backedges. 0 proven. 238329 refuted. 0 times theorem prover too weak. 3465 trivial. 0 not checked. [2019-08-05 10:21:25,145 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:25,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-05 10:21:25,146 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-05 10:21:25,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-05 10:21:25,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:21:25,146 INFO L87 Difference]: Start difference. First operand 760 states and 823 transitions. Second operand 66 states. [2019-08-05 10:21:30,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:30,881 INFO L93 Difference]: Finished difference Result 783 states and 848 transitions. [2019-08-05 10:21:30,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 10:21:30,882 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 759 [2019-08-05 10:21:30,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:30,886 INFO L225 Difference]: With dead ends: 783 [2019-08-05 10:21:30,886 INFO L226 Difference]: Without dead ends: 783 [2019-08-05 10:21:30,886 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 758 GetRequests, 694 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:21:30,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2019-08-05 10:21:30,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 772. [2019-08-05 10:21:30,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 772 states. [2019-08-05 10:21:30,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 836 transitions. [2019-08-05 10:21:30,891 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 836 transitions. Word has length 759 [2019-08-05 10:21:30,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:30,892 INFO L475 AbstractCegarLoop]: Abstraction has 772 states and 836 transitions. [2019-08-05 10:21:30,892 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-05 10:21:30,892 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 836 transitions. [2019-08-05 10:21:30,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 772 [2019-08-05 10:21:30,896 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:30,896 INFO L399 BasicCegarLoop]: trace histogram [640, 64, 64, 1, 1, 1] [2019-08-05 10:21:30,896 INFO L418 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:30,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:30,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1812698883, now seen corresponding path program 73 times [2019-08-05 10:21:30,897 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:31,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:31,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 2318 conjuncts, 132 conjunts are in the unsatisfiable core [2019-08-05 10:21:31,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:34,031 INFO L134 CoverageAnalysis]: Checked inductivity of 249536 backedges. 0 proven. 246016 refuted. 0 times theorem prover too weak. 3520 trivial. 0 not checked. [2019-08-05 10:21:34,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:34,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-05 10:21:34,032 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-05 10:21:34,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-05 10:21:34,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:21:34,032 INFO L87 Difference]: Start difference. First operand 772 states and 836 transitions. Second operand 67 states. [2019-08-05 10:21:39,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:39,940 INFO L93 Difference]: Finished difference Result 795 states and 861 transitions. [2019-08-05 10:21:39,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 10:21:39,940 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 771 [2019-08-05 10:21:39,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:39,944 INFO L225 Difference]: With dead ends: 795 [2019-08-05 10:21:39,944 INFO L226 Difference]: Without dead ends: 795 [2019-08-05 10:21:39,945 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 770 GetRequests, 705 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:21:39,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2019-08-05 10:21:39,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 784. [2019-08-05 10:21:39,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2019-08-05 10:21:39,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 849 transitions. [2019-08-05 10:21:39,950 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 849 transitions. Word has length 771 [2019-08-05 10:21:39,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:39,951 INFO L475 AbstractCegarLoop]: Abstraction has 784 states and 849 transitions. [2019-08-05 10:21:39,951 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-05 10:21:39,951 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 849 transitions. [2019-08-05 10:21:39,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 784 [2019-08-05 10:21:39,955 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:39,955 INFO L399 BasicCegarLoop]: trace histogram [650, 65, 65, 1, 1, 1] [2019-08-05 10:21:39,955 INFO L418 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:39,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:39,956 INFO L82 PathProgramCache]: Analyzing trace with hash -27427445, now seen corresponding path program 74 times [2019-08-05 10:21:39,956 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:40,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:40,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 2354 conjuncts, 134 conjunts are in the unsatisfiable core [2019-08-05 10:21:40,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:42,742 INFO L134 CoverageAnalysis]: Checked inductivity of 257400 backedges. 0 proven. 253825 refuted. 0 times theorem prover too weak. 3575 trivial. 0 not checked. [2019-08-05 10:21:42,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:42,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-05 10:21:42,743 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-05 10:21:42,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-05 10:21:42,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:21:42,744 INFO L87 Difference]: Start difference. First operand 784 states and 849 transitions. Second operand 68 states. [2019-08-05 10:21:49,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:49,186 INFO L93 Difference]: Finished difference Result 807 states and 874 transitions. [2019-08-05 10:21:49,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-05 10:21:49,186 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 783 [2019-08-05 10:21:49,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:49,190 INFO L225 Difference]: With dead ends: 807 [2019-08-05 10:21:49,191 INFO L226 Difference]: Without dead ends: 807 [2019-08-05 10:21:49,191 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 782 GetRequests, 716 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:21:49,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2019-08-05 10:21:49,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 796. [2019-08-05 10:21:49,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2019-08-05 10:21:49,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 862 transitions. [2019-08-05 10:21:49,197 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 862 transitions. Word has length 783 [2019-08-05 10:21:49,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:49,197 INFO L475 AbstractCegarLoop]: Abstraction has 796 states and 862 transitions. [2019-08-05 10:21:49,197 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-05 10:21:49,197 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 862 transitions. [2019-08-05 10:21:49,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 796 [2019-08-05 10:21:49,201 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:49,201 INFO L399 BasicCegarLoop]: trace histogram [660, 66, 66, 1, 1, 1] [2019-08-05 10:21:49,202 INFO L418 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:49,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:49,202 INFO L82 PathProgramCache]: Analyzing trace with hash 211933203, now seen corresponding path program 75 times [2019-08-05 10:21:49,203 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:49,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:50,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 2390 conjuncts, 136 conjunts are in the unsatisfiable core [2019-08-05 10:21:50,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:52,139 INFO L134 CoverageAnalysis]: Checked inductivity of 265386 backedges. 0 proven. 261756 refuted. 0 times theorem prover too weak. 3630 trivial. 0 not checked. [2019-08-05 10:21:52,139 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:52,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-05 10:21:52,140 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-05 10:21:52,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-05 10:21:52,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:21:52,140 INFO L87 Difference]: Start difference. First operand 796 states and 862 transitions. Second operand 69 states. [2019-08-05 10:21:58,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:58,835 INFO L93 Difference]: Finished difference Result 819 states and 887 transitions. [2019-08-05 10:21:58,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-05 10:21:58,835 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 795 [2019-08-05 10:21:58,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:58,840 INFO L225 Difference]: With dead ends: 819 [2019-08-05 10:21:58,840 INFO L226 Difference]: Without dead ends: 819 [2019-08-05 10:21:58,840 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 794 GetRequests, 727 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:21:58,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2019-08-05 10:21:58,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 808. [2019-08-05 10:21:58,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 808 states. [2019-08-05 10:21:58,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 875 transitions. [2019-08-05 10:21:58,846 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 875 transitions. Word has length 795 [2019-08-05 10:21:58,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:58,846 INFO L475 AbstractCegarLoop]: Abstraction has 808 states and 875 transitions. [2019-08-05 10:21:58,846 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-05 10:21:58,846 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 875 transitions. [2019-08-05 10:21:58,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 808 [2019-08-05 10:21:58,850 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:58,850 INFO L399 BasicCegarLoop]: trace histogram [670, 67, 67, 1, 1, 1] [2019-08-05 10:21:58,851 INFO L418 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:58,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:58,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1697995109, now seen corresponding path program 76 times [2019-08-05 10:21:58,851 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:59,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:59,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 2426 conjuncts, 138 conjunts are in the unsatisfiable core [2019-08-05 10:21:59,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:01,909 INFO L134 CoverageAnalysis]: Checked inductivity of 273494 backedges. 0 proven. 269809 refuted. 0 times theorem prover too weak. 3685 trivial. 0 not checked. [2019-08-05 10:22:01,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:01,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-05 10:22:01,910 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-05 10:22:01,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-05 10:22:01,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:22:01,910 INFO L87 Difference]: Start difference. First operand 808 states and 875 transitions. Second operand 70 states. Received shutdown request... [2019-08-05 10:22:04,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:22:04,494 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 10:22:04,501 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 10:22:04,501 INFO L202 PluginConnector]: Adding new model nested1.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:22:04 BoogieIcfgContainer [2019-08-05 10:22:04,501 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:22:04,504 INFO L168 Benchmark]: Toolchain (without parser) took 246772.71 ms. Allocated memory was 140.0 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 109.6 MB in the beginning and 833.8 MB in the end (delta: -724.2 MB). Peak memory consumption was 489.5 MB. Max. memory is 7.1 GB. [2019-08-05 10:22:04,504 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.15 ms. Allocated memory is still 140.0 MB. Free memory was 110.8 MB in the beginning and 110.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-08-05 10:22:04,505 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.16 ms. Allocated memory is still 140.0 MB. Free memory was 109.4 MB in the beginning and 107.9 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB. [2019-08-05 10:22:04,506 INFO L168 Benchmark]: Boogie Preprocessor took 23.96 ms. Allocated memory is still 140.0 MB. Free memory was 107.9 MB in the beginning and 106.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:22:04,506 INFO L168 Benchmark]: RCFGBuilder took 291.51 ms. Allocated memory is still 140.0 MB. Free memory was 106.6 MB in the beginning and 97.0 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2019-08-05 10:22:04,507 INFO L168 Benchmark]: TraceAbstraction took 246416.03 ms. Allocated memory was 140.0 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 96.8 MB in the beginning and 833.8 MB in the end (delta: -737.0 MB). Peak memory consumption was 476.7 MB. Max. memory is 7.1 GB. [2019-08-05 10:22:04,510 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.15 ms. Allocated memory is still 140.0 MB. Free memory was 110.8 MB in the beginning and 110.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 37.16 ms. Allocated memory is still 140.0 MB. Free memory was 109.4 MB in the beginning and 107.9 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.96 ms. Allocated memory is still 140.0 MB. Free memory was 107.9 MB in the beginning and 106.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 291.51 ms. Allocated memory is still 140.0 MB. Free memory was 106.6 MB in the beginning and 97.0 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 246416.03 ms. Allocated memory was 140.0 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 96.8 MB in the beginning and 833.8 MB in the end (delta: -737.0 MB). Peak memory consumption was 476.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 34]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 34). Cancelled while BasicCegarLoop was constructing difference of abstraction (808states) and FLOYD_HOARE automaton (currently 28 states, 70 states before enhancement),while ReachableStatesComputation was computing reachable states (301 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. TIMEOUT Result, 246.3s OverallTime, 78 OverallIterations, 670 TraceHistogramMax, 153.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2555 SDtfs, 134 SDslu, 104296 SDs, 0 SdLazy, 213584 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 126.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 27557 GetRequests, 25156 SyntacticMatches, 0 SemanticMatches, 2401 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 59.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=808occurred in iteration=77, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 77 MinimizatonAttempts, 727 StatesRemovedByMinimization, 67 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 20.3s SatisfiabilityAnalysisTime, 71.0s InterpolantComputationTime, 27635 NumberOfCodeBlocks, 27635 NumberOfCodeBlocksAsserted, 78 NumberOfCheckSat, 27557 ConstructedInterpolants, 0 QuantifiedInterpolants, 44560129 SizeOfPredicates, 146 NumberOfNonLiveVariables, 83295 ConjunctsInSsa, 4948 ConjunctsInUnsatCore, 78 InterpolantComputations, 2 PerfectInterpolantSequences, 125300/6241895 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown