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/20181015-LoopsPathprograms/nested_true-unreach-call1.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:26:41,731 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:26:41,733 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:26:41,745 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:26:41,745 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:26:41,746 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:26:41,748 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:26:41,750 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:26:41,751 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:26:41,752 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:26:41,753 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:26:41,754 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:26:41,754 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:26:41,755 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:26:41,756 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:26:41,759 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:26:41,760 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:26:41,763 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:26:41,765 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:26:41,770 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:26:41,775 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:26:41,779 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:26:41,780 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:26:41,782 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:26:41,786 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:26:41,787 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:26:41,788 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:26:41,789 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:26:41,789 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:26:41,790 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:26:41,793 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:26:41,794 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:26:41,795 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:26:41,795 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:26:41,799 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:26:41,799 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:26:41,800 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:26:41,800 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:26:41,801 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:26:41,802 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:26:41,803 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:26:41,850 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:26:41,862 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:26:41,866 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:26:41,867 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:26:41,868 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:26:41,869 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/nested_true-unreach-call1.i_4.bpl [2019-08-05 10:26:41,869 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/nested_true-unreach-call1.i_4.bpl' [2019-08-05 10:26:41,911 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:26:41,913 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:26:41,913 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:26:41,914 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:26:41,914 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:26:41,930 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "nested_true-unreach-call1.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:26:41" (1/1) ... [2019-08-05 10:26:41,939 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "nested_true-unreach-call1.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:26:41" (1/1) ... [2019-08-05 10:26:41,948 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:26:41,949 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:26:41,949 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:26:41,949 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:26:41,959 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "nested_true-unreach-call1.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:26:41" (1/1) ... [2019-08-05 10:26:41,960 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "nested_true-unreach-call1.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:26:41" (1/1) ... [2019-08-05 10:26:41,964 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "nested_true-unreach-call1.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:26:41" (1/1) ... [2019-08-05 10:26:41,965 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "nested_true-unreach-call1.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:26:41" (1/1) ... [2019-08-05 10:26:41,975 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "nested_true-unreach-call1.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:26:41" (1/1) ... [2019-08-05 10:26:41,977 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "nested_true-unreach-call1.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:26:41" (1/1) ... [2019-08-05 10:26:41,979 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "nested_true-unreach-call1.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:26:41" (1/1) ... [2019-08-05 10:26:41,980 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:26:41,981 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:26:41,981 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:26:41,981 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:26:41,982 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "nested_true-unreach-call1.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:26:41" (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:26:42,050 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-08-05 10:26:42,051 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 10:26:42,051 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 10:26:42,330 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2019-08-05 10:26:42,332 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 10:26:42,332 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 10:26:42,334 INFO L202 PluginConnector]: Adding new model nested_true-unreach-call1.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:26:42 BoogieIcfgContainer [2019-08-05 10:26:42,334 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:26:42,336 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:26:42,336 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:26:42,339 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:26:42,339 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "nested_true-unreach-call1.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:26:41" (1/2) ... [2019-08-05 10:26:42,341 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50c7c453 and model type nested_true-unreach-call1.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:26:42, skipping insertion in model container [2019-08-05 10:26:42,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "nested_true-unreach-call1.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:26:42" (2/2) ... [2019-08-05 10:26:42,343 INFO L109 eAbstractionObserver]: Analyzing ICFG nested_true-unreach-call1.i_4.bpl [2019-08-05 10:26:42,351 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:26:42,359 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:26:42,375 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:26:42,398 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:26:42,399 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:26:42,399 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:26:42,399 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:26:42,400 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:26:42,400 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:26:42,400 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:26:42,400 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:26:42,400 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:26:42,414 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-05 10:26:42,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 10:26:42,423 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:42,424 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 10:26:42,426 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:42,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:42,432 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2019-08-05 10:26:42,474 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:42,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:42,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:26:42,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:42,575 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:26:42,579 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:26:42,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:26:42,583 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:26:42,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:26:42,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:26:42,598 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-05 10:26:42,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:42,676 INFO L93 Difference]: Finished difference Result 7 states and 9 transitions. [2019-08-05 10:26:42,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:26:42,679 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 10:26:42,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:42,704 INFO L225 Difference]: With dead ends: 7 [2019-08-05 10:26:42,705 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 10:26:42,708 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:26:42,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 10:26:42,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2019-08-05 10:26:42,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 10:26:42,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2019-08-05 10:26:42,760 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 7 transitions. Word has length 3 [2019-08-05 10:26:42,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:42,761 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 7 transitions. [2019-08-05 10:26:42,762 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:26:42,762 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 7 transitions. [2019-08-05 10:26:42,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:26:42,762 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:42,763 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-05 10:26:42,763 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:42,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:42,764 INFO L82 PathProgramCache]: Analyzing trace with hash 28852267, now seen corresponding path program 1 times [2019-08-05 10:26:42,765 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:42,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:42,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:26:42,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:42,867 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:26:42,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:26:42,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:26:42,869 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:26:42,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:26:42,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:26:42,870 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. Second operand 3 states. [2019-08-05 10:26:42,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:42,938 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. [2019-08-05 10:26:42,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:26:42,940 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-08-05 10:26:42,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:42,940 INFO L225 Difference]: With dead ends: 7 [2019-08-05 10:26:42,940 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 10:26:42,942 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:26:42,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 10:26:42,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 10:26:42,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:26:42,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-08-05 10:26:42,946 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 5 [2019-08-05 10:26:42,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:42,947 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-08-05 10:26:42,947 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:26:42,952 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-08-05 10:26:42,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:26:42,953 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:42,953 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-05 10:26:42,954 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:42,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:42,954 INFO L82 PathProgramCache]: Analyzing trace with hash 894489354, now seen corresponding path program 1 times [2019-08-05 10:26:42,956 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:42,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:43,000 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:26:43,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:43,140 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:26:43,140 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:43,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:26:43,143 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:26:43,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:26:43,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:26:43,145 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 4 states. [2019-08-05 10:26:43,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:43,198 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2019-08-05 10:26:43,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:26:43,199 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-08-05 10:26:43,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:43,200 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:26:43,200 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:26:43,200 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:26:43,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:26:43,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 10:26:43,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:26:43,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2019-08-05 10:26:43,203 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 6 [2019-08-05 10:26:43,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:43,203 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2019-08-05 10:26:43,203 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:26:43,204 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2019-08-05 10:26:43,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:26:43,204 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:43,204 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-08-05 10:26:43,205 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:43,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:43,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1959435275, now seen corresponding path program 2 times [2019-08-05 10:26:43,206 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:43,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:43,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:26:43,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:43,335 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:26:43,336 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:43,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:26:43,337 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:26:43,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:26:43,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:26:43,338 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand 5 states. [2019-08-05 10:26:43,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:43,406 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-08-05 10:26:43,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:26:43,407 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-08-05 10:26:43,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:43,408 INFO L225 Difference]: With dead ends: 9 [2019-08-05 10:26:43,408 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 10:26:43,409 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:26:43,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 10:26:43,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 10:26:43,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:26:43,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-08-05 10:26:43,411 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 7 [2019-08-05 10:26:43,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:43,422 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-08-05 10:26:43,423 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:26:43,423 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2019-08-05 10:26:43,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:26:43,423 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:43,424 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1] [2019-08-05 10:26:43,424 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:43,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:43,424 INFO L82 PathProgramCache]: Analyzing trace with hash 613020458, now seen corresponding path program 3 times [2019-08-05 10:26:43,425 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:43,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:43,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:26:43,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:43,536 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:26:43,537 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:43,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:26:43,538 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:26:43,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:26:43,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:26:43,539 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 6 states. [2019-08-05 10:26:43,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:43,696 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2019-08-05 10:26:43,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:26:43,699 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2019-08-05 10:26:43,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:43,699 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:26:43,699 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:26:43,700 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:26:43,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:26:43,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 10:26:43,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:26:43,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2019-08-05 10:26:43,703 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 8 [2019-08-05 10:26:43,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:43,703 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2019-08-05 10:26:43,703 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:26:43,703 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2019-08-05 10:26:43,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:26:43,703 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:43,704 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1] [2019-08-05 10:26:43,704 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:43,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:43,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1823834091, now seen corresponding path program 4 times [2019-08-05 10:26:43,705 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:43,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:43,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:26:43,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:43,955 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:26:43,956 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:43,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:26:43,956 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:26:43,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:26:43,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:26:43,957 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand 7 states. [2019-08-05 10:26:44,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:44,035 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2019-08-05 10:26:44,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:26:44,036 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2019-08-05 10:26:44,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:44,037 INFO L225 Difference]: With dead ends: 11 [2019-08-05 10:26:44,037 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 10:26:44,038 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:26:44,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 10:26:44,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 10:26:44,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:26:44,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2019-08-05 10:26:44,041 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 9 [2019-08-05 10:26:44,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:44,043 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-08-05 10:26:44,043 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:26:44,043 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2019-08-05 10:26:44,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:26:44,043 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:44,044 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1] [2019-08-05 10:26:44,044 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:44,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:44,044 INFO L82 PathProgramCache]: Analyzing trace with hash 704351050, now seen corresponding path program 5 times [2019-08-05 10:26:44,045 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:44,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:44,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:26:44,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:44,204 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:26:44,205 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:44,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:26:44,205 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:26:44,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:26:44,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:26:44,207 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 8 states. [2019-08-05 10:26:44,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:44,401 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2019-08-05 10:26:44,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:26:44,403 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2019-08-05 10:26:44,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:44,404 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:26:44,404 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:26:44,404 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:26:44,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:26:44,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 10:26:44,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:26:44,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2019-08-05 10:26:44,407 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 10 [2019-08-05 10:26:44,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:44,408 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-08-05 10:26:44,408 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:26:44,408 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2019-08-05 10:26:44,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:26:44,409 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:44,409 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1] [2019-08-05 10:26:44,409 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:44,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:44,409 INFO L82 PathProgramCache]: Analyzing trace with hash 360115147, now seen corresponding path program 6 times [2019-08-05 10:26:44,410 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:44,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:44,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 10:26:44,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:44,693 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:26:44,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:44,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:26:44,694 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:26:44,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:26:44,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:26:44,696 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand 9 states. [2019-08-05 10:26:44,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:44,806 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2019-08-05 10:26:44,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:26:44,808 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 11 [2019-08-05 10:26:44,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:44,809 INFO L225 Difference]: With dead ends: 13 [2019-08-05 10:26:44,809 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 10:26:44,809 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:26:44,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 10:26:44,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 10:26:44,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:26:44,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-08-05 10:26:44,812 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2019-08-05 10:26:44,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:44,812 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-08-05 10:26:44,813 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:26:44,813 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-08-05 10:26:44,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:26:44,813 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:44,813 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1] [2019-08-05 10:26:44,814 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:44,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:44,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1721263254, now seen corresponding path program 7 times [2019-08-05 10:26:44,815 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:44,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:44,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:26:44,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:45,060 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:26:45,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:45,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:26:45,061 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:26:45,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:26:45,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:26:45,062 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 10 states. [2019-08-05 10:26:45,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:45,421 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2019-08-05 10:26:45,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:26:45,421 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 12 [2019-08-05 10:26:45,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:45,422 INFO L225 Difference]: With dead ends: 14 [2019-08-05 10:26:45,422 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 10:26:45,423 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:26:45,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 10:26:45,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 10:26:45,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 10:26:45,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-08-05 10:26:45,426 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 12 [2019-08-05 10:26:45,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:45,426 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-08-05 10:26:45,427 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:26:45,427 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-08-05 10:26:45,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:26:45,427 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:45,427 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1] [2019-08-05 10:26:45,428 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:45,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:45,428 INFO L82 PathProgramCache]: Analyzing trace with hash -1819484245, now seen corresponding path program 8 times [2019-08-05 10:26:45,429 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:45,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:45,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 10:26:45,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:45,652 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:26:45,652 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:45,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:26:45,653 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:26:45,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:26:45,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:26:45,654 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 11 states. [2019-08-05 10:26:45,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:45,786 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2019-08-05 10:26:45,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:26:45,787 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 13 [2019-08-05 10:26:45,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:45,788 INFO L225 Difference]: With dead ends: 15 [2019-08-05 10:26:45,788 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 10:26:45,789 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:26:45,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 10:26:45,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 10:26:45,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 10:26:45,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-08-05 10:26:45,792 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 13 [2019-08-05 10:26:45,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:45,792 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-08-05 10:26:45,792 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:26:45,792 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2019-08-05 10:26:45,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:26:45,793 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:45,793 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1] [2019-08-05 10:26:45,793 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:45,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:45,793 INFO L82 PathProgramCache]: Analyzing trace with hash -569367670, now seen corresponding path program 9 times [2019-08-05 10:26:45,794 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:45,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:45,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 10:26:45,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:46,038 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:26:46,039 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:46,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:26:46,040 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:26:46,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:26:46,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:26:46,041 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 12 states. [2019-08-05 10:26:46,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:46,207 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2019-08-05 10:26:46,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:26:46,208 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 14 [2019-08-05 10:26:46,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:46,209 INFO L225 Difference]: With dead ends: 16 [2019-08-05 10:26:46,209 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 10:26:46,210 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:26:46,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 10:26:46,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 10:26:46,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 10:26:46,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2019-08-05 10:26:46,212 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 14 [2019-08-05 10:26:46,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:46,212 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2019-08-05 10:26:46,212 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:26:46,212 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2019-08-05 10:26:46,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:26:46,213 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:46,213 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1] [2019-08-05 10:26:46,213 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:46,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:46,214 INFO L82 PathProgramCache]: Analyzing trace with hash -470459509, now seen corresponding path program 10 times [2019-08-05 10:26:46,214 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:46,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:46,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:26:46,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:46,308 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:26:46,308 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:46,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:26:46,309 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:26:46,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:26:46,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:26:46,309 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 4 states. [2019-08-05 10:26:46,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:46,349 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2019-08-05 10:26:46,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:26:46,350 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-08-05 10:26:46,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:46,351 INFO L225 Difference]: With dead ends: 39 [2019-08-05 10:26:46,351 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 10:26:46,351 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:26:46,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 10:26:46,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 28. [2019-08-05 10:26:46,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:26:46,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2019-08-05 10:26:46,355 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 15 [2019-08-05 10:26:46,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:46,355 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2019-08-05 10:26:46,355 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:26:46,356 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2019-08-05 10:26:46,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:26:46,356 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:46,357 INFO L399 BasicCegarLoop]: trace histogram [20, 2, 2, 1, 1, 1] [2019-08-05 10:26:46,357 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:46,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:46,357 INFO L82 PathProgramCache]: Analyzing trace with hash -413354477, now seen corresponding path program 11 times [2019-08-05 10:26:46,358 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:46,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:46,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:26:46,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:46,453 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:26:46,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:46,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:26:46,454 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:26:46,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:26:46,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:26:46,454 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 5 states. [2019-08-05 10:26:46,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:46,488 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2019-08-05 10:26:46,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:26:46,489 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-08-05 10:26:46,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:46,490 INFO L225 Difference]: With dead ends: 51 [2019-08-05 10:26:46,490 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:26:46,491 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 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:26:46,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:26:46,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 40. [2019-08-05 10:26:46,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:26:46,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2019-08-05 10:26:46,495 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 27 [2019-08-05 10:26:46,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:46,495 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2019-08-05 10:26:46,496 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:26:46,496 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2019-08-05 10:26:46,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 10:26:46,497 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:46,497 INFO L399 BasicCegarLoop]: trace histogram [30, 3, 3, 1, 1, 1] [2019-08-05 10:26:46,497 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:46,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:46,498 INFO L82 PathProgramCache]: Analyzing trace with hash -836205413, now seen corresponding path program 12 times [2019-08-05 10:26:46,498 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:46,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:46,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:26:46,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:46,661 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:26:46,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:46,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:26:46,662 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:26:46,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:26:46,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:26:46,663 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 6 states. [2019-08-05 10:26:46,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:46,746 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2019-08-05 10:26:46,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:26:46,747 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2019-08-05 10:26:46,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:46,749 INFO L225 Difference]: With dead ends: 63 [2019-08-05 10:26:46,750 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:26:46,750 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:26:46,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:26:46,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 52. [2019-08-05 10:26:46,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:26:46,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2019-08-05 10:26:46,757 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 39 [2019-08-05 10:26:46,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:46,757 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2019-08-05 10:26:46,757 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:26:46,757 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2019-08-05 10:26:46,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 10:26:46,759 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:46,759 INFO L399 BasicCegarLoop]: trace histogram [40, 4, 4, 1, 1, 1] [2019-08-05 10:26:46,759 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:46,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:46,760 INFO L82 PathProgramCache]: Analyzing trace with hash 21677859, now seen corresponding path program 13 times [2019-08-05 10:26:46,760 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:46,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:46,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:26:46,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:47,012 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:26:47,012 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:47,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:26:47,013 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:26:47,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:26:47,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:26:47,013 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 7 states. [2019-08-05 10:26:47,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:47,127 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2019-08-05 10:26:47,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:26:47,134 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-08-05 10:26:47,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:47,135 INFO L225 Difference]: With dead ends: 75 [2019-08-05 10:26:47,135 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 10:26:47,136 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:26:47,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 10:26:47,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 64. [2019-08-05 10:26:47,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-05 10:26:47,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 69 transitions. [2019-08-05 10:26:47,143 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 69 transitions. Word has length 51 [2019-08-05 10:26:47,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:47,144 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 69 transitions. [2019-08-05 10:26:47,144 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:26:47,144 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 69 transitions. [2019-08-05 10:26:47,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-05 10:26:47,146 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:47,146 INFO L399 BasicCegarLoop]: trace histogram [50, 5, 5, 1, 1, 1] [2019-08-05 10:26:47,146 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:47,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:47,147 INFO L82 PathProgramCache]: Analyzing trace with hash 246775211, now seen corresponding path program 14 times [2019-08-05 10:26:47,148 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:47,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:47,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:26:47,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:47,368 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:26:47,369 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:47,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:26:47,369 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:26:47,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:26:47,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:26:47,370 INFO L87 Difference]: Start difference. First operand 64 states and 69 transitions. Second operand 8 states. [2019-08-05 10:26:47,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:47,470 INFO L93 Difference]: Finished difference Result 87 states and 94 transitions. [2019-08-05 10:26:47,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:26:47,470 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2019-08-05 10:26:47,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:47,472 INFO L225 Difference]: With dead ends: 87 [2019-08-05 10:26:47,472 INFO L226 Difference]: Without dead ends: 87 [2019-08-05 10:26:47,472 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:26:47,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-08-05 10:26:47,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 76. [2019-08-05 10:26:47,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-05 10:26:47,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2019-08-05 10:26:47,479 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 63 [2019-08-05 10:26:47,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:47,479 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2019-08-05 10:26:47,479 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:26:47,480 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2019-08-05 10:26:47,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-05 10:26:47,481 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:47,481 INFO L399 BasicCegarLoop]: trace histogram [60, 6, 6, 1, 1, 1] [2019-08-05 10:26:47,482 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:47,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:47,482 INFO L82 PathProgramCache]: Analyzing trace with hash 693807155, now seen corresponding path program 15 times [2019-08-05 10:26:47,483 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:47,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:47,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 10:26:47,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:47,681 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:26:47,681 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:47,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:26:47,681 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:26:47,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:26:47,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:26:47,682 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand 9 states. [2019-08-05 10:26:47,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:47,980 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2019-08-05 10:26:47,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:26:47,980 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 75 [2019-08-05 10:26:47,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:47,982 INFO L225 Difference]: With dead ends: 99 [2019-08-05 10:26:47,982 INFO L226 Difference]: Without dead ends: 99 [2019-08-05 10:26:47,983 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 67 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:26:47,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-08-05 10:26:47,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 88. [2019-08-05 10:26:47,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-08-05 10:26:48,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2019-08-05 10:26:48,001 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 75 [2019-08-05 10:26:48,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:48,001 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2019-08-05 10:26:48,002 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:26:48,002 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2019-08-05 10:26:48,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-08-05 10:26:48,003 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:48,004 INFO L399 BasicCegarLoop]: trace histogram [70, 7, 7, 1, 1, 1] [2019-08-05 10:26:48,004 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:48,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:48,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1456716101, now seen corresponding path program 16 times [2019-08-05 10:26:48,005 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:48,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:48,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:26:48,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:48,514 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:26:48,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:48,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:26:48,514 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:26:48,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:26:48,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:26:48,515 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand 10 states. [2019-08-05 10:26:48,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:48,688 INFO L93 Difference]: Finished difference Result 111 states and 120 transitions. [2019-08-05 10:26:48,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:26:48,689 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 87 [2019-08-05 10:26:48,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:48,691 INFO L225 Difference]: With dead ends: 111 [2019-08-05 10:26:48,691 INFO L226 Difference]: Without dead ends: 111 [2019-08-05 10:26:48,691 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:26:48,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-08-05 10:26:48,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 100. [2019-08-05 10:26:48,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-08-05 10:26:48,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2019-08-05 10:26:48,698 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 87 [2019-08-05 10:26:48,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:48,698 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2019-08-05 10:26:48,699 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:26:48,699 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2019-08-05 10:26:48,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-08-05 10:26:48,700 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:48,701 INFO L399 BasicCegarLoop]: trace histogram [80, 8, 8, 1, 1, 1] [2019-08-05 10:26:48,701 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:48,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:48,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1961076413, now seen corresponding path program 17 times [2019-08-05 10:26:48,702 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:48,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:48,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 10:26:48,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:49,223 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:26:49,224 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:49,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:26:49,224 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:26:49,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:26:49,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:26:49,225 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand 11 states. [2019-08-05 10:26:49,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:49,653 INFO L93 Difference]: Finished difference Result 123 states and 133 transitions. [2019-08-05 10:26:49,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:26:49,653 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 99 [2019-08-05 10:26:49,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:49,655 INFO L225 Difference]: With dead ends: 123 [2019-08-05 10:26:49,655 INFO L226 Difference]: Without dead ends: 123 [2019-08-05 10:26:49,656 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:26:49,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-08-05 10:26:49,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 112. [2019-08-05 10:26:49,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-08-05 10:26:49,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 121 transitions. [2019-08-05 10:26:49,668 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 121 transitions. Word has length 99 [2019-08-05 10:26:49,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:49,668 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 121 transitions. [2019-08-05 10:26:49,668 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:26:49,668 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 121 transitions. [2019-08-05 10:26:49,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-08-05 10:26:49,673 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:49,673 INFO L399 BasicCegarLoop]: trace histogram [90, 9, 9, 1, 1, 1] [2019-08-05 10:26:49,674 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:49,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:49,677 INFO L82 PathProgramCache]: Analyzing trace with hash -249765941, now seen corresponding path program 18 times [2019-08-05 10:26:49,678 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:49,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:49,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:26:49,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:50,106 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:26:50,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:50,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:26:50,107 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:26:50,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:26:50,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:26:50,108 INFO L87 Difference]: Start difference. First operand 112 states and 121 transitions. Second operand 12 states. [2019-08-05 10:26:50,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:50,818 INFO L93 Difference]: Finished difference Result 135 states and 146 transitions. [2019-08-05 10:26:50,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:26:50,818 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 111 [2019-08-05 10:26:50,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:50,820 INFO L225 Difference]: With dead ends: 135 [2019-08-05 10:26:50,820 INFO L226 Difference]: Without dead ends: 135 [2019-08-05 10:26:50,821 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:26:50,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-08-05 10:26:50,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 124. [2019-08-05 10:26:50,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-08-05 10:26:50,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 134 transitions. [2019-08-05 10:26:50,826 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 134 transitions. Word has length 111 [2019-08-05 10:26:50,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:50,827 INFO L475 AbstractCegarLoop]: Abstraction has 124 states and 134 transitions. [2019-08-05 10:26:50,827 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:26:50,827 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 134 transitions. [2019-08-05 10:26:50,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-08-05 10:26:50,829 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:50,829 INFO L399 BasicCegarLoop]: trace histogram [100, 10, 10, 1, 1, 1] [2019-08-05 10:26:50,829 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:50,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:50,829 INFO L82 PathProgramCache]: Analyzing trace with hash -1574970797, now seen corresponding path program 19 times [2019-08-05 10:26:50,830 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:50,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:50,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 10:26:50,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:52,080 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:26:52,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:52,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:26:52,081 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:26:52,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:26:52,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:26:52,082 INFO L87 Difference]: Start difference. First operand 124 states and 134 transitions. Second operand 13 states. [2019-08-05 10:26:52,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:52,360 INFO L93 Difference]: Finished difference Result 147 states and 159 transitions. [2019-08-05 10:26:52,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:26:52,361 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 123 [2019-08-05 10:26:52,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:52,362 INFO L225 Difference]: With dead ends: 147 [2019-08-05 10:26:52,363 INFO L226 Difference]: Without dead ends: 147 [2019-08-05 10:26:52,363 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:26:52,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-08-05 10:26:52,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 136. [2019-08-05 10:26:52,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-08-05 10:26:52,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 147 transitions. [2019-08-05 10:26:52,368 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 147 transitions. Word has length 123 [2019-08-05 10:26:52,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:52,368 INFO L475 AbstractCegarLoop]: Abstraction has 136 states and 147 transitions. [2019-08-05 10:26:52,368 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:26:52,369 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 147 transitions. [2019-08-05 10:26:52,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-08-05 10:26:52,370 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:52,371 INFO L399 BasicCegarLoop]: trace histogram [110, 11, 11, 1, 1, 1] [2019-08-05 10:26:52,371 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:52,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:52,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1978185509, now seen corresponding path program 20 times [2019-08-05 10:26:52,372 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:52,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:52,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 10:26:52,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:53,040 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:26:53,040 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:53,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:26:53,041 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:26:53,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:26:53,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:26:53,041 INFO L87 Difference]: Start difference. First operand 136 states and 147 transitions. Second operand 14 states. [2019-08-05 10:26:53,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:53,311 INFO L93 Difference]: Finished difference Result 159 states and 172 transitions. [2019-08-05 10:26:53,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:26:53,313 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 135 [2019-08-05 10:26:53,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:53,315 INFO L225 Difference]: With dead ends: 159 [2019-08-05 10:26:53,315 INFO L226 Difference]: Without dead ends: 159 [2019-08-05 10:26:53,316 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:26:53,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-08-05 10:26:53,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 148. [2019-08-05 10:26:53,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-08-05 10:26:53,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 160 transitions. [2019-08-05 10:26:53,319 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 160 transitions. Word has length 135 [2019-08-05 10:26:53,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:53,320 INFO L475 AbstractCegarLoop]: Abstraction has 148 states and 160 transitions. [2019-08-05 10:26:53,320 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:26:53,320 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 160 transitions. [2019-08-05 10:26:53,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-08-05 10:26:53,321 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:53,321 INFO L399 BasicCegarLoop]: trace histogram [120, 12, 12, 1, 1, 1] [2019-08-05 10:26:53,322 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:53,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:53,322 INFO L82 PathProgramCache]: Analyzing trace with hash 972368739, now seen corresponding path program 21 times [2019-08-05 10:26:53,323 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:53,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:53,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 10:26:53,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:54,228 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:26:54,228 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:54,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:26:54,229 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:26:54,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:26:54,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:26:54,230 INFO L87 Difference]: Start difference. First operand 148 states and 160 transitions. Second operand 15 states. [2019-08-05 10:26:54,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:54,567 INFO L93 Difference]: Finished difference Result 171 states and 185 transitions. [2019-08-05 10:26:54,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:26:54,568 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 147 [2019-08-05 10:26:54,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:54,569 INFO L225 Difference]: With dead ends: 171 [2019-08-05 10:26:54,570 INFO L226 Difference]: Without dead ends: 171 [2019-08-05 10:26:54,570 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:26:54,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-08-05 10:26:54,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 160. [2019-08-05 10:26:54,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-08-05 10:26:54,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 173 transitions. [2019-08-05 10:26:54,575 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 173 transitions. Word has length 147 [2019-08-05 10:26:54,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:54,575 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 173 transitions. [2019-08-05 10:26:54,575 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:26:54,575 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 173 transitions. [2019-08-05 10:26:54,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-08-05 10:26:54,577 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:54,577 INFO L399 BasicCegarLoop]: trace histogram [130, 13, 13, 1, 1, 1] [2019-08-05 10:26:54,577 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:54,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:54,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1739293163, now seen corresponding path program 22 times [2019-08-05 10:26:54,578 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:54,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:54,657 INFO L256 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 10:26:54,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:54,996 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:26:54,997 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:54,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:26:54,997 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:26:54,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:26:54,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:26:54,998 INFO L87 Difference]: Start difference. First operand 160 states and 173 transitions. Second operand 16 states. [2019-08-05 10:26:55,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:55,411 INFO L93 Difference]: Finished difference Result 183 states and 198 transitions. [2019-08-05 10:26:55,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:26:55,412 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 159 [2019-08-05 10:26:55,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:55,413 INFO L225 Difference]: With dead ends: 183 [2019-08-05 10:26:55,414 INFO L226 Difference]: Without dead ends: 183 [2019-08-05 10:26:55,414 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:26:55,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-08-05 10:26:55,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 172. [2019-08-05 10:26:55,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-08-05 10:26:55,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 186 transitions. [2019-08-05 10:26:55,418 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 186 transitions. Word has length 159 [2019-08-05 10:26:55,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:55,419 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 186 transitions. [2019-08-05 10:26:55,419 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:26:55,419 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 186 transitions. [2019-08-05 10:26:55,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-08-05 10:26:55,420 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:55,420 INFO L399 BasicCegarLoop]: trace histogram [140, 14, 14, 1, 1, 1] [2019-08-05 10:26:55,421 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:55,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:55,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1848396915, now seen corresponding path program 23 times [2019-08-05 10:26:55,422 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:55,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:55,514 INFO L256 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 10:26:55,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:56,424 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:26:56,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:56,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:26:56,425 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:26:56,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:26:56,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:26:56,426 INFO L87 Difference]: Start difference. First operand 172 states and 186 transitions. Second operand 17 states. [2019-08-05 10:26:56,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:56,823 INFO L93 Difference]: Finished difference Result 195 states and 211 transitions. [2019-08-05 10:26:56,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:26:56,828 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 171 [2019-08-05 10:26:56,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:56,830 INFO L225 Difference]: With dead ends: 195 [2019-08-05 10:26:56,830 INFO L226 Difference]: Without dead ends: 195 [2019-08-05 10:26:56,832 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:26:56,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-08-05 10:26:56,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 184. [2019-08-05 10:26:56,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-08-05 10:26:56,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 199 transitions. [2019-08-05 10:26:56,837 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 199 transitions. Word has length 171 [2019-08-05 10:26:56,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:56,837 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 199 transitions. [2019-08-05 10:26:56,837 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:26:56,837 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 199 transitions. [2019-08-05 10:26:56,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-08-05 10:26:56,838 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:56,839 INFO L399 BasicCegarLoop]: trace histogram [150, 15, 15, 1, 1, 1] [2019-08-05 10:26:56,839 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:56,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:56,839 INFO L82 PathProgramCache]: Analyzing trace with hash -848721157, now seen corresponding path program 24 times [2019-08-05 10:26:56,840 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:56,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:56,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 10:26:56,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:57,613 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:26:57,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:57,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:26:57,614 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:26:57,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:26:57,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:26:57,615 INFO L87 Difference]: Start difference. First operand 184 states and 199 transitions. Second operand 18 states. [2019-08-05 10:26:58,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:58,070 INFO L93 Difference]: Finished difference Result 207 states and 224 transitions. [2019-08-05 10:26:58,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:26:58,071 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 183 [2019-08-05 10:26:58,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:58,073 INFO L225 Difference]: With dead ends: 207 [2019-08-05 10:26:58,073 INFO L226 Difference]: Without dead ends: 207 [2019-08-05 10:26:58,074 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:26:58,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-08-05 10:26:58,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 196. [2019-08-05 10:26:58,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-08-05 10:26:58,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 212 transitions. [2019-08-05 10:26:58,078 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 212 transitions. Word has length 183 [2019-08-05 10:26:58,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:58,079 INFO L475 AbstractCegarLoop]: Abstraction has 196 states and 212 transitions. [2019-08-05 10:26:58,079 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:26:58,079 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 212 transitions. [2019-08-05 10:26:58,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-08-05 10:26:58,080 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:58,080 INFO L399 BasicCegarLoop]: trace histogram [160, 16, 16, 1, 1, 1] [2019-08-05 10:26:58,081 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:58,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:58,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1437254269, now seen corresponding path program 25 times [2019-08-05 10:26:58,082 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:58,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:58,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 591 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 10:26:58,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:59,081 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:26:59,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:59,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:26:59,082 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:26:59,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:26:59,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:26:59,083 INFO L87 Difference]: Start difference. First operand 196 states and 212 transitions. Second operand 19 states. [2019-08-05 10:26:59,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:59,774 INFO L93 Difference]: Finished difference Result 219 states and 237 transitions. [2019-08-05 10:26:59,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:26:59,775 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 195 [2019-08-05 10:26:59,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:59,777 INFO L225 Difference]: With dead ends: 219 [2019-08-05 10:26:59,777 INFO L226 Difference]: Without dead ends: 219 [2019-08-05 10:26:59,778 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:26:59,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-08-05 10:26:59,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 208. [2019-08-05 10:26:59,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-08-05 10:26:59,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 225 transitions. [2019-08-05 10:26:59,782 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 225 transitions. Word has length 195 [2019-08-05 10:26:59,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:59,783 INFO L475 AbstractCegarLoop]: Abstraction has 208 states and 225 transitions. [2019-08-05 10:26:59,783 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:26:59,783 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 225 transitions. [2019-08-05 10:26:59,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-08-05 10:26:59,784 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:59,784 INFO L399 BasicCegarLoop]: trace histogram [170, 17, 17, 1, 1, 1] [2019-08-05 10:26:59,785 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:59,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:59,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1323394059, now seen corresponding path program 26 times [2019-08-05 10:26:59,786 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:59,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:59,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 627 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 10:26:59,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:01,384 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:27:01,385 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:01,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:27:01,385 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:27:01,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:27:01,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:27:01,386 INFO L87 Difference]: Start difference. First operand 208 states and 225 transitions. Second operand 20 states. [2019-08-05 10:27:02,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:02,062 INFO L93 Difference]: Finished difference Result 231 states and 250 transitions. [2019-08-05 10:27:02,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:27:02,065 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 207 [2019-08-05 10:27:02,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:02,066 INFO L225 Difference]: With dead ends: 231 [2019-08-05 10:27:02,066 INFO L226 Difference]: Without dead ends: 231 [2019-08-05 10:27:02,067 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:27:02,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2019-08-05 10:27:02,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 220. [2019-08-05 10:27:02,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-08-05 10:27:02,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 238 transitions. [2019-08-05 10:27:02,071 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 238 transitions. Word has length 207 [2019-08-05 10:27:02,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:02,072 INFO L475 AbstractCegarLoop]: Abstraction has 220 states and 238 transitions. [2019-08-05 10:27:02,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:27:02,072 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 238 transitions. [2019-08-05 10:27:02,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-08-05 10:27:02,073 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:02,074 INFO L399 BasicCegarLoop]: trace histogram [180, 18, 18, 1, 1, 1] [2019-08-05 10:27:02,074 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:02,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:02,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1442840941, now seen corresponding path program 27 times [2019-08-05 10:27:02,075 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:02,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:02,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 663 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 10:27:02,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:02,475 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:27:02,475 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:02,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:27:02,476 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:27:02,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:27:02,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:27:02,477 INFO L87 Difference]: Start difference. First operand 220 states and 238 transitions. Second operand 21 states. [2019-08-05 10:27:03,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:03,120 INFO L93 Difference]: Finished difference Result 243 states and 263 transitions. [2019-08-05 10:27:03,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:27:03,120 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 219 [2019-08-05 10:27:03,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:03,122 INFO L225 Difference]: With dead ends: 243 [2019-08-05 10:27:03,123 INFO L226 Difference]: Without dead ends: 243 [2019-08-05 10:27:03,123 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:27:03,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-08-05 10:27:03,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 232. [2019-08-05 10:27:03,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-08-05 10:27:03,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 251 transitions. [2019-08-05 10:27:03,128 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 251 transitions. Word has length 219 [2019-08-05 10:27:03,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:03,129 INFO L475 AbstractCegarLoop]: Abstraction has 232 states and 251 transitions. [2019-08-05 10:27:03,129 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:27:03,129 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 251 transitions. [2019-08-05 10:27:03,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-08-05 10:27:03,130 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:03,131 INFO L399 BasicCegarLoop]: trace histogram [190, 19, 19, 1, 1, 1] [2019-08-05 10:27:03,131 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:03,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:03,131 INFO L82 PathProgramCache]: Analyzing trace with hash -811397861, now seen corresponding path program 28 times [2019-08-05 10:27:03,132 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:03,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:03,260 INFO L256 TraceCheckSpWp]: Trace formula consists of 699 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 10:27:03,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:03,571 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:27:03,572 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:03,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:27:03,572 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:27:03,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:27:03,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:27:03,573 INFO L87 Difference]: Start difference. First operand 232 states and 251 transitions. Second operand 22 states. [2019-08-05 10:27:04,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:04,231 INFO L93 Difference]: Finished difference Result 255 states and 276 transitions. [2019-08-05 10:27:04,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:27:04,241 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 231 [2019-08-05 10:27:04,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:04,242 INFO L225 Difference]: With dead ends: 255 [2019-08-05 10:27:04,242 INFO L226 Difference]: Without dead ends: 255 [2019-08-05 10:27:04,242 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:27:04,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-08-05 10:27:04,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 244. [2019-08-05 10:27:04,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2019-08-05 10:27:04,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 264 transitions. [2019-08-05 10:27:04,246 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 264 transitions. Word has length 231 [2019-08-05 10:27:04,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:04,246 INFO L475 AbstractCegarLoop]: Abstraction has 244 states and 264 transitions. [2019-08-05 10:27:04,246 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:27:04,246 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 264 transitions. [2019-08-05 10:27:04,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-08-05 10:27:04,247 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:04,248 INFO L399 BasicCegarLoop]: trace histogram [200, 20, 20, 1, 1, 1] [2019-08-05 10:27:04,248 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:04,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:04,248 INFO L82 PathProgramCache]: Analyzing trace with hash 2025623459, now seen corresponding path program 29 times [2019-08-05 10:27:04,249 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:04,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:04,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 735 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 10:27:04,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:04,816 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:27:04,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:04,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:27:04,817 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:27:04,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:27:04,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:27:04,817 INFO L87 Difference]: Start difference. First operand 244 states and 264 transitions. Second operand 23 states. [2019-08-05 10:27:05,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:05,653 INFO L93 Difference]: Finished difference Result 267 states and 289 transitions. [2019-08-05 10:27:05,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:27:05,654 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 243 [2019-08-05 10:27:05,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:05,656 INFO L225 Difference]: With dead ends: 267 [2019-08-05 10:27:05,656 INFO L226 Difference]: Without dead ends: 267 [2019-08-05 10:27:05,657 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:27:05,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2019-08-05 10:27:05,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 256. [2019-08-05 10:27:05,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-08-05 10:27:05,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 277 transitions. [2019-08-05 10:27:05,662 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 277 transitions. Word has length 243 [2019-08-05 10:27:05,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:05,662 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 277 transitions. [2019-08-05 10:27:05,662 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:27:05,663 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 277 transitions. [2019-08-05 10:27:05,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-08-05 10:27:05,664 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:05,664 INFO L399 BasicCegarLoop]: trace histogram [210, 21, 21, 1, 1, 1] [2019-08-05 10:27:05,664 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:05,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:05,665 INFO L82 PathProgramCache]: Analyzing trace with hash -2093054421, now seen corresponding path program 30 times [2019-08-05 10:27:05,665 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:05,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:05,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 771 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-05 10:27:05,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:06,909 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:27:06,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:06,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:27:06,910 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:27:06,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:27:06,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:27:06,911 INFO L87 Difference]: Start difference. First operand 256 states and 277 transitions. Second operand 24 states. [2019-08-05 10:27:07,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:07,721 INFO L93 Difference]: Finished difference Result 279 states and 302 transitions. [2019-08-05 10:27:07,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:27:07,723 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 255 [2019-08-05 10:27:07,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:07,725 INFO L225 Difference]: With dead ends: 279 [2019-08-05 10:27:07,725 INFO L226 Difference]: Without dead ends: 279 [2019-08-05 10:27:07,726 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:27:07,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-08-05 10:27:07,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 268. [2019-08-05 10:27:07,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-08-05 10:27:07,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 290 transitions. [2019-08-05 10:27:07,732 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 290 transitions. Word has length 255 [2019-08-05 10:27:07,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:07,732 INFO L475 AbstractCegarLoop]: Abstraction has 268 states and 290 transitions. [2019-08-05 10:27:07,732 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:27:07,733 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 290 transitions. [2019-08-05 10:27:07,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2019-08-05 10:27:07,734 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:07,735 INFO L399 BasicCegarLoop]: trace histogram [220, 22, 22, 1, 1, 1] [2019-08-05 10:27:07,735 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:07,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:07,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1914368179, now seen corresponding path program 31 times [2019-08-05 10:27:07,736 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:07,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:07,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 807 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 10:27:07,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:08,327 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:27:08,327 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:08,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:27:08,328 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:27:08,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:27:08,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:27:08,329 INFO L87 Difference]: Start difference. First operand 268 states and 290 transitions. Second operand 25 states. [2019-08-05 10:27:09,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:09,133 INFO L93 Difference]: Finished difference Result 291 states and 315 transitions. [2019-08-05 10:27:09,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:27:09,133 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 267 [2019-08-05 10:27:09,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:09,135 INFO L225 Difference]: With dead ends: 291 [2019-08-05 10:27:09,135 INFO L226 Difference]: Without dead ends: 291 [2019-08-05 10:27:09,136 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:27:09,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-08-05 10:27:09,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 280. [2019-08-05 10:27:09,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-08-05 10:27:09,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 303 transitions. [2019-08-05 10:27:09,141 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 303 transitions. Word has length 267 [2019-08-05 10:27:09,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:09,142 INFO L475 AbstractCegarLoop]: Abstraction has 280 states and 303 transitions. [2019-08-05 10:27:09,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:27:09,142 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 303 transitions. [2019-08-05 10:27:09,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2019-08-05 10:27:09,143 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:09,143 INFO L399 BasicCegarLoop]: trace histogram [230, 23, 23, 1, 1, 1] [2019-08-05 10:27:09,144 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:09,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:09,144 INFO L82 PathProgramCache]: Analyzing trace with hash -314323141, now seen corresponding path program 32 times [2019-08-05 10:27:09,145 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:09,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:09,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 843 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 10:27:09,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:10,420 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:27:10,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:10,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:27:10,421 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:27:10,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:27:10,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:27:10,421 INFO L87 Difference]: Start difference. First operand 280 states and 303 transitions. Second operand 26 states. [2019-08-05 10:27:11,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:11,354 INFO L93 Difference]: Finished difference Result 303 states and 328 transitions. [2019-08-05 10:27:11,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:27:11,355 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 279 [2019-08-05 10:27:11,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:11,357 INFO L225 Difference]: With dead ends: 303 [2019-08-05 10:27:11,357 INFO L226 Difference]: Without dead ends: 303 [2019-08-05 10:27:11,358 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:27:11,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-08-05 10:27:11,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 292. [2019-08-05 10:27:11,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-08-05 10:27:11,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 316 transitions. [2019-08-05 10:27:11,363 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 316 transitions. Word has length 279 [2019-08-05 10:27:11,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:11,363 INFO L475 AbstractCegarLoop]: Abstraction has 292 states and 316 transitions. [2019-08-05 10:27:11,363 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:27:11,364 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 316 transitions. [2019-08-05 10:27:11,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2019-08-05 10:27:11,365 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:11,365 INFO L399 BasicCegarLoop]: trace histogram [240, 24, 24, 1, 1, 1] [2019-08-05 10:27:11,365 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:11,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:11,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1101734339, now seen corresponding path program 33 times [2019-08-05 10:27:11,367 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:11,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:11,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 879 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-05 10:27:11,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:11,996 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:27:11,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:11,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:27:11,997 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:27:11,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:27:11,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:27:11,998 INFO L87 Difference]: Start difference. First operand 292 states and 316 transitions. Second operand 27 states. [2019-08-05 10:27:13,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:13,177 INFO L93 Difference]: Finished difference Result 315 states and 341 transitions. [2019-08-05 10:27:13,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:27:13,178 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 291 [2019-08-05 10:27:13,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:13,180 INFO L225 Difference]: With dead ends: 315 [2019-08-05 10:27:13,180 INFO L226 Difference]: Without dead ends: 315 [2019-08-05 10:27:13,181 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:27:13,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-08-05 10:27:13,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 304. [2019-08-05 10:27:13,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-08-05 10:27:13,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 329 transitions. [2019-08-05 10:27:13,186 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 329 transitions. Word has length 291 [2019-08-05 10:27:13,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:13,186 INFO L475 AbstractCegarLoop]: Abstraction has 304 states and 329 transitions. [2019-08-05 10:27:13,186 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:27:13,187 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 329 transitions. [2019-08-05 10:27:13,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2019-08-05 10:27:13,188 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:13,188 INFO L399 BasicCegarLoop]: trace histogram [250, 25, 25, 1, 1, 1] [2019-08-05 10:27:13,189 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:13,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:13,189 INFO L82 PathProgramCache]: Analyzing trace with hash -515708853, now seen corresponding path program 34 times [2019-08-05 10:27:13,190 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:13,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:13,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 915 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 10:27:13,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:13,850 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:27:13,850 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:13,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 10:27:13,851 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:27:13,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:27:13,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:27:13,852 INFO L87 Difference]: Start difference. First operand 304 states and 329 transitions. Second operand 28 states. [2019-08-05 10:27:14,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:14,863 INFO L93 Difference]: Finished difference Result 327 states and 354 transitions. [2019-08-05 10:27:14,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:27:14,864 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 303 [2019-08-05 10:27:14,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:14,866 INFO L225 Difference]: With dead ends: 327 [2019-08-05 10:27:14,866 INFO L226 Difference]: Without dead ends: 327 [2019-08-05 10:27:14,867 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:27:14,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2019-08-05 10:27:14,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 316. [2019-08-05 10:27:14,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2019-08-05 10:27:14,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 342 transitions. [2019-08-05 10:27:14,872 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 342 transitions. Word has length 303 [2019-08-05 10:27:14,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:14,872 INFO L475 AbstractCegarLoop]: Abstraction has 316 states and 342 transitions. [2019-08-05 10:27:14,872 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:27:14,873 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 342 transitions. [2019-08-05 10:27:14,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2019-08-05 10:27:14,874 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:14,874 INFO L399 BasicCegarLoop]: trace histogram [260, 26, 26, 1, 1, 1] [2019-08-05 10:27:14,875 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:14,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:14,875 INFO L82 PathProgramCache]: Analyzing trace with hash -486726957, now seen corresponding path program 35 times [2019-08-05 10:27:14,876 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:15,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:15,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 951 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-05 10:27:15,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:15,748 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:27:15,749 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:15,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 10:27:15,749 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 10:27:15,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 10:27:15,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:27:15,750 INFO L87 Difference]: Start difference. First operand 316 states and 342 transitions. Second operand 29 states. [2019-08-05 10:27:16,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:16,815 INFO L93 Difference]: Finished difference Result 339 states and 367 transitions. [2019-08-05 10:27:16,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:27:16,815 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 315 [2019-08-05 10:27:16,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:16,817 INFO L225 Difference]: With dead ends: 339 [2019-08-05 10:27:16,818 INFO L226 Difference]: Without dead ends: 339 [2019-08-05 10:27:16,818 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:27:16,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2019-08-05 10:27:16,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 328. [2019-08-05 10:27:16,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-08-05 10:27:16,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 355 transitions. [2019-08-05 10:27:16,823 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 355 transitions. Word has length 315 [2019-08-05 10:27:16,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:16,823 INFO L475 AbstractCegarLoop]: Abstraction has 328 states and 355 transitions. [2019-08-05 10:27:16,823 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 10:27:16,823 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 355 transitions. [2019-08-05 10:27:16,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2019-08-05 10:27:16,825 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:16,825 INFO L399 BasicCegarLoop]: trace histogram [270, 27, 27, 1, 1, 1] [2019-08-05 10:27:16,826 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:16,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:16,826 INFO L82 PathProgramCache]: Analyzing trace with hash -2100571813, now seen corresponding path program 36 times [2019-08-05 10:27:16,827 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:17,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:17,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 987 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-05 10:27:17,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:17,496 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:27:17,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:17,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 10:27:17,497 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:27:17,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:27:17,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:27:17,497 INFO L87 Difference]: Start difference. First operand 328 states and 355 transitions. Second operand 30 states. [2019-08-05 10:27:18,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:18,644 INFO L93 Difference]: Finished difference Result 351 states and 380 transitions. [2019-08-05 10:27:18,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 10:27:18,645 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 327 [2019-08-05 10:27:18,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:18,647 INFO L225 Difference]: With dead ends: 351 [2019-08-05 10:27:18,648 INFO L226 Difference]: Without dead ends: 351 [2019-08-05 10:27:18,649 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:27:18,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2019-08-05 10:27:18,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 340. [2019-08-05 10:27:18,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-08-05 10:27:18,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 368 transitions. [2019-08-05 10:27:18,653 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 368 transitions. Word has length 327 [2019-08-05 10:27:18,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:18,654 INFO L475 AbstractCegarLoop]: Abstraction has 340 states and 368 transitions. [2019-08-05 10:27:18,654 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:27:18,654 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 368 transitions. [2019-08-05 10:27:18,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2019-08-05 10:27:18,656 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:18,656 INFO L399 BasicCegarLoop]: trace histogram [280, 28, 28, 1, 1, 1] [2019-08-05 10:27:18,656 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:18,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:18,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1583287325, now seen corresponding path program 37 times [2019-08-05 10:27:18,657 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:18,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:18,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 1023 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-05 10:27:18,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:19,354 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:27:19,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:19,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 10:27:19,354 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 10:27:19,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 10:27:19,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:27:19,355 INFO L87 Difference]: Start difference. First operand 340 states and 368 transitions. Second operand 31 states. [2019-08-05 10:27:20,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:20,716 INFO L93 Difference]: Finished difference Result 363 states and 393 transitions. [2019-08-05 10:27:20,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 10:27:20,717 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 339 [2019-08-05 10:27:20,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:20,719 INFO L225 Difference]: With dead ends: 363 [2019-08-05 10:27:20,720 INFO L226 Difference]: Without dead ends: 363 [2019-08-05 10:27:20,720 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:27:20,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-08-05 10:27:20,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 352. [2019-08-05 10:27:20,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-08-05 10:27:20,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 381 transitions. [2019-08-05 10:27:20,726 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 381 transitions. Word has length 339 [2019-08-05 10:27:20,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:20,726 INFO L475 AbstractCegarLoop]: Abstraction has 352 states and 381 transitions. [2019-08-05 10:27:20,726 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 10:27:20,726 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 381 transitions. [2019-08-05 10:27:20,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2019-08-05 10:27:20,728 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:20,728 INFO L399 BasicCegarLoop]: trace histogram [290, 29, 29, 1, 1, 1] [2019-08-05 10:27:20,729 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:20,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:20,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1164872299, now seen corresponding path program 38 times [2019-08-05 10:27:20,730 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:20,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:20,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 1059 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-05 10:27:20,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:21,446 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:27:21,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:21,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 10:27:21,447 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:27:21,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:27:21,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:27:21,447 INFO L87 Difference]: Start difference. First operand 352 states and 381 transitions. Second operand 32 states. [2019-08-05 10:27:22,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:22,767 INFO L93 Difference]: Finished difference Result 375 states and 406 transitions. [2019-08-05 10:27:22,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:27:22,767 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 351 [2019-08-05 10:27:22,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:22,770 INFO L225 Difference]: With dead ends: 375 [2019-08-05 10:27:22,770 INFO L226 Difference]: Without dead ends: 375 [2019-08-05 10:27:22,771 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:27:22,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2019-08-05 10:27:22,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 364. [2019-08-05 10:27:22,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2019-08-05 10:27:22,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 394 transitions. [2019-08-05 10:27:22,776 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 394 transitions. Word has length 351 [2019-08-05 10:27:22,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:22,776 INFO L475 AbstractCegarLoop]: Abstraction has 364 states and 394 transitions. [2019-08-05 10:27:22,776 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:27:22,777 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 394 transitions. [2019-08-05 10:27:22,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2019-08-05 10:27:22,778 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:22,779 INFO L399 BasicCegarLoop]: trace histogram [300, 30, 30, 1, 1, 1] [2019-08-05 10:27:22,779 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:22,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:22,779 INFO L82 PathProgramCache]: Analyzing trace with hash 421958899, now seen corresponding path program 39 times [2019-08-05 10:27:22,780 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:23,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:23,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 1095 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-05 10:27:23,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:24,548 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:27:24,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:24,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:27:24,549 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 10:27:24,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 10:27:24,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:27:24,550 INFO L87 Difference]: Start difference. First operand 364 states and 394 transitions. Second operand 33 states. [2019-08-05 10:27:26,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:26,182 INFO L93 Difference]: Finished difference Result 387 states and 419 transitions. [2019-08-05 10:27:26,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 10:27:26,182 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 363 [2019-08-05 10:27:26,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:26,185 INFO L225 Difference]: With dead ends: 387 [2019-08-05 10:27:26,185 INFO L226 Difference]: Without dead ends: 387 [2019-08-05 10:27:26,186 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 331 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:27:26,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2019-08-05 10:27:26,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 376. [2019-08-05 10:27:26,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2019-08-05 10:27:26,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 407 transitions. [2019-08-05 10:27:26,191 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 407 transitions. Word has length 363 [2019-08-05 10:27:26,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:26,192 INFO L475 AbstractCegarLoop]: Abstraction has 376 states and 407 transitions. [2019-08-05 10:27:26,192 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 10:27:26,192 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 407 transitions. [2019-08-05 10:27:26,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2019-08-05 10:27:26,194 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:26,194 INFO L399 BasicCegarLoop]: trace histogram [310, 31, 31, 1, 1, 1] [2019-08-05 10:27:26,194 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:26,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:26,195 INFO L82 PathProgramCache]: Analyzing trace with hash -323284101, now seen corresponding path program 40 times [2019-08-05 10:27:26,195 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:26,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:26,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 1131 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-05 10:27:26,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:26,985 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:27:26,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:26,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:27:26,985 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:27:26,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:27:26,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:27:26,986 INFO L87 Difference]: Start difference. First operand 376 states and 407 transitions. Second operand 34 states. [2019-08-05 10:27:28,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:28,472 INFO L93 Difference]: Finished difference Result 399 states and 432 transitions. [2019-08-05 10:27:28,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:27:28,473 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 375 [2019-08-05 10:27:28,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:28,475 INFO L225 Difference]: With dead ends: 399 [2019-08-05 10:27:28,476 INFO L226 Difference]: Without dead ends: 399 [2019-08-05 10:27:28,476 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:27:28,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2019-08-05 10:27:28,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 388. [2019-08-05 10:27:28,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-08-05 10:27:28,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 420 transitions. [2019-08-05 10:27:28,482 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 420 transitions. Word has length 375 [2019-08-05 10:27:28,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:28,482 INFO L475 AbstractCegarLoop]: Abstraction has 388 states and 420 transitions. [2019-08-05 10:27:28,482 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:27:28,482 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 420 transitions. [2019-08-05 10:27:28,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2019-08-05 10:27:28,484 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:28,484 INFO L399 BasicCegarLoop]: trace histogram [320, 32, 32, 1, 1, 1] [2019-08-05 10:27:28,485 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:28,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:28,485 INFO L82 PathProgramCache]: Analyzing trace with hash 891160067, now seen corresponding path program 41 times [2019-08-05 10:27:28,486 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:28,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:28,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 1167 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-05 10:27:28,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:29,499 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:27:29,499 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:29,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 10:27:29,499 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:27:29,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:27:29,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:27:29,500 INFO L87 Difference]: Start difference. First operand 388 states and 420 transitions. Second operand 35 states. [2019-08-05 10:27:31,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:31,250 INFO L93 Difference]: Finished difference Result 411 states and 445 transitions. [2019-08-05 10:27:31,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 10:27:31,250 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 387 [2019-08-05 10:27:31,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:31,253 INFO L225 Difference]: With dead ends: 411 [2019-08-05 10:27:31,253 INFO L226 Difference]: Without dead ends: 411 [2019-08-05 10:27:31,254 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 353 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:27:31,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2019-08-05 10:27:31,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 400. [2019-08-05 10:27:31,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2019-08-05 10:27:31,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 433 transitions. [2019-08-05 10:27:31,259 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 433 transitions. Word has length 387 [2019-08-05 10:27:31,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:31,260 INFO L475 AbstractCegarLoop]: Abstraction has 400 states and 433 transitions. [2019-08-05 10:27:31,260 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:27:31,260 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 433 transitions. [2019-08-05 10:27:31,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2019-08-05 10:27:31,262 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:31,262 INFO L399 BasicCegarLoop]: trace histogram [330, 33, 33, 1, 1, 1] [2019-08-05 10:27:31,263 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:31,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:31,263 INFO L82 PathProgramCache]: Analyzing trace with hash -1941869429, now seen corresponding path program 42 times [2019-08-05 10:27:31,264 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:31,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:31,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 1203 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-05 10:27:31,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:32,107 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:27:32,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:32,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:27:32,108 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 10:27:32,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 10:27:32,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:27:32,109 INFO L87 Difference]: Start difference. First operand 400 states and 433 transitions. Second operand 36 states. [2019-08-05 10:27:33,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:33,776 INFO L93 Difference]: Finished difference Result 423 states and 458 transitions. [2019-08-05 10:27:33,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 10:27:33,776 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 399 [2019-08-05 10:27:33,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:33,779 INFO L225 Difference]: With dead ends: 423 [2019-08-05 10:27:33,779 INFO L226 Difference]: Without dead ends: 423 [2019-08-05 10:27:33,780 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 364 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:27:33,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2019-08-05 10:27:33,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 412. [2019-08-05 10:27:33,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2019-08-05 10:27:33,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 446 transitions. [2019-08-05 10:27:33,784 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 446 transitions. Word has length 399 [2019-08-05 10:27:33,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:33,785 INFO L475 AbstractCegarLoop]: Abstraction has 412 states and 446 transitions. [2019-08-05 10:27:33,785 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 10:27:33,785 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 446 transitions. [2019-08-05 10:27:33,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2019-08-05 10:27:33,787 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:33,788 INFO L399 BasicCegarLoop]: trace histogram [340, 34, 34, 1, 1, 1] [2019-08-05 10:27:33,788 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:33,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:33,788 INFO L82 PathProgramCache]: Analyzing trace with hash 823609107, now seen corresponding path program 43 times [2019-08-05 10:27:33,789 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:34,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:34,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 1239 conjuncts, 72 conjunts are in the unsatisfiable core [2019-08-05 10:27:34,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:35,252 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:27:35,252 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:35,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 10:27:35,253 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 10:27:35,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 10:27:35,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:27:35,254 INFO L87 Difference]: Start difference. First operand 412 states and 446 transitions. Second operand 37 states. [2019-08-05 10:27:37,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:37,205 INFO L93 Difference]: Finished difference Result 435 states and 471 transitions. [2019-08-05 10:27:37,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 10:27:37,206 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 411 [2019-08-05 10:27:37,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:37,208 INFO L225 Difference]: With dead ends: 435 [2019-08-05 10:27:37,208 INFO L226 Difference]: Without dead ends: 435 [2019-08-05 10:27:37,209 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 375 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:27:37,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2019-08-05 10:27:37,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 424. [2019-08-05 10:27:37,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2019-08-05 10:27:37,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 459 transitions. [2019-08-05 10:27:37,214 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 459 transitions. Word has length 411 [2019-08-05 10:27:37,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:37,215 INFO L475 AbstractCegarLoop]: Abstraction has 424 states and 459 transitions. [2019-08-05 10:27:37,215 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 10:27:37,215 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 459 transitions. [2019-08-05 10:27:37,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2019-08-05 10:27:37,217 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:37,217 INFO L399 BasicCegarLoop]: trace histogram [350, 35, 35, 1, 1, 1] [2019-08-05 10:27:37,218 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:37,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:37,218 INFO L82 PathProgramCache]: Analyzing trace with hash -2020502117, now seen corresponding path program 44 times [2019-08-05 10:27:37,219 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:37,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:37,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 1275 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-05 10:27:37,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:38,603 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:27:38,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:38,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:27:38,604 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 10:27:38,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 10:27:38,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:27:38,605 INFO L87 Difference]: Start difference. First operand 424 states and 459 transitions. Second operand 38 states. [2019-08-05 10:27:40,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:40,487 INFO L93 Difference]: Finished difference Result 447 states and 484 transitions. [2019-08-05 10:27:40,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 10:27:40,487 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 423 [2019-08-05 10:27:40,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:40,490 INFO L225 Difference]: With dead ends: 447 [2019-08-05 10:27:40,490 INFO L226 Difference]: Without dead ends: 447 [2019-08-05 10:27:40,491 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 386 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:27:40,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2019-08-05 10:27:40,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 436. [2019-08-05 10:27:40,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2019-08-05 10:27:40,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 472 transitions. [2019-08-05 10:27:40,495 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 472 transitions. Word has length 423 [2019-08-05 10:27:40,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:40,496 INFO L475 AbstractCegarLoop]: Abstraction has 436 states and 472 transitions. [2019-08-05 10:27:40,496 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 10:27:40,496 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 472 transitions. [2019-08-05 10:27:40,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2019-08-05 10:27:40,498 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:40,498 INFO L399 BasicCegarLoop]: trace histogram [360, 36, 36, 1, 1, 1] [2019-08-05 10:27:40,499 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:40,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:40,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1734191069, now seen corresponding path program 45 times [2019-08-05 10:27:40,499 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:40,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:40,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 1311 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-05 10:27:40,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:41,950 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:27:41,950 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:41,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 10:27:41,951 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 10:27:41,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 10:27:41,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:27:41,952 INFO L87 Difference]: Start difference. First operand 436 states and 472 transitions. Second operand 39 states. [2019-08-05 10:27:43,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:43,923 INFO L93 Difference]: Finished difference Result 459 states and 497 transitions. [2019-08-05 10:27:43,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 10:27:43,925 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 435 [2019-08-05 10:27:43,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:43,927 INFO L225 Difference]: With dead ends: 459 [2019-08-05 10:27:43,927 INFO L226 Difference]: Without dead ends: 459 [2019-08-05 10:27:43,928 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 434 GetRequests, 397 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:27:43,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2019-08-05 10:27:43,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 448. [2019-08-05 10:27:43,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2019-08-05 10:27:43,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 485 transitions. [2019-08-05 10:27:43,933 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 485 transitions. Word has length 435 [2019-08-05 10:27:43,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:43,933 INFO L475 AbstractCegarLoop]: Abstraction has 448 states and 485 transitions. [2019-08-05 10:27:43,933 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 10:27:43,934 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 485 transitions. [2019-08-05 10:27:43,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2019-08-05 10:27:43,936 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:43,936 INFO L399 BasicCegarLoop]: trace histogram [370, 37, 37, 1, 1, 1] [2019-08-05 10:27:43,936 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:43,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:43,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1841590613, now seen corresponding path program 46 times [2019-08-05 10:27:43,937 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:44,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:44,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 1347 conjuncts, 78 conjunts are in the unsatisfiable core [2019-08-05 10:27:44,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:45,135 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:27:45,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:45,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 10:27:45,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 10:27:45,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 10:27:45,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:27:45,137 INFO L87 Difference]: Start difference. First operand 448 states and 485 transitions. Second operand 40 states. [2019-08-05 10:27:47,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:47,417 INFO L93 Difference]: Finished difference Result 471 states and 510 transitions. [2019-08-05 10:27:47,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 10:27:47,418 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 447 [2019-08-05 10:27:47,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:47,421 INFO L225 Difference]: With dead ends: 471 [2019-08-05 10:27:47,421 INFO L226 Difference]: Without dead ends: 471 [2019-08-05 10:27:47,422 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 446 GetRequests, 408 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:27:47,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2019-08-05 10:27:47,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 460. [2019-08-05 10:27:47,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2019-08-05 10:27:47,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 498 transitions. [2019-08-05 10:27:47,427 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 498 transitions. Word has length 447 [2019-08-05 10:27:47,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:47,427 INFO L475 AbstractCegarLoop]: Abstraction has 460 states and 498 transitions. [2019-08-05 10:27:47,427 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 10:27:47,428 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 498 transitions. [2019-08-05 10:27:47,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2019-08-05 10:27:47,430 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:47,430 INFO L399 BasicCegarLoop]: trace histogram [380, 38, 38, 1, 1, 1] [2019-08-05 10:27:47,431 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:47,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:47,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1196374323, now seen corresponding path program 47 times [2019-08-05 10:27:47,432 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:47,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:47,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 1383 conjuncts, 80 conjunts are in the unsatisfiable core [2019-08-05 10:27:47,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:48,565 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:27:48,566 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:48,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 10:27:48,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 10:27:48,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 10:27:48,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:27:48,567 INFO L87 Difference]: Start difference. First operand 460 states and 498 transitions. Second operand 41 states. [2019-08-05 10:27:50,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:50,733 INFO L93 Difference]: Finished difference Result 483 states and 523 transitions. [2019-08-05 10:27:50,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 10:27:50,734 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 459 [2019-08-05 10:27:50,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:50,736 INFO L225 Difference]: With dead ends: 483 [2019-08-05 10:27:50,737 INFO L226 Difference]: Without dead ends: 483 [2019-08-05 10:27:50,737 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:27:50,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2019-08-05 10:27:50,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 472. [2019-08-05 10:27:50,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2019-08-05 10:27:50,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 511 transitions. [2019-08-05 10:27:50,741 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 511 transitions. Word has length 459 [2019-08-05 10:27:50,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:50,742 INFO L475 AbstractCegarLoop]: Abstraction has 472 states and 511 transitions. [2019-08-05 10:27:50,742 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 10:27:50,742 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 511 transitions. [2019-08-05 10:27:50,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2019-08-05 10:27:50,744 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:50,745 INFO L399 BasicCegarLoop]: trace histogram [390, 39, 39, 1, 1, 1] [2019-08-05 10:27:50,745 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:50,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:50,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1345366085, now seen corresponding path program 48 times [2019-08-05 10:27:50,746 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:51,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:51,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 1419 conjuncts, 82 conjunts are in the unsatisfiable core [2019-08-05 10:27:51,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:52,143 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:27:52,144 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:52,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 10:27:52,144 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:27:52,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:27:52,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:27:52,145 INFO L87 Difference]: Start difference. First operand 472 states and 511 transitions. Second operand 42 states. [2019-08-05 10:27:54,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:54,439 INFO L93 Difference]: Finished difference Result 495 states and 536 transitions. [2019-08-05 10:27:54,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 10:27:54,440 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 471 [2019-08-05 10:27:54,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:54,443 INFO L225 Difference]: With dead ends: 495 [2019-08-05 10:27:54,443 INFO L226 Difference]: Without dead ends: 495 [2019-08-05 10:27:54,444 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 470 GetRequests, 430 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:27:54,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2019-08-05 10:27:54,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 484. [2019-08-05 10:27:54,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2019-08-05 10:27:54,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 524 transitions. [2019-08-05 10:27:54,449 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 524 transitions. Word has length 471 [2019-08-05 10:27:54,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:54,450 INFO L475 AbstractCegarLoop]: Abstraction has 484 states and 524 transitions. [2019-08-05 10:27:54,450 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:27:54,450 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 524 transitions. [2019-08-05 10:27:54,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2019-08-05 10:27:54,453 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:54,453 INFO L399 BasicCegarLoop]: trace histogram [400, 40, 40, 1, 1, 1] [2019-08-05 10:27:54,453 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:54,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:54,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1756228163, now seen corresponding path program 49 times [2019-08-05 10:27:54,454 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:54,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:54,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 1455 conjuncts, 84 conjunts are in the unsatisfiable core [2019-08-05 10:27:54,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:55,688 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:27:55,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:55,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 10:27:55,689 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 10:27:55,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 10:27:55,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:27:55,690 INFO L87 Difference]: Start difference. First operand 484 states and 524 transitions. Second operand 43 states. [2019-08-05 10:27:58,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:58,238 INFO L93 Difference]: Finished difference Result 507 states and 549 transitions. [2019-08-05 10:27:58,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 10:27:58,239 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 483 [2019-08-05 10:27:58,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:58,242 INFO L225 Difference]: With dead ends: 507 [2019-08-05 10:27:58,242 INFO L226 Difference]: Without dead ends: 507 [2019-08-05 10:27:58,243 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 482 GetRequests, 441 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:27:58,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2019-08-05 10:27:58,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 496. [2019-08-05 10:27:58,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 496 states. [2019-08-05 10:27:58,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 537 transitions. [2019-08-05 10:27:58,247 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 537 transitions. Word has length 483 [2019-08-05 10:27:58,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:58,248 INFO L475 AbstractCegarLoop]: Abstraction has 496 states and 537 transitions. [2019-08-05 10:27:58,248 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 10:27:58,248 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 537 transitions. [2019-08-05 10:27:58,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 496 [2019-08-05 10:27:58,251 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:58,251 INFO L399 BasicCegarLoop]: trace histogram [410, 41, 41, 1, 1, 1] [2019-08-05 10:27:58,252 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:58,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:58,252 INFO L82 PathProgramCache]: Analyzing trace with hash 870117579, now seen corresponding path program 50 times [2019-08-05 10:27:58,253 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:58,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:58,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 1491 conjuncts, 86 conjunts are in the unsatisfiable core [2019-08-05 10:27:58,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:59,580 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:27:59,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:59,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 10:27:59,581 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 10:27:59,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 10:27:59,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:27:59,582 INFO L87 Difference]: Start difference. First operand 496 states and 537 transitions. Second operand 44 states. [2019-08-05 10:28:02,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:28:02,288 INFO L93 Difference]: Finished difference Result 519 states and 562 transitions. [2019-08-05 10:28:02,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:28:02,289 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 495 [2019-08-05 10:28:02,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:28:02,292 INFO L225 Difference]: With dead ends: 519 [2019-08-05 10:28:02,292 INFO L226 Difference]: Without dead ends: 519 [2019-08-05 10:28:02,292 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:28:02,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2019-08-05 10:28:02,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 508. [2019-08-05 10:28:02,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2019-08-05 10:28:02,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 550 transitions. [2019-08-05 10:28:02,297 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 550 transitions. Word has length 495 [2019-08-05 10:28:02,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:28:02,297 INFO L475 AbstractCegarLoop]: Abstraction has 508 states and 550 transitions. [2019-08-05 10:28:02,297 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 10:28:02,297 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 550 transitions. [2019-08-05 10:28:02,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 508 [2019-08-05 10:28:02,300 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:28:02,300 INFO L399 BasicCegarLoop]: trace histogram [420, 42, 42, 1, 1, 1] [2019-08-05 10:28:02,301 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:28:02,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:28:02,301 INFO L82 PathProgramCache]: Analyzing trace with hash 2018405203, now seen corresponding path program 51 times [2019-08-05 10:28:02,302 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:28:02,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:28:02,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 1527 conjuncts, 88 conjunts are in the unsatisfiable core [2019-08-05 10:28:02,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:28:03,786 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:28:03,786 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:28:03,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 10:28:03,787 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 10:28:03,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 10:28:03,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:28:03,787 INFO L87 Difference]: Start difference. First operand 508 states and 550 transitions. Second operand 45 states. [2019-08-05 10:28:06,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:28:06,412 INFO L93 Difference]: Finished difference Result 531 states and 575 transitions. [2019-08-05 10:28:06,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 10:28:06,412 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 507 [2019-08-05 10:28:06,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:28:06,415 INFO L225 Difference]: With dead ends: 531 [2019-08-05 10:28:06,415 INFO L226 Difference]: Without dead ends: 531 [2019-08-05 10:28:06,416 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 506 GetRequests, 463 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:28:06,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2019-08-05 10:28:06,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 520. [2019-08-05 10:28:06,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2019-08-05 10:28:06,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 563 transitions. [2019-08-05 10:28:06,422 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 563 transitions. Word has length 507 [2019-08-05 10:28:06,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:28:06,422 INFO L475 AbstractCegarLoop]: Abstraction has 520 states and 563 transitions. [2019-08-05 10:28:06,422 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 10:28:06,422 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 563 transitions. [2019-08-05 10:28:06,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 520 [2019-08-05 10:28:06,425 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:28:06,425 INFO L399 BasicCegarLoop]: trace histogram [430, 43, 43, 1, 1, 1] [2019-08-05 10:28:06,425 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:28:06,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:28:06,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1040950821, now seen corresponding path program 52 times [2019-08-05 10:28:06,427 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:28:06,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:28:06,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 1563 conjuncts, 90 conjunts are in the unsatisfiable core [2019-08-05 10:28:06,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:28:07,920 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:28:07,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:28:07,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 10:28:07,921 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:28:07,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:28:07,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:28:07,921 INFO L87 Difference]: Start difference. First operand 520 states and 563 transitions. Second operand 46 states. [2019-08-05 10:28:10,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:28:10,702 INFO L93 Difference]: Finished difference Result 543 states and 588 transitions. [2019-08-05 10:28:10,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 10:28:10,703 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 519 [2019-08-05 10:28:10,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:28:10,706 INFO L225 Difference]: With dead ends: 543 [2019-08-05 10:28:10,706 INFO L226 Difference]: Without dead ends: 543 [2019-08-05 10:28:10,706 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:28:10,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2019-08-05 10:28:10,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 532. [2019-08-05 10:28:10,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 532 states. [2019-08-05 10:28:10,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 576 transitions. [2019-08-05 10:28:10,710 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 576 transitions. Word has length 519 [2019-08-05 10:28:10,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:28:10,711 INFO L475 AbstractCegarLoop]: Abstraction has 532 states and 576 transitions. [2019-08-05 10:28:10,711 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:28:10,711 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 576 transitions. [2019-08-05 10:28:10,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2019-08-05 10:28:10,714 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:28:10,714 INFO L399 BasicCegarLoop]: trace histogram [440, 44, 44, 1, 1, 1] [2019-08-05 10:28:10,714 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:28:10,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:28:10,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1103150179, now seen corresponding path program 53 times [2019-08-05 10:28:10,715 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:28:11,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:28:11,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 1599 conjuncts, 92 conjunts are in the unsatisfiable core [2019-08-05 10:28:11,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:28:12,443 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:28:12,443 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:28:12,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 10:28:12,444 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 10:28:12,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 10:28:12,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:28:12,444 INFO L87 Difference]: Start difference. First operand 532 states and 576 transitions. Second operand 47 states. [2019-08-05 10:28:15,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:28:15,302 INFO L93 Difference]: Finished difference Result 555 states and 601 transitions. [2019-08-05 10:28:15,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 10:28:15,302 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 531 [2019-08-05 10:28:15,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:28:15,305 INFO L225 Difference]: With dead ends: 555 [2019-08-05 10:28:15,305 INFO L226 Difference]: Without dead ends: 555 [2019-08-05 10:28:15,306 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 530 GetRequests, 485 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:28:15,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2019-08-05 10:28:15,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 544. [2019-08-05 10:28:15,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2019-08-05 10:28:15,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 589 transitions. [2019-08-05 10:28:15,310 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 589 transitions. Word has length 531 [2019-08-05 10:28:15,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:28:15,311 INFO L475 AbstractCegarLoop]: Abstraction has 544 states and 589 transitions. [2019-08-05 10:28:15,311 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 10:28:15,311 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 589 transitions. [2019-08-05 10:28:15,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 544 [2019-08-05 10:28:15,313 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:28:15,313 INFO L399 BasicCegarLoop]: trace histogram [450, 45, 45, 1, 1, 1] [2019-08-05 10:28:15,313 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:28:15,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:28:15,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1302696683, now seen corresponding path program 54 times [2019-08-05 10:28:15,314 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:28:15,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:28:15,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 1635 conjuncts, 94 conjunts are in the unsatisfiable core [2019-08-05 10:28:15,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:28:16,730 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:28:16,730 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:28:16,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 10:28:16,731 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 10:28:16,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 10:28:16,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:28:16,731 INFO L87 Difference]: Start difference. First operand 544 states and 589 transitions. Second operand 48 states. [2019-08-05 10:28:19,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:28:19,901 INFO L93 Difference]: Finished difference Result 567 states and 614 transitions. [2019-08-05 10:28:19,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 10:28:19,902 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 543 [2019-08-05 10:28:19,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:28:19,905 INFO L225 Difference]: With dead ends: 567 [2019-08-05 10:28:19,905 INFO L226 Difference]: Without dead ends: 567 [2019-08-05 10:28:19,906 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:28:19,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2019-08-05 10:28:19,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 556. [2019-08-05 10:28:19,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 556 states. [2019-08-05 10:28:19,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 602 transitions. [2019-08-05 10:28:19,910 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 602 transitions. Word has length 543 [2019-08-05 10:28:19,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:28:19,911 INFO L475 AbstractCegarLoop]: Abstraction has 556 states and 602 transitions. [2019-08-05 10:28:19,911 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 10:28:19,911 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 602 transitions. [2019-08-05 10:28:19,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 556 [2019-08-05 10:28:19,913 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:28:19,913 INFO L399 BasicCegarLoop]: trace histogram [460, 46, 46, 1, 1, 1] [2019-08-05 10:28:19,913 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:28:19,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:28:19,914 INFO L82 PathProgramCache]: Analyzing trace with hash -527114893, now seen corresponding path program 55 times [2019-08-05 10:28:19,914 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:28:20,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:28:20,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 1671 conjuncts, 96 conjunts are in the unsatisfiable core [2019-08-05 10:28:20,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:28:21,432 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:28:21,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:28:21,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 10:28:21,433 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 10:28:21,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 10:28:21,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:28:21,433 INFO L87 Difference]: Start difference. First operand 556 states and 602 transitions. Second operand 49 states. [2019-08-05 10:28:24,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:28:24,784 INFO L93 Difference]: Finished difference Result 579 states and 627 transitions. [2019-08-05 10:28:24,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 10:28:24,785 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 555 [2019-08-05 10:28:24,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:28:24,788 INFO L225 Difference]: With dead ends: 579 [2019-08-05 10:28:24,788 INFO L226 Difference]: Without dead ends: 579 [2019-08-05 10:28:24,788 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 554 GetRequests, 507 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:28:24,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2019-08-05 10:28:24,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 568. [2019-08-05 10:28:24,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2019-08-05 10:28:24,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 615 transitions. [2019-08-05 10:28:24,792 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 615 transitions. Word has length 555 [2019-08-05 10:28:24,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:28:24,793 INFO L475 AbstractCegarLoop]: Abstraction has 568 states and 615 transitions. [2019-08-05 10:28:24,793 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 10:28:24,793 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 615 transitions. [2019-08-05 10:28:24,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 568 [2019-08-05 10:28:24,795 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:28:24,795 INFO L399 BasicCegarLoop]: trace histogram [470, 47, 47, 1, 1, 1] [2019-08-05 10:28:24,795 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:28:24,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:28:24,796 INFO L82 PathProgramCache]: Analyzing trace with hash 444636155, now seen corresponding path program 56 times [2019-08-05 10:28:24,796 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:28:25,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:28:25,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 1707 conjuncts, 98 conjunts are in the unsatisfiable core [2019-08-05 10:28:25,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:28:26,335 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:28:26,335 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:28:26,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 10:28:26,336 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 10:28:26,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 10:28:26,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:28:26,336 INFO L87 Difference]: Start difference. First operand 568 states and 615 transitions. Second operand 50 states. [2019-08-05 10:28:29,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:28:29,770 INFO L93 Difference]: Finished difference Result 591 states and 640 transitions. [2019-08-05 10:28:29,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 10:28:29,771 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 567 [2019-08-05 10:28:29,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:28:29,773 INFO L225 Difference]: With dead ends: 591 [2019-08-05 10:28:29,773 INFO L226 Difference]: Without dead ends: 591 [2019-08-05 10:28:29,774 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 566 GetRequests, 518 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:28:29,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2019-08-05 10:28:29,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 580. [2019-08-05 10:28:29,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2019-08-05 10:28:29,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 628 transitions. [2019-08-05 10:28:29,778 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 628 transitions. Word has length 567 [2019-08-05 10:28:29,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:28:29,779 INFO L475 AbstractCegarLoop]: Abstraction has 580 states and 628 transitions. [2019-08-05 10:28:29,779 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 10:28:29,779 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 628 transitions. [2019-08-05 10:28:29,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 580 [2019-08-05 10:28:29,781 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:28:29,781 INFO L399 BasicCegarLoop]: trace histogram [480, 48, 48, 1, 1, 1] [2019-08-05 10:28:29,781 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:28:29,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:28:29,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1067790717, now seen corresponding path program 57 times [2019-08-05 10:28:29,783 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:28:30,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:28:30,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 1743 conjuncts, 100 conjunts are in the unsatisfiable core [2019-08-05 10:28:30,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:28:31,389 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:28:31,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:28:31,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 10:28:31,390 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 10:28:31,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 10:28:31,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:28:31,391 INFO L87 Difference]: Start difference. First operand 580 states and 628 transitions. Second operand 51 states. [2019-08-05 10:28:34,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:28:34,967 INFO L93 Difference]: Finished difference Result 603 states and 653 transitions. [2019-08-05 10:28:34,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 10:28:34,967 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 579 [2019-08-05 10:28:34,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:28:34,971 INFO L225 Difference]: With dead ends: 603 [2019-08-05 10:28:34,971 INFO L226 Difference]: Without dead ends: 603 [2019-08-05 10:28:34,971 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 578 GetRequests, 529 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:28:34,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2019-08-05 10:28:34,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 592. [2019-08-05 10:28:34,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-08-05 10:28:34,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 641 transitions. [2019-08-05 10:28:34,976 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 641 transitions. Word has length 579 [2019-08-05 10:28:34,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:28:34,976 INFO L475 AbstractCegarLoop]: Abstraction has 592 states and 641 transitions. [2019-08-05 10:28:34,976 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 10:28:34,976 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 641 transitions. [2019-08-05 10:28:34,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 592 [2019-08-05 10:28:34,978 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:28:34,979 INFO L399 BasicCegarLoop]: trace histogram [490, 49, 49, 1, 1, 1] [2019-08-05 10:28:34,979 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:28:34,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:28:34,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1139444469, now seen corresponding path program 58 times [2019-08-05 10:28:34,980 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:28:35,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:28:35,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 1779 conjuncts, 102 conjunts are in the unsatisfiable core [2019-08-05 10:28:35,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:28:36,645 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:28:36,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:28:36,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 10:28:36,646 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 10:28:36,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 10:28:36,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:28:36,646 INFO L87 Difference]: Start difference. First operand 592 states and 641 transitions. Second operand 52 states. [2019-08-05 10:28:40,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:28:40,389 INFO L93 Difference]: Finished difference Result 615 states and 666 transitions. [2019-08-05 10:28:40,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 10:28:40,389 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 591 [2019-08-05 10:28:40,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:28:40,392 INFO L225 Difference]: With dead ends: 615 [2019-08-05 10:28:40,393 INFO L226 Difference]: Without dead ends: 615 [2019-08-05 10:28:40,393 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 590 GetRequests, 540 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:28:40,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2019-08-05 10:28:40,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 604. [2019-08-05 10:28:40,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-08-05 10:28:40,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 654 transitions. [2019-08-05 10:28:40,399 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 654 transitions. Word has length 591 [2019-08-05 10:28:40,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:28:40,400 INFO L475 AbstractCegarLoop]: Abstraction has 604 states and 654 transitions. [2019-08-05 10:28:40,400 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 10:28:40,400 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 654 transitions. [2019-08-05 10:28:40,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 604 [2019-08-05 10:28:40,402 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:28:40,402 INFO L399 BasicCegarLoop]: trace histogram [500, 50, 50, 1, 1, 1] [2019-08-05 10:28:40,403 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:28:40,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:28:40,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1667068013, now seen corresponding path program 59 times [2019-08-05 10:28:40,404 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:28:40,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:28:40,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 1815 conjuncts, 104 conjunts are in the unsatisfiable core [2019-08-05 10:28:40,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:28:42,129 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:28:42,130 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:28:42,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 10:28:42,130 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 10:28:42,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 10:28:42,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:28:42,131 INFO L87 Difference]: Start difference. First operand 604 states and 654 transitions. Second operand 53 states. [2019-08-05 10:28:46,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:28:46,004 INFO L93 Difference]: Finished difference Result 627 states and 679 transitions. [2019-08-05 10:28:46,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 10:28:46,004 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 603 [2019-08-05 10:28:46,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:28:46,006 INFO L225 Difference]: With dead ends: 627 [2019-08-05 10:28:46,006 INFO L226 Difference]: Without dead ends: 627 [2019-08-05 10:28:46,006 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 602 GetRequests, 551 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:28:46,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2019-08-05 10:28:46,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 616. [2019-08-05 10:28:46,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 616 states. [2019-08-05 10:28:46,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 667 transitions. [2019-08-05 10:28:46,011 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 667 transitions. Word has length 603 [2019-08-05 10:28:46,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:28:46,012 INFO L475 AbstractCegarLoop]: Abstraction has 616 states and 667 transitions. [2019-08-05 10:28:46,012 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 10:28:46,012 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 667 transitions. [2019-08-05 10:28:46,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 616 [2019-08-05 10:28:46,014 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:28:46,014 INFO L399 BasicCegarLoop]: trace histogram [510, 51, 51, 1, 1, 1] [2019-08-05 10:28:46,015 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:28:46,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:28:46,015 INFO L82 PathProgramCache]: Analyzing trace with hash 368320027, now seen corresponding path program 60 times [2019-08-05 10:28:46,016 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:28:46,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:28:46,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 1851 conjuncts, 106 conjunts are in the unsatisfiable core [2019-08-05 10:28:46,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:28:47,984 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:28:47,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:28:47,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 10:28:47,985 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 10:28:47,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 10:28:47,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:28:47,985 INFO L87 Difference]: Start difference. First operand 616 states and 667 transitions. Second operand 54 states. [2019-08-05 10:28:51,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:28:51,911 INFO L93 Difference]: Finished difference Result 639 states and 692 transitions. [2019-08-05 10:28:51,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 10:28:51,912 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 615 [2019-08-05 10:28:51,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:28:51,915 INFO L225 Difference]: With dead ends: 639 [2019-08-05 10:28:51,915 INFO L226 Difference]: Without dead ends: 639 [2019-08-05 10:28:51,916 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:28:51,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2019-08-05 10:28:51,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 628. [2019-08-05 10:28:51,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 628 states. [2019-08-05 10:28:51,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 680 transitions. [2019-08-05 10:28:51,920 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 680 transitions. Word has length 615 [2019-08-05 10:28:51,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:28:51,920 INFO L475 AbstractCegarLoop]: Abstraction has 628 states and 680 transitions. [2019-08-05 10:28:51,920 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 10:28:51,921 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 680 transitions. [2019-08-05 10:28:51,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 628 [2019-08-05 10:28:51,923 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:28:51,924 INFO L399 BasicCegarLoop]: trace histogram [520, 52, 52, 1, 1, 1] [2019-08-05 10:28:51,924 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:28:51,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:28:51,924 INFO L82 PathProgramCache]: Analyzing trace with hash -2130960221, now seen corresponding path program 61 times [2019-08-05 10:28:51,925 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:28:52,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:28:52,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 1887 conjuncts, 108 conjunts are in the unsatisfiable core [2019-08-05 10:28:52,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:28:53,950 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:28:53,950 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:28:53,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 10:28:53,950 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 10:28:53,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 10:28:53,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:28:53,951 INFO L87 Difference]: Start difference. First operand 628 states and 680 transitions. Second operand 55 states. [2019-08-05 10:28:58,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:28:58,041 INFO L93 Difference]: Finished difference Result 651 states and 705 transitions. [2019-08-05 10:28:58,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 10:28:58,042 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 627 [2019-08-05 10:28:58,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:28:58,046 INFO L225 Difference]: With dead ends: 651 [2019-08-05 10:28:58,046 INFO L226 Difference]: Without dead ends: 651 [2019-08-05 10:28:58,046 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 626 GetRequests, 573 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:28:58,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2019-08-05 10:28:58,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 640. [2019-08-05 10:28:58,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2019-08-05 10:28:58,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 693 transitions. [2019-08-05 10:28:58,051 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 693 transitions. Word has length 627 [2019-08-05 10:28:58,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:28:58,051 INFO L475 AbstractCegarLoop]: Abstraction has 640 states and 693 transitions. [2019-08-05 10:28:58,051 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 10:28:58,051 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 693 transitions. [2019-08-05 10:28:58,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 640 [2019-08-05 10:28:58,054 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:28:58,054 INFO L399 BasicCegarLoop]: trace histogram [530, 53, 53, 1, 1, 1] [2019-08-05 10:28:58,054 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:28:58,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:28:58,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1538037547, now seen corresponding path program 62 times [2019-08-05 10:28:58,056 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:28:58,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:28:58,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 1923 conjuncts, 110 conjunts are in the unsatisfiable core [2019-08-05 10:28:58,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:28:59,936 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:28:59,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:28:59,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 10:28:59,937 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 10:28:59,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 10:28:59,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:28:59,938 INFO L87 Difference]: Start difference. First operand 640 states and 693 transitions. Second operand 56 states. [2019-08-05 10:29:04,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:29:04,205 INFO L93 Difference]: Finished difference Result 663 states and 718 transitions. [2019-08-05 10:29:04,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 10:29:04,205 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 639 [2019-08-05 10:29:04,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:29:04,209 INFO L225 Difference]: With dead ends: 663 [2019-08-05 10:29:04,209 INFO L226 Difference]: Without dead ends: 663 [2019-08-05 10:29:04,209 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:29:04,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2019-08-05 10:29:04,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 652. [2019-08-05 10:29:04,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 652 states. [2019-08-05 10:29:04,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 706 transitions. [2019-08-05 10:29:04,214 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 706 transitions. Word has length 639 [2019-08-05 10:29:04,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:29:04,215 INFO L475 AbstractCegarLoop]: Abstraction has 652 states and 706 transitions. [2019-08-05 10:29:04,215 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 10:29:04,215 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 706 transitions. [2019-08-05 10:29:04,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 652 [2019-08-05 10:29:04,218 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:29:04,219 INFO L399 BasicCegarLoop]: trace histogram [540, 54, 54, 1, 1, 1] [2019-08-05 10:29:04,219 INFO L418 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:29:04,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:29:04,219 INFO L82 PathProgramCache]: Analyzing trace with hash -923303501, now seen corresponding path program 63 times [2019-08-05 10:29:04,220 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:29:04,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:29:04,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 1959 conjuncts, 112 conjunts are in the unsatisfiable core [2019-08-05 10:29:04,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:29:06,224 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:29:06,224 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:29:06,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 10:29:06,225 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 10:29:06,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 10:29:06,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:29:06,225 INFO L87 Difference]: Start difference. First operand 652 states and 706 transitions. Second operand 57 states. [2019-08-05 10:29:10,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:29:10,584 INFO L93 Difference]: Finished difference Result 675 states and 731 transitions. [2019-08-05 10:29:10,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 10:29:10,584 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 651 [2019-08-05 10:29:10,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:29:10,588 INFO L225 Difference]: With dead ends: 675 [2019-08-05 10:29:10,588 INFO L226 Difference]: Without dead ends: 675 [2019-08-05 10:29:10,589 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 650 GetRequests, 595 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:29:10,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2019-08-05 10:29:10,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 664. [2019-08-05 10:29:10,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 664 states. [2019-08-05 10:29:10,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 719 transitions. [2019-08-05 10:29:10,593 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 719 transitions. Word has length 651 [2019-08-05 10:29:10,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:29:10,594 INFO L475 AbstractCegarLoop]: Abstraction has 664 states and 719 transitions. [2019-08-05 10:29:10,594 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 10:29:10,594 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 719 transitions. [2019-08-05 10:29:10,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 664 [2019-08-05 10:29:10,597 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:29:10,597 INFO L399 BasicCegarLoop]: trace histogram [550, 55, 55, 1, 1, 1] [2019-08-05 10:29:10,597 INFO L418 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:29:10,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:29:10,598 INFO L82 PathProgramCache]: Analyzing trace with hash 281993275, now seen corresponding path program 64 times [2019-08-05 10:29:10,598 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:29:11,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:29:11,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 1995 conjuncts, 114 conjunts are in the unsatisfiable core [2019-08-05 10:29:11,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:29:12,639 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:29:12,640 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:29:12,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 10:29:12,640 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 10:29:12,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 10:29:12,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:29:12,641 INFO L87 Difference]: Start difference. First operand 664 states and 719 transitions. Second operand 58 states. [2019-08-05 10:29:17,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:29:17,213 INFO L93 Difference]: Finished difference Result 687 states and 744 transitions. [2019-08-05 10:29:17,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 10:29:17,214 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 663 [2019-08-05 10:29:17,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:29:17,218 INFO L225 Difference]: With dead ends: 687 [2019-08-05 10:29:17,218 INFO L226 Difference]: Without dead ends: 687 [2019-08-05 10:29:17,218 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 662 GetRequests, 606 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:29:17,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2019-08-05 10:29:17,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 676. [2019-08-05 10:29:17,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 676 states. [2019-08-05 10:29:17,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 732 transitions. [2019-08-05 10:29:17,223 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 732 transitions. Word has length 663 [2019-08-05 10:29:17,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:29:17,223 INFO L475 AbstractCegarLoop]: Abstraction has 676 states and 732 transitions. [2019-08-05 10:29:17,223 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 10:29:17,224 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 732 transitions. [2019-08-05 10:29:17,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 676 [2019-08-05 10:29:17,226 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:29:17,227 INFO L399 BasicCegarLoop]: trace histogram [560, 56, 56, 1, 1, 1] [2019-08-05 10:29:17,227 INFO L418 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:29:17,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:29:17,227 INFO L82 PathProgramCache]: Analyzing trace with hash 539275971, now seen corresponding path program 65 times [2019-08-05 10:29:17,228 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:29:17,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:29:17,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 2031 conjuncts, 116 conjunts are in the unsatisfiable core [2019-08-05 10:29:17,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:29:19,637 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:29:19,637 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:29:19,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 10:29:19,638 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 10:29:19,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 10:29:19,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:29:19,638 INFO L87 Difference]: Start difference. First operand 676 states and 732 transitions. Second operand 59 states. [2019-08-05 10:29:24,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:29:24,434 INFO L93 Difference]: Finished difference Result 699 states and 757 transitions. [2019-08-05 10:29:24,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 10:29:24,435 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 675 [2019-08-05 10:29:24,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:29:24,439 INFO L225 Difference]: With dead ends: 699 [2019-08-05 10:29:24,439 INFO L226 Difference]: Without dead ends: 699 [2019-08-05 10:29:24,440 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:29:24,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2019-08-05 10:29:24,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 688. [2019-08-05 10:29:24,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 688 states. [2019-08-05 10:29:24,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 745 transitions. [2019-08-05 10:29:24,445 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 745 transitions. Word has length 675 [2019-08-05 10:29:24,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:29:24,445 INFO L475 AbstractCegarLoop]: Abstraction has 688 states and 745 transitions. [2019-08-05 10:29:24,445 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 10:29:24,445 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 745 transitions. [2019-08-05 10:29:24,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 688 [2019-08-05 10:29:24,448 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:29:24,448 INFO L399 BasicCegarLoop]: trace histogram [570, 57, 57, 1, 1, 1] [2019-08-05 10:29:24,448 INFO L418 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:29:24,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:29:24,449 INFO L82 PathProgramCache]: Analyzing trace with hash 149616971, now seen corresponding path program 66 times [2019-08-05 10:29:24,449 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:29:25,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:29:25,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 2067 conjuncts, 118 conjunts are in the unsatisfiable core [2019-08-05 10:29:25,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:29:26,654 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:29:26,655 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:29:26,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 10:29:26,655 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 10:29:26,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 10:29:26,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:29:26,656 INFO L87 Difference]: Start difference. First operand 688 states and 745 transitions. Second operand 60 states. [2019-08-05 10:29:31,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:29:31,534 INFO L93 Difference]: Finished difference Result 711 states and 770 transitions. [2019-08-05 10:29:31,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 10:29:31,535 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 687 [2019-08-05 10:29:31,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:29:31,539 INFO L225 Difference]: With dead ends: 711 [2019-08-05 10:29:31,539 INFO L226 Difference]: Without dead ends: 711 [2019-08-05 10:29:31,539 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:29:31,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2019-08-05 10:29:31,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 700. [2019-08-05 10:29:31,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 700 states. [2019-08-05 10:29:31,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 758 transitions. [2019-08-05 10:29:31,544 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 758 transitions. Word has length 687 [2019-08-05 10:29:31,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:29:31,545 INFO L475 AbstractCegarLoop]: Abstraction has 700 states and 758 transitions. [2019-08-05 10:29:31,545 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 10:29:31,545 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 758 transitions. [2019-08-05 10:29:31,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 700 [2019-08-05 10:29:31,548 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:29:31,548 INFO L399 BasicCegarLoop]: trace histogram [580, 58, 58, 1, 1, 1] [2019-08-05 10:29:31,548 INFO L418 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:29:31,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:29:31,548 INFO L82 PathProgramCache]: Analyzing trace with hash -2112637997, now seen corresponding path program 67 times [2019-08-05 10:29:31,549 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:29:32,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:29:32,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 2103 conjuncts, 120 conjunts are in the unsatisfiable core [2019-08-05 10:29:32,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:29:34,149 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:29:34,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:29:34,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-05 10:29:34,150 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-05 10:29:34,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-05 10:29:34,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:29:34,150 INFO L87 Difference]: Start difference. First operand 700 states and 758 transitions. Second operand 61 states. [2019-08-05 10:29:39,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:29:39,176 INFO L93 Difference]: Finished difference Result 723 states and 783 transitions. [2019-08-05 10:29:39,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 10:29:39,177 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 699 [2019-08-05 10:29:39,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:29:39,181 INFO L225 Difference]: With dead ends: 723 [2019-08-05 10:29:39,181 INFO L226 Difference]: Without dead ends: 723 [2019-08-05 10:29:39,181 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 698 GetRequests, 639 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:29:39,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2019-08-05 10:29:39,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 712. [2019-08-05 10:29:39,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 712 states. [2019-08-05 10:29:39,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 771 transitions. [2019-08-05 10:29:39,186 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 771 transitions. Word has length 699 [2019-08-05 10:29:39,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:29:39,187 INFO L475 AbstractCegarLoop]: Abstraction has 712 states and 771 transitions. [2019-08-05 10:29:39,187 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-05 10:29:39,187 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 771 transitions. [2019-08-05 10:29:39,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 712 [2019-08-05 10:29:39,190 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:29:39,190 INFO L399 BasicCegarLoop]: trace histogram [590, 59, 59, 1, 1, 1] [2019-08-05 10:29:39,191 INFO L418 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:29:39,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:29:39,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1737548379, now seen corresponding path program 68 times [2019-08-05 10:29:39,191 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:29:39,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:29:39,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 2139 conjuncts, 122 conjunts are in the unsatisfiable core [2019-08-05 10:29:39,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:29:41,528 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:29:41,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:29:41,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-05 10:29:41,529 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-05 10:29:41,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-05 10:29:41,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:29:41,530 INFO L87 Difference]: Start difference. First operand 712 states and 771 transitions. Second operand 62 states. [2019-08-05 10:29:46,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:29:46,729 INFO L93 Difference]: Finished difference Result 735 states and 796 transitions. [2019-08-05 10:29:46,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 10:29:46,730 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 711 [2019-08-05 10:29:46,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:29:46,733 INFO L225 Difference]: With dead ends: 735 [2019-08-05 10:29:46,733 INFO L226 Difference]: Without dead ends: 735 [2019-08-05 10:29:46,734 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:29:46,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2019-08-05 10:29:46,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 724. [2019-08-05 10:29:46,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 724 states. [2019-08-05 10:29:46,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 784 transitions. [2019-08-05 10:29:46,738 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 784 transitions. Word has length 711 [2019-08-05 10:29:46,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:29:46,739 INFO L475 AbstractCegarLoop]: Abstraction has 724 states and 784 transitions. [2019-08-05 10:29:46,739 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-05 10:29:46,739 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 784 transitions. [2019-08-05 10:29:46,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 724 [2019-08-05 10:29:46,742 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:29:46,743 INFO L399 BasicCegarLoop]: trace histogram [600, 60, 60, 1, 1, 1] [2019-08-05 10:29:46,743 INFO L418 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:29:46,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:29:46,743 INFO L82 PathProgramCache]: Analyzing trace with hash 978617571, now seen corresponding path program 69 times [2019-08-05 10:29:46,744 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:29:47,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:29:47,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 2175 conjuncts, 124 conjunts are in the unsatisfiable core [2019-08-05 10:29:47,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:29:49,365 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:29:49,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:29:49,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-05 10:29:49,366 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-05 10:29:49,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-05 10:29:49,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:29:49,366 INFO L87 Difference]: Start difference. First operand 724 states and 784 transitions. Second operand 63 states. [2019-08-05 10:29:54,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:29:54,704 INFO L93 Difference]: Finished difference Result 747 states and 809 transitions. [2019-08-05 10:29:54,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 10:29:54,704 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 723 [2019-08-05 10:29:54,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:29:54,708 INFO L225 Difference]: With dead ends: 747 [2019-08-05 10:29:54,708 INFO L226 Difference]: Without dead ends: 747 [2019-08-05 10:29:54,709 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 722 GetRequests, 661 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:29:54,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2019-08-05 10:29:54,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 736. [2019-08-05 10:29:54,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2019-08-05 10:29:54,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 797 transitions. [2019-08-05 10:29:54,714 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 797 transitions. Word has length 723 [2019-08-05 10:29:54,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:29:54,715 INFO L475 AbstractCegarLoop]: Abstraction has 736 states and 797 transitions. [2019-08-05 10:29:54,715 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-05 10:29:54,715 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 797 transitions. [2019-08-05 10:29:54,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 736 [2019-08-05 10:29:54,718 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:29:54,718 INFO L399 BasicCegarLoop]: trace histogram [610, 61, 61, 1, 1, 1] [2019-08-05 10:29:54,718 INFO L418 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:29:54,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:29:54,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1605330069, now seen corresponding path program 70 times [2019-08-05 10:29:54,719 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:29:55,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:29:55,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 2211 conjuncts, 126 conjunts are in the unsatisfiable core [2019-08-05 10:29:55,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:29:57,641 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:29:57,641 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:29:57,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-05 10:29:57,642 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-05 10:29:57,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-05 10:29:57,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:29:57,642 INFO L87 Difference]: Start difference. First operand 736 states and 797 transitions. Second operand 64 states. [2019-08-05 10:30:03,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:30:03,157 INFO L93 Difference]: Finished difference Result 759 states and 822 transitions. [2019-08-05 10:30:03,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-05 10:30:03,158 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 735 [2019-08-05 10:30:03,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:30:03,162 INFO L225 Difference]: With dead ends: 759 [2019-08-05 10:30:03,162 INFO L226 Difference]: Without dead ends: 759 [2019-08-05 10:30:03,163 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 734 GetRequests, 672 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:30:03,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2019-08-05 10:30:03,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 748. [2019-08-05 10:30:03,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 748 states. [2019-08-05 10:30:03,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 810 transitions. [2019-08-05 10:30:03,168 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 810 transitions. Word has length 735 [2019-08-05 10:30:03,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:30:03,168 INFO L475 AbstractCegarLoop]: Abstraction has 748 states and 810 transitions. [2019-08-05 10:30:03,168 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-05 10:30:03,168 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 810 transitions. [2019-08-05 10:30:03,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 748 [2019-08-05 10:30:03,172 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:30:03,172 INFO L399 BasicCegarLoop]: trace histogram [620, 62, 62, 1, 1, 1] [2019-08-05 10:30:03,172 INFO L418 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:30:03,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:30:03,173 INFO L82 PathProgramCache]: Analyzing trace with hash -461953549, now seen corresponding path program 71 times [2019-08-05 10:30:03,173 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:30:03,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:30:03,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 2247 conjuncts, 128 conjunts are in the unsatisfiable core [2019-08-05 10:30:03,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:30:05,999 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:30:06,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:30:06,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-05 10:30:06,001 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-05 10:30:06,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-05 10:30:06,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:30:06,001 INFO L87 Difference]: Start difference. First operand 748 states and 810 transitions. Second operand 65 states. [2019-08-05 10:30:11,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:30:11,738 INFO L93 Difference]: Finished difference Result 771 states and 835 transitions. [2019-08-05 10:30:11,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-05 10:30:11,738 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 747 [2019-08-05 10:30:11,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:30:11,742 INFO L225 Difference]: With dead ends: 771 [2019-08-05 10:30:11,742 INFO L226 Difference]: Without dead ends: 771 [2019-08-05 10:30:11,743 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 746 GetRequests, 683 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:30:11,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2019-08-05 10:30:11,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 760. [2019-08-05 10:30:11,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 760 states. [2019-08-05 10:30:11,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 823 transitions. [2019-08-05 10:30:11,748 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 823 transitions. Word has length 747 [2019-08-05 10:30:11,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:30:11,748 INFO L475 AbstractCegarLoop]: Abstraction has 760 states and 823 transitions. [2019-08-05 10:30:11,748 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-05 10:30:11,748 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 823 transitions. [2019-08-05 10:30:11,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 760 [2019-08-05 10:30:11,752 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:30:11,752 INFO L399 BasicCegarLoop]: trace histogram [630, 63, 63, 1, 1, 1] [2019-08-05 10:30:11,752 INFO L418 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:30:11,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:30:11,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1991910523, now seen corresponding path program 72 times [2019-08-05 10:30:11,753 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:30:12,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:30:12,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 2283 conjuncts, 130 conjunts are in the unsatisfiable core [2019-08-05 10:30:12,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:30:14,330 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:30:14,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:30:14,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-05 10:30:14,331 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-05 10:30:14,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-05 10:30:14,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:30:14,332 INFO L87 Difference]: Start difference. First operand 760 states and 823 transitions. Second operand 66 states. [2019-08-05 10:30:20,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:30:20,368 INFO L93 Difference]: Finished difference Result 783 states and 848 transitions. [2019-08-05 10:30:20,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 10:30:20,369 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 759 [2019-08-05 10:30:20,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:30:20,373 INFO L225 Difference]: With dead ends: 783 [2019-08-05 10:30:20,373 INFO L226 Difference]: Without dead ends: 783 [2019-08-05 10:30:20,373 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:30:20,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2019-08-05 10:30:20,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 772. [2019-08-05 10:30:20,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 772 states. [2019-08-05 10:30:20,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 836 transitions. [2019-08-05 10:30:20,379 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 836 transitions. Word has length 759 [2019-08-05 10:30:20,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:30:20,379 INFO L475 AbstractCegarLoop]: Abstraction has 772 states and 836 transitions. [2019-08-05 10:30:20,379 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-05 10:30:20,380 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 836 transitions. [2019-08-05 10:30:20,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 772 [2019-08-05 10:30:20,383 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:30:20,383 INFO L399 BasicCegarLoop]: trace histogram [640, 64, 64, 1, 1, 1] [2019-08-05 10:30:20,384 INFO L418 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:30:20,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:30:20,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1812698883, now seen corresponding path program 73 times [2019-08-05 10:30:20,385 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:30:21,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:30:21,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 2319 conjuncts, 132 conjunts are in the unsatisfiable core [2019-08-05 10:30:21,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:30:23,150 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:30:23,151 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:30:23,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-05 10:30:23,151 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-05 10:30:23,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-05 10:30:23,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:30:23,152 INFO L87 Difference]: Start difference. First operand 772 states and 836 transitions. Second operand 67 states. [2019-08-05 10:30:29,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:30:29,367 INFO L93 Difference]: Finished difference Result 795 states and 861 transitions. [2019-08-05 10:30:29,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 10:30:29,368 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 771 [2019-08-05 10:30:29,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:30:29,371 INFO L225 Difference]: With dead ends: 795 [2019-08-05 10:30:29,372 INFO L226 Difference]: Without dead ends: 795 [2019-08-05 10:30:29,372 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 770 GetRequests, 705 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:30:29,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2019-08-05 10:30:29,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 784. [2019-08-05 10:30:29,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2019-08-05 10:30:29,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 849 transitions. [2019-08-05 10:30:29,378 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 849 transitions. Word has length 771 [2019-08-05 10:30:29,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:30:29,378 INFO L475 AbstractCegarLoop]: Abstraction has 784 states and 849 transitions. [2019-08-05 10:30:29,378 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-05 10:30:29,378 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 849 transitions. [2019-08-05 10:30:29,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 784 [2019-08-05 10:30:29,382 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:30:29,383 INFO L399 BasicCegarLoop]: trace histogram [650, 65, 65, 1, 1, 1] [2019-08-05 10:30:29,383 INFO L418 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:30:29,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:30:29,383 INFO L82 PathProgramCache]: Analyzing trace with hash -27427445, now seen corresponding path program 74 times [2019-08-05 10:30:29,384 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:30:30,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:30:30,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 2355 conjuncts, 134 conjunts are in the unsatisfiable core [2019-08-05 10:30:30,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:30:32,275 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:30:32,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:30:32,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-05 10:30:32,276 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-05 10:30:32,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-05 10:30:32,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:30:32,276 INFO L87 Difference]: Start difference. First operand 784 states and 849 transitions. Second operand 68 states. [2019-08-05 10:30:38,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:30:38,671 INFO L93 Difference]: Finished difference Result 807 states and 874 transitions. [2019-08-05 10:30:38,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-05 10:30:38,672 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 783 [2019-08-05 10:30:38,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:30:38,676 INFO L225 Difference]: With dead ends: 807 [2019-08-05 10:30:38,676 INFO L226 Difference]: Without dead ends: 807 [2019-08-05 10:30:38,677 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:30:38,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2019-08-05 10:30:38,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 796. [2019-08-05 10:30:38,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2019-08-05 10:30:38,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 862 transitions. [2019-08-05 10:30:38,682 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 862 transitions. Word has length 783 [2019-08-05 10:30:38,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:30:38,682 INFO L475 AbstractCegarLoop]: Abstraction has 796 states and 862 transitions. [2019-08-05 10:30:38,683 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-05 10:30:38,683 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 862 transitions. [2019-08-05 10:30:38,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 796 [2019-08-05 10:30:38,687 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:30:38,687 INFO L399 BasicCegarLoop]: trace histogram [660, 66, 66, 1, 1, 1] [2019-08-05 10:30:38,687 INFO L418 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:30:38,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:30:38,688 INFO L82 PathProgramCache]: Analyzing trace with hash 211933203, now seen corresponding path program 75 times [2019-08-05 10:30:38,688 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:30:39,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:30:39,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 2391 conjuncts, 136 conjunts are in the unsatisfiable core [2019-08-05 10:30:39,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:30:41,937 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:30:41,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:30:41,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-05 10:30:41,938 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-05 10:30:41,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-05 10:30:41,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:30:41,939 INFO L87 Difference]: Start difference. First operand 796 states and 862 transitions. Second operand 69 states. Received shutdown request... [2019-08-05 10:30:47,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-05 10:30:47,989 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 10:30:47,996 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 10:30:47,996 INFO L202 PluginConnector]: Adding new model nested_true-unreach-call1.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:30:47 BoogieIcfgContainer [2019-08-05 10:30:47,996 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:30:47,999 INFO L168 Benchmark]: Toolchain (without parser) took 246085.34 ms. Allocated memory was 135.3 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 111.3 MB in the beginning and 791.7 MB in the end (delta: -680.4 MB). Peak memory consumption was 544.9 MB. Max. memory is 7.1 GB. [2019-08-05 10:30:47,999 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 135.3 MB. Free memory is still 112.6 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 10:30:48,000 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.05 ms. Allocated memory is still 135.3 MB. Free memory was 111.3 MB in the beginning and 109.6 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-08-05 10:30:48,000 INFO L168 Benchmark]: Boogie Preprocessor took 31.88 ms. Allocated memory is still 135.3 MB. Free memory was 109.6 MB in the beginning and 108.3 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:30:48,001 INFO L168 Benchmark]: RCFGBuilder took 352.92 ms. Allocated memory is still 135.3 MB. Free memory was 108.3 MB in the beginning and 98.4 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2019-08-05 10:30:48,002 INFO L168 Benchmark]: TraceAbstraction took 245660.47 ms. Allocated memory was 135.3 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 98.4 MB in the beginning and 791.7 MB in the end (delta: -693.3 MB). Peak memory consumption was 532.0 MB. Max. memory is 7.1 GB. [2019-08-05 10:30:48,004 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 135.3 MB. Free memory is still 112.6 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 35.05 ms. Allocated memory is still 135.3 MB. Free memory was 111.3 MB in the beginning and 109.6 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 31.88 ms. Allocated memory is still 135.3 MB. Free memory was 109.6 MB in the beginning and 108.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 352.92 ms. Allocated memory is still 135.3 MB. Free memory was 108.3 MB in the beginning and 98.4 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 245660.47 ms. Allocated memory was 135.3 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 98.4 MB in the beginning and 791.7 MB in the end (delta: -693.3 MB). Peak memory consumption was 532.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 35]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 35). Cancelled while BasicCegarLoop was constructing difference of abstraction (796states) and FLOYD_HOARE automaton (currently 65 states, 69 states before enhancement),while ReachableStatesComputation was computing reachable states (746 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. TIMEOUT Result, 245.6s OverallTime, 77 OverallIterations, 660 TraceHistogramMax, 155.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2522 SDtfs, 132 SDslu, 102224 SDs, 0 SdLazy, 209446 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 127.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 26751 GetRequests, 24418 SyntacticMatches, 0 SemanticMatches, 2333 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 58.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=796occurred in iteration=76, 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, 76 MinimizatonAttempts, 716 StatesRemovedByMinimization, 66 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 19.2s SatisfiabilityAnalysisTime, 69.6s InterpolantComputationTime, 26828 NumberOfCodeBlocks, 26828 NumberOfCodeBlocksAsserted, 77 NumberOfCheckSat, 26751 ConstructedInterpolants, 0 QuantifiedInterpolants, 42612833 SizeOfPredicates, 77 NumberOfNonLiveVariables, 80946 ConjunctsInSsa, 4810 ConjunctsInUnsatCore, 77 InterpolantComputations, 2 PerfectInterpolantSequences, 121615/5968401 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown