java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/count_by_1_variant.i_2.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:22:17,751 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:22:17,753 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:22:17,765 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:22:17,765 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:22:17,766 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:22:17,767 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:22:17,769 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:22:17,771 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:22:17,772 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:22:17,773 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:22:17,773 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:22:17,773 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:22:17,774 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:22:17,775 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:22:17,777 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:22:17,778 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:22:17,779 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:22:17,780 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:22:17,782 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:22:17,784 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:22:17,785 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:22:17,787 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:22:17,787 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:22:17,790 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:22:17,790 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:22:17,791 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:22:17,792 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:22:17,792 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:22:17,793 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:22:17,793 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:22:17,794 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:22:17,795 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:22:17,796 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:22:17,797 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:22:17,797 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:22:17,798 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:22:17,798 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:22:17,798 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:22:17,799 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:22:17,800 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:22:17,832 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:22:17,844 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:22:17,848 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:22:17,849 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:22:17,850 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:22:17,852 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/count_by_1_variant.i_2.bpl [2019-08-05 10:22:17,852 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/count_by_1_variant.i_2.bpl' [2019-08-05 10:22:17,880 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:22:17,881 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:22:17,882 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:22:17,882 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:22:17,882 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:22:17,898 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "count_by_1_variant.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:22:17" (1/1) ... [2019-08-05 10:22:17,907 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "count_by_1_variant.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:22:17" (1/1) ... [2019-08-05 10:22:17,914 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:22:17,915 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:22:17,915 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:22:17,915 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:22:17,926 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "count_by_1_variant.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:22:17" (1/1) ... [2019-08-05 10:22:17,926 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "count_by_1_variant.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:22:17" (1/1) ... [2019-08-05 10:22:17,927 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "count_by_1_variant.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:22:17" (1/1) ... [2019-08-05 10:22:17,927 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "count_by_1_variant.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:22:17" (1/1) ... [2019-08-05 10:22:17,930 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "count_by_1_variant.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:22:17" (1/1) ... [2019-08-05 10:22:17,932 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "count_by_1_variant.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:22:17" (1/1) ... [2019-08-05 10:22:17,933 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "count_by_1_variant.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:22:17" (1/1) ... [2019-08-05 10:22:17,934 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:22:17,935 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:22:17,935 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:22:17,935 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:22:17,936 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "count_by_1_variant.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:22:17" (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:22:18,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 10:22:18,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 10:22:18,239 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 10:22:18,239 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-08-05 10:22:18,240 INFO L202 PluginConnector]: Adding new model count_by_1_variant.i_2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:22:18 BoogieIcfgContainer [2019-08-05 10:22:18,240 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:22:18,242 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:22:18,242 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:22:18,245 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:22:18,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "count_by_1_variant.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:22:17" (1/2) ... [2019-08-05 10:22:18,246 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68183139 and model type count_by_1_variant.i_2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:22:18, skipping insertion in model container [2019-08-05 10:22:18,246 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "count_by_1_variant.i_2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:22:18" (2/2) ... [2019-08-05 10:22:18,249 INFO L109 eAbstractionObserver]: Analyzing ICFG count_by_1_variant.i_2.bpl [2019-08-05 10:22:18,262 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:22:18,268 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:22:18,282 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:22:18,306 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:22:18,307 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:22:18,307 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:22:18,307 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:22:18,307 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:22:18,307 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:22:18,307 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:22:18,308 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:22:18,308 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:22:18,321 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-08-05 10:22:18,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:22:18,330 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:18,331 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:22:18,333 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:18,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:18,338 INFO L82 PathProgramCache]: Analyzing trace with hash 925701, now seen corresponding path program 1 times [2019-08-05 10:22:18,379 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:18,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:18,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:22:18,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:18,464 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:22:18,546 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:22:18,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:22:18,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:22:18,556 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:22:18,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:22:18,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:22:18,573 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 4 states. [2019-08-05 10:22:18,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:18,733 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 10:22:18,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:22:18,736 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 10:22:18,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:18,747 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:22:18,748 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:22:18,750 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:22:18,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:22:18,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2019-08-05 10:22:18,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:22:18,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 10:22:18,801 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2019-08-05 10:22:18,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:18,802 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 10:22:18,805 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:22:18,806 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 10:22:18,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:22:18,806 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:18,807 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-08-05 10:22:18,807 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:18,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:18,808 INFO L82 PathProgramCache]: Analyzing trace with hash 889531649, now seen corresponding path program 1 times [2019-08-05 10:22:18,809 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:18,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:18,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:22:18,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:18,995 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:22:19,062 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:19,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:19,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:22:19,064 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:22:19,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:22:19,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:22:19,065 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 5 states. [2019-08-05 10:22:19,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:19,171 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 10:22:19,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:22:19,172 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-08-05 10:22:19,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:19,173 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:22:19,173 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:22:19,174 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:22:19,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:22:19,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2019-08-05 10:22:19,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:22:19,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 10:22:19,177 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2019-08-05 10:22:19,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:19,178 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 10:22:19,178 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:22:19,178 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 10:22:19,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:22:19,179 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:19,179 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2019-08-05 10:22:19,179 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:19,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:19,180 INFO L82 PathProgramCache]: Analyzing trace with hash 141355773, now seen corresponding path program 2 times [2019-08-05 10:22:19,181 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:19,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:19,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:22:19,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:19,283 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:22:19,299 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:19,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:19,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:22:19,300 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:22:19,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:22:19,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:22:19,301 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 6 states. [2019-08-05 10:22:19,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:19,566 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 10:22:19,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:22:19,566 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2019-08-05 10:22:19,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:19,567 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:22:19,567 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:22:19,568 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:22:19,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:22:19,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2019-08-05 10:22:19,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:22:19,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 10:22:19,571 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2019-08-05 10:22:19,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:19,571 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 10:22:19,572 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:22:19,572 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 10:22:19,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:22:19,572 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:19,572 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2019-08-05 10:22:19,573 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:19,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:19,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1596122631, now seen corresponding path program 3 times [2019-08-05 10:22:19,575 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:19,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:19,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:22:19,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:19,727 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:22:19,758 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:19,759 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:19,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:22:19,759 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:22:19,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:22:19,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:22:19,760 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 7 states. [2019-08-05 10:22:20,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:20,001 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-05 10:22:20,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:22:20,004 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2019-08-05 10:22:20,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:20,005 INFO L225 Difference]: With dead ends: 14 [2019-08-05 10:22:20,005 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 10:22:20,006 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:22:20,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 10:22:20,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-08-05 10:22:20,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:22:20,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-05 10:22:20,009 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2019-08-05 10:22:20,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:20,010 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-05 10:22:20,010 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:22:20,010 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-05 10:22:20,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:22:20,011 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:20,011 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2019-08-05 10:22:20,012 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:20,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:20,012 INFO L82 PathProgramCache]: Analyzing trace with hash -570590731, now seen corresponding path program 4 times [2019-08-05 10:22:20,013 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:20,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:20,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:22:20,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:20,150 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:22:20,166 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:20,167 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:20,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:22:20,168 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:22:20,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:22:20,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:22:20,169 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 8 states. [2019-08-05 10:22:20,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:20,292 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-05 10:22:20,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:22:20,294 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-08-05 10:22:20,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:20,297 INFO L225 Difference]: With dead ends: 16 [2019-08-05 10:22:20,297 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 10:22:20,298 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:22:20,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 10:22:20,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-08-05 10:22:20,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 10:22:20,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-05 10:22:20,301 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2019-08-05 10:22:20,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:20,301 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-05 10:22:20,301 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:22:20,301 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-05 10:22:20,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:22:20,302 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:20,302 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1] [2019-08-05 10:22:20,302 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:20,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:20,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1418054385, now seen corresponding path program 5 times [2019-08-05 10:22:20,304 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:20,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:20,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:22:20,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:20,639 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:22:20,764 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:20,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:20,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:22:20,765 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:22:20,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:22:20,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:22:20,769 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 9 states. [2019-08-05 10:22:20,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:20,969 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-05 10:22:20,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:22:20,970 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 14 [2019-08-05 10:22:20,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:20,970 INFO L225 Difference]: With dead ends: 18 [2019-08-05 10:22:20,971 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 10:22:20,971 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:22:20,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 10:22:20,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-08-05 10:22:20,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:22:20,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-05 10:22:20,975 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2019-08-05 10:22:20,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:20,975 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-05 10:22:20,976 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:22:20,976 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-05 10:22:20,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:22:20,976 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:20,977 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1] [2019-08-05 10:22:20,977 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:20,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:20,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1245564141, now seen corresponding path program 6 times [2019-08-05 10:22:20,978 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:21,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:21,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:22:21,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:21,139 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:22:21,148 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:21,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:21,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:22:21,149 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:22:21,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:22:21,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:22:21,150 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 10 states. [2019-08-05 10:22:21,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:21,359 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-05 10:22:21,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:22:21,360 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-05 10:22:21,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:21,361 INFO L225 Difference]: With dead ends: 20 [2019-08-05 10:22:21,361 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 10:22:21,362 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=164, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:22:21,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 10:22:21,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-08-05 10:22:21,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:22:21,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-05 10:22:21,366 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2019-08-05 10:22:21,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:21,366 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-05 10:22:21,367 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:22:21,367 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-05 10:22:21,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:22:21,367 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:21,368 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1] [2019-08-05 10:22:21,368 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:21,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:21,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1308803095, now seen corresponding path program 7 times [2019-08-05 10:22:21,369 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:21,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:21,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:22:21,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:21,524 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:22:21,548 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:21,548 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:21,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:22:21,549 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:22:21,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:22:21,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:22:21,549 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 11 states. [2019-08-05 10:22:21,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:21,795 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-05 10:22:21,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:22:21,796 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2019-08-05 10:22:21,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:21,797 INFO L225 Difference]: With dead ends: 22 [2019-08-05 10:22:21,797 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 10:22:21,797 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=135, Invalid=207, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:22:21,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 10:22:21,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-08-05 10:22:21,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 10:22:21,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-05 10:22:21,800 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2019-08-05 10:22:21,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:21,800 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-05 10:22:21,800 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:22:21,801 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-05 10:22:21,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:22:21,801 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:21,801 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1] [2019-08-05 10:22:21,801 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:21,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:21,802 INFO L82 PathProgramCache]: Analyzing trace with hash 665576421, now seen corresponding path program 8 times [2019-08-05 10:22:21,803 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:21,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:21,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:22:21,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:21,931 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:22:21,940 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:21,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:21,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:22:21,942 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:22:21,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:22:21,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:22:21,943 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 12 states. [2019-08-05 10:22:22,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:22,105 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-08-05 10:22:22,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:22:22,106 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2019-08-05 10:22:22,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:22,107 INFO L225 Difference]: With dead ends: 24 [2019-08-05 10:22:22,107 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 10:22:22,108 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=165, Invalid=255, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:22:22,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 10:22:22,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-08-05 10:22:22,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 10:22:22,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-08-05 10:22:22,112 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2019-08-05 10:22:22,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:22,113 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-08-05 10:22:22,113 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:22:22,113 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-08-05 10:22:22,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:22:22,114 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:22,114 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1] [2019-08-05 10:22:22,114 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:22,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:22,115 INFO L82 PathProgramCache]: Analyzing trace with hash -331253535, now seen corresponding path program 9 times [2019-08-05 10:22:22,116 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:22,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:22,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:22:22,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:22,321 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:22:22,329 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:22,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:22,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:22:22,330 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:22:22,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:22:22,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:22:22,331 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 13 states. [2019-08-05 10:22:22,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:22,527 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-08-05 10:22:22,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:22:22,529 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 22 [2019-08-05 10:22:22,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:22,530 INFO L225 Difference]: With dead ends: 26 [2019-08-05 10:22:22,530 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 10:22:22,531 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=198, Invalid=308, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:22:22,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 10:22:22,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-08-05 10:22:22,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 10:22:22,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-08-05 10:22:22,533 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2019-08-05 10:22:22,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:22,534 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-08-05 10:22:22,534 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:22:22,534 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-08-05 10:22:22,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:22:22,534 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:22,535 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1] [2019-08-05 10:22:22,535 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:22,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:22,535 INFO L82 PathProgramCache]: Analyzing trace with hash -507134243, now seen corresponding path program 10 times [2019-08-05 10:22:22,536 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:22,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:22,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 10:22:22,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:22,727 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:22:22,745 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:22,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:22,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:22:22,746 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:22:22,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:22:22,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:22:22,747 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 14 states. [2019-08-05 10:22:23,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:23,221 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-08-05 10:22:23,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:22:23,221 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2019-08-05 10:22:23,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:23,223 INFO L225 Difference]: With dead ends: 28 [2019-08-05 10:22:23,223 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 10:22:23,224 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=234, Invalid=366, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:22:23,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 10:22:23,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-08-05 10:22:23,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 10:22:23,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-08-05 10:22:23,229 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2019-08-05 10:22:23,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:23,230 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-08-05 10:22:23,230 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:22:23,230 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-08-05 10:22:23,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:22:23,231 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:23,231 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1] [2019-08-05 10:22:23,231 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:23,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:23,231 INFO L82 PathProgramCache]: Analyzing trace with hash -2024770087, now seen corresponding path program 11 times [2019-08-05 10:22:23,232 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:23,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:23,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 10:22:23,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:23,544 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:22:23,558 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:23,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:23,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:22:23,559 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:22:23,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:22:23,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:22:23,560 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 15 states. [2019-08-05 10:22:23,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:23,952 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-08-05 10:22:23,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:22:23,953 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 26 [2019-08-05 10:22:23,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:23,954 INFO L225 Difference]: With dead ends: 30 [2019-08-05 10:22:23,954 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 10:22:23,954 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=273, Invalid=429, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:22:23,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 10:22:23,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-08-05 10:22:23,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 10:22:23,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-08-05 10:22:23,957 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2019-08-05 10:22:23,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:23,958 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-08-05 10:22:23,958 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:22:23,958 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-08-05 10:22:23,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:22:23,959 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:23,959 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1] [2019-08-05 10:22:23,960 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:23,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:23,960 INFO L82 PathProgramCache]: Analyzing trace with hash -183935531, now seen corresponding path program 12 times [2019-08-05 10:22:23,961 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:23,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:23,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:22:23,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:24,135 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:22:24,146 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:24,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:24,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:22:24,147 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:22:24,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:22:24,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=133, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:22:24,148 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 16 states. [2019-08-05 10:22:24,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:24,643 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-08-05 10:22:24,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:22:24,644 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 28 [2019-08-05 10:22:24,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:24,645 INFO L225 Difference]: With dead ends: 32 [2019-08-05 10:22:24,645 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 10:22:24,646 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=315, Invalid=497, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:22:24,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 10:22:24,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-08-05 10:22:24,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 10:22:24,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-08-05 10:22:24,650 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 28 [2019-08-05 10:22:24,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:24,651 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-08-05 10:22:24,651 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:22:24,651 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-08-05 10:22:24,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:22:24,652 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:24,652 INFO L399 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1] [2019-08-05 10:22:24,652 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:24,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:24,653 INFO L82 PathProgramCache]: Analyzing trace with hash -668453167, now seen corresponding path program 13 times [2019-08-05 10:22:24,654 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:24,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:24,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:22:24,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:24,924 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:22:24,947 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:24,947 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:24,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:22:24,947 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:22:24,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:22:24,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=150, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:22:24,948 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 17 states. [2019-08-05 10:22:25,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:25,183 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-08-05 10:22:25,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:22:25,183 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2019-08-05 10:22:25,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:25,185 INFO L225 Difference]: With dead ends: 34 [2019-08-05 10:22:25,185 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 10:22:25,186 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=360, Invalid=570, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:22:25,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 10:22:25,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-08-05 10:22:25,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 10:22:25,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-08-05 10:22:25,190 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 30 [2019-08-05 10:22:25,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:25,190 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-08-05 10:22:25,191 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:22:25,191 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-08-05 10:22:25,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:22:25,191 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:25,192 INFO L399 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1] [2019-08-05 10:22:25,192 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:25,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:25,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1861533901, now seen corresponding path program 14 times [2019-08-05 10:22:25,193 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:25,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:25,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 10:22:25,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:25,384 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:22:25,395 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:25,396 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:25,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:22:25,396 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:22:25,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:22:25,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=168, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:22:25,397 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 18 states. [2019-08-05 10:22:25,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:25,705 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-08-05 10:22:25,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:22:25,706 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 32 [2019-08-05 10:22:25,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:25,706 INFO L225 Difference]: With dead ends: 36 [2019-08-05 10:22:25,707 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 10:22:25,707 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=408, Invalid=648, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:22:25,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 10:22:25,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2019-08-05 10:22:25,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 10:22:25,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-08-05 10:22:25,710 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 32 [2019-08-05 10:22:25,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:25,711 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-08-05 10:22:25,711 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:22:25,711 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-08-05 10:22:25,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 10:22:25,711 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:25,712 INFO L399 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1] [2019-08-05 10:22:25,712 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:25,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:25,712 INFO L82 PathProgramCache]: Analyzing trace with hash -2067350583, now seen corresponding path program 15 times [2019-08-05 10:22:25,713 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:25,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:25,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 10:22:25,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:25,913 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:22:25,923 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:25,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:25,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:22:25,924 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:22:25,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:22:25,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=187, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:22:25,925 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 19 states. [2019-08-05 10:22:26,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:26,200 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-08-05 10:22:26,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:22:26,204 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 34 [2019-08-05 10:22:26,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:26,204 INFO L225 Difference]: With dead ends: 38 [2019-08-05 10:22:26,204 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 10:22:26,205 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=459, Invalid=731, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:22:26,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 10:22:26,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2019-08-05 10:22:26,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 10:22:26,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-08-05 10:22:26,208 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 34 [2019-08-05 10:22:26,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:26,208 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-08-05 10:22:26,208 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:22:26,208 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-08-05 10:22:26,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 10:22:26,209 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:26,209 INFO L399 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1] [2019-08-05 10:22:26,209 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:26,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:26,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1845880773, now seen corresponding path program 16 times [2019-08-05 10:22:26,210 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:26,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:26,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 10:22:26,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:26,646 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:22:26,658 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:26,659 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:26,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:22:26,659 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:22:26,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:22:26,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=207, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:22:26,660 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 20 states. [2019-08-05 10:22:27,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:27,038 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-08-05 10:22:27,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:22:27,039 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 36 [2019-08-05 10:22:27,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:27,039 INFO L225 Difference]: With dead ends: 40 [2019-08-05 10:22:27,039 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 10:22:27,040 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=513, Invalid=819, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:22:27,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 10:22:27,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2019-08-05 10:22:27,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 10:22:27,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-08-05 10:22:27,044 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 36 [2019-08-05 10:22:27,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:27,044 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-08-05 10:22:27,044 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:22:27,044 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-08-05 10:22:27,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 10:22:27,045 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:27,045 INFO L399 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1] [2019-08-05 10:22:27,045 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:27,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:27,046 INFO L82 PathProgramCache]: Analyzing trace with hash 69862593, now seen corresponding path program 17 times [2019-08-05 10:22:27,046 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:27,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:27,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:22:27,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:27,317 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:22:27,336 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:27,336 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:27,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:22:27,337 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:22:27,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:22:27,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=228, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:22:27,338 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 21 states. [2019-08-05 10:22:27,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:27,711 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-08-05 10:22:27,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:22:27,712 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 38 [2019-08-05 10:22:27,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:27,713 INFO L225 Difference]: With dead ends: 42 [2019-08-05 10:22:27,713 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 10:22:27,714 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=570, Invalid=912, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:22:27,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 10:22:27,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2019-08-05 10:22:27,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 10:22:27,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-08-05 10:22:27,718 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 38 [2019-08-05 10:22:27,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:27,718 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-08-05 10:22:27,718 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:22:27,718 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-08-05 10:22:27,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 10:22:27,719 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:27,719 INFO L399 BasicCegarLoop]: trace histogram [19, 18, 1, 1, 1] [2019-08-05 10:22:27,719 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:27,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:27,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1581591875, now seen corresponding path program 18 times [2019-08-05 10:22:27,720 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:27,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:27,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 10:22:27,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:27,987 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:22:27,999 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:27,999 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:28,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:22:28,000 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:22:28,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:22:28,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=250, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:22:28,001 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 22 states. [2019-08-05 10:22:28,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:28,647 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-08-05 10:22:28,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:22:28,647 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 40 [2019-08-05 10:22:28,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:28,648 INFO L225 Difference]: With dead ends: 44 [2019-08-05 10:22:28,648 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 10:22:28,650 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=630, Invalid=1010, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:22:28,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 10:22:28,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2019-08-05 10:22:28,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 10:22:28,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-08-05 10:22:28,653 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 40 [2019-08-05 10:22:28,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:28,654 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-08-05 10:22:28,654 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:22:28,654 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-08-05 10:22:28,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 10:22:28,655 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:28,655 INFO L399 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1] [2019-08-05 10:22:28,655 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:28,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:28,655 INFO L82 PathProgramCache]: Analyzing trace with hash 508563897, now seen corresponding path program 19 times [2019-08-05 10:22:28,656 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:28,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:28,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 10:22:28,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:28,967 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:22:28,981 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:28,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:28,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:22:28,981 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:22:28,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:22:28,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=273, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:22:28,982 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 23 states. [2019-08-05 10:22:29,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:29,561 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-08-05 10:22:29,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:22:29,562 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 42 [2019-08-05 10:22:29,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:29,562 INFO L225 Difference]: With dead ends: 46 [2019-08-05 10:22:29,563 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 10:22:29,564 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=693, Invalid=1113, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:22:29,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 10:22:29,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2019-08-05 10:22:29,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 10:22:29,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-08-05 10:22:29,568 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 42 [2019-08-05 10:22:29,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:29,568 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-08-05 10:22:29,568 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:22:29,569 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-08-05 10:22:29,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 10:22:29,569 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:29,569 INFO L399 BasicCegarLoop]: trace histogram [21, 20, 1, 1, 1] [2019-08-05 10:22:29,569 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:29,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:29,570 INFO L82 PathProgramCache]: Analyzing trace with hash -896433739, now seen corresponding path program 20 times [2019-08-05 10:22:29,571 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:29,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:29,590 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 10:22:29,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:30,017 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:22:30,028 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:30,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:30,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:22:30,029 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:22:30,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:22:30,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=297, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:22:30,030 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 24 states. [2019-08-05 10:22:30,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:30,528 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-08-05 10:22:30,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:22:30,528 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 44 [2019-08-05 10:22:30,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:30,529 INFO L225 Difference]: With dead ends: 48 [2019-08-05 10:22:30,529 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 10:22:30,530 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=759, Invalid=1221, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:22:30,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 10:22:30,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2019-08-05 10:22:30,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 10:22:30,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-08-05 10:22:30,533 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 44 [2019-08-05 10:22:30,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:30,533 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-08-05 10:22:30,534 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:22:30,534 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-08-05 10:22:30,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 10:22:30,534 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:30,534 INFO L399 BasicCegarLoop]: trace histogram [22, 21, 1, 1, 1] [2019-08-05 10:22:30,535 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:30,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:30,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1815536305, now seen corresponding path program 21 times [2019-08-05 10:22:30,536 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:30,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:30,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 10:22:30,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:31,044 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:22:31,058 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:31,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:31,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:22:31,058 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:22:31,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:22:31,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=322, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:22:31,059 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 25 states. [2019-08-05 10:22:31,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:31,495 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-08-05 10:22:31,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:22:31,498 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 46 [2019-08-05 10:22:31,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:31,498 INFO L225 Difference]: With dead ends: 50 [2019-08-05 10:22:31,499 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 10:22:31,500 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=828, Invalid=1334, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:22:31,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 10:22:31,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2019-08-05 10:22:31,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 10:22:31,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-08-05 10:22:31,502 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 46 [2019-08-05 10:22:31,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:31,503 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-08-05 10:22:31,503 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:22:31,503 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-08-05 10:22:31,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 10:22:31,503 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:31,503 INFO L399 BasicCegarLoop]: trace histogram [23, 22, 1, 1, 1] [2019-08-05 10:22:31,504 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:31,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:31,504 INFO L82 PathProgramCache]: Analyzing trace with hash 973599917, now seen corresponding path program 22 times [2019-08-05 10:22:31,505 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:31,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:31,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 10:22:31,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:32,804 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:22:32,817 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:32,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:32,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:22:32,818 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:22:32,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:22:32,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=302, Invalid=348, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:22:32,819 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 26 states. [2019-08-05 10:22:33,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:33,240 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-08-05 10:22:33,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:22:33,241 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 48 [2019-08-05 10:22:33,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:33,241 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:22:33,242 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 10:22:33,243 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=900, Invalid=1452, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:22:33,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 10:22:33,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2019-08-05 10:22:33,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 10:22:33,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-08-05 10:22:33,248 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 48 [2019-08-05 10:22:33,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:33,248 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-08-05 10:22:33,248 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:22:33,248 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-08-05 10:22:33,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 10:22:33,249 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:33,249 INFO L399 BasicCegarLoop]: trace histogram [24, 23, 1, 1, 1] [2019-08-05 10:22:33,249 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:33,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:33,249 INFO L82 PathProgramCache]: Analyzing trace with hash -673417303, now seen corresponding path program 23 times [2019-08-05 10:22:33,250 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:33,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:33,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 10:22:33,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:33,706 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:22:33,768 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:33,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:33,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:22:33,768 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:22:33,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:22:33,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=327, Invalid=375, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:22:33,769 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 27 states. [2019-08-05 10:22:34,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:34,369 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-08-05 10:22:34,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:22:34,369 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 50 [2019-08-05 10:22:34,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:34,370 INFO L225 Difference]: With dead ends: 54 [2019-08-05 10:22:34,370 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:22:34,372 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=975, Invalid=1575, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:22:34,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:22:34,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2019-08-05 10:22:34,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 10:22:34,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-08-05 10:22:34,375 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 50 [2019-08-05 10:22:34,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:34,375 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-08-05 10:22:34,375 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:22:34,375 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-08-05 10:22:34,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 10:22:34,376 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:34,376 INFO L399 BasicCegarLoop]: trace histogram [25, 24, 1, 1, 1] [2019-08-05 10:22:34,376 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:34,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:34,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1385966501, now seen corresponding path program 24 times [2019-08-05 10:22:34,377 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:34,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:34,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 10:22:34,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:34,787 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:22:34,800 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:34,800 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:34,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 10:22:34,801 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:22:34,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:22:34,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=353, Invalid=403, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:22:34,802 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 28 states. [2019-08-05 10:22:35,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:35,377 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-08-05 10:22:35,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:22:35,378 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 52 [2019-08-05 10:22:35,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:35,379 INFO L225 Difference]: With dead ends: 56 [2019-08-05 10:22:35,379 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 10:22:35,381 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1053, Invalid=1703, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:22:35,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 10:22:35,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2019-08-05 10:22:35,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 10:22:35,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-08-05 10:22:35,384 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 52 [2019-08-05 10:22:35,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:35,384 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-08-05 10:22:35,384 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:22:35,385 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-08-05 10:22:35,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 10:22:35,385 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:35,385 INFO L399 BasicCegarLoop]: trace histogram [26, 25, 1, 1, 1] [2019-08-05 10:22:35,386 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:35,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:35,386 INFO L82 PathProgramCache]: Analyzing trace with hash 473878689, now seen corresponding path program 25 times [2019-08-05 10:22:35,387 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:35,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:35,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 10:22:35,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:35,824 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:22:35,839 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:35,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:35,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 10:22:35,840 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 10:22:35,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 10:22:35,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=380, Invalid=432, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:22:35,841 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 29 states. [2019-08-05 10:22:36,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:36,363 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-08-05 10:22:36,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 10:22:36,363 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 54 [2019-08-05 10:22:36,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:36,364 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:22:36,364 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 10:22:36,366 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1134, Invalid=1836, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:22:36,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 10:22:36,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2019-08-05 10:22:36,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 10:22:36,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-08-05 10:22:36,369 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 54 [2019-08-05 10:22:36,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:36,369 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-08-05 10:22:36,369 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 10:22:36,369 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-08-05 10:22:36,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-05 10:22:36,370 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:36,370 INFO L399 BasicCegarLoop]: trace histogram [27, 26, 1, 1, 1] [2019-08-05 10:22:36,370 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:36,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:36,370 INFO L82 PathProgramCache]: Analyzing trace with hash 130819741, now seen corresponding path program 26 times [2019-08-05 10:22:36,371 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:36,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:36,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 10:22:36,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:36,736 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:22:36,750 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:36,750 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:36,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 10:22:36,751 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:22:36,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:22:36,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=408, Invalid=462, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:22:36,752 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 30 states. [2019-08-05 10:22:37,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:37,384 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-08-05 10:22:37,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 10:22:37,384 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 56 [2019-08-05 10:22:37,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:37,385 INFO L225 Difference]: With dead ends: 60 [2019-08-05 10:22:37,385 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:22:37,387 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1218, Invalid=1974, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:22:37,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:22:37,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2019-08-05 10:22:37,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 10:22:37,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-08-05 10:22:37,389 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 56 [2019-08-05 10:22:37,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:37,390 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-08-05 10:22:37,390 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:22:37,390 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-08-05 10:22:37,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 10:22:37,391 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:37,391 INFO L399 BasicCegarLoop]: trace histogram [28, 27, 1, 1, 1] [2019-08-05 10:22:37,391 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:37,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:37,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1163652505, now seen corresponding path program 27 times [2019-08-05 10:22:37,392 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:37,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:37,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 10:22:37,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:37,831 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:22:37,845 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:37,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:37,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 10:22:37,846 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 10:22:37,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 10:22:37,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=437, Invalid=493, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:22:37,846 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 31 states. [2019-08-05 10:22:38,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:38,471 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-08-05 10:22:38,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:22:38,472 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 58 [2019-08-05 10:22:38,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:38,473 INFO L225 Difference]: With dead ends: 62 [2019-08-05 10:22:38,473 INFO L226 Difference]: Without dead ends: 62 [2019-08-05 10:22:38,475 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 405 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1305, Invalid=2117, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:22:38,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-05 10:22:38,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2019-08-05 10:22:38,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 10:22:38,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-08-05 10:22:38,478 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 58 [2019-08-05 10:22:38,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:38,478 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-08-05 10:22:38,478 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 10:22:38,478 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-08-05 10:22:38,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 10:22:38,479 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:38,479 INFO L399 BasicCegarLoop]: trace histogram [29, 28, 1, 1, 1] [2019-08-05 10:22:38,479 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:38,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:38,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1578493333, now seen corresponding path program 28 times [2019-08-05 10:22:38,480 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:38,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:38,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 10:22:38,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:39,246 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:22:39,263 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:39,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:39,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 10:22:39,264 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:22:39,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:22:39,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=467, Invalid=525, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:22:39,265 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 32 states. [2019-08-05 10:22:39,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:39,901 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-08-05 10:22:39,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 10:22:39,902 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 60 [2019-08-05 10:22:39,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:39,903 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:22:39,903 INFO L226 Difference]: Without dead ends: 64 [2019-08-05 10:22:39,905 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1395, Invalid=2265, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:22:39,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-05 10:22:39,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2019-08-05 10:22:39,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 10:22:39,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-08-05 10:22:39,908 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 60 [2019-08-05 10:22:39,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:39,908 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-08-05 10:22:39,908 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:22:39,908 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-08-05 10:22:39,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-05 10:22:39,909 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:39,909 INFO L399 BasicCegarLoop]: trace histogram [30, 29, 1, 1, 1] [2019-08-05 10:22:39,909 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:39,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:39,909 INFO L82 PathProgramCache]: Analyzing trace with hash 808570513, now seen corresponding path program 29 times [2019-08-05 10:22:39,910 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:39,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:39,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 10:22:39,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:40,352 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:22:40,371 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:40,371 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:40,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:22:40,372 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 10:22:40,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 10:22:40,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=498, Invalid=558, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:22:40,373 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 33 states. [2019-08-05 10:22:41,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:41,004 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-08-05 10:22:41,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:22:41,005 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 62 [2019-08-05 10:22:41,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:41,006 INFO L225 Difference]: With dead ends: 66 [2019-08-05 10:22:41,006 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:22:41,008 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 464 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1488, Invalid=2418, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:22:41,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:22:41,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2019-08-05 10:22:41,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 10:22:41,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-08-05 10:22:41,010 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 62 [2019-08-05 10:22:41,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:41,010 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-08-05 10:22:41,010 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 10:22:41,010 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-08-05 10:22:41,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-05 10:22:41,011 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:41,011 INFO L399 BasicCegarLoop]: trace histogram [31, 30, 1, 1, 1] [2019-08-05 10:22:41,011 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:41,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:41,011 INFO L82 PathProgramCache]: Analyzing trace with hash -352884595, now seen corresponding path program 30 times [2019-08-05 10:22:41,012 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:41,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:41,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 10:22:41,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:41,528 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:22:41,545 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:41,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:41,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:22:41,546 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:22:41,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:22:41,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=530, Invalid=592, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:22:41,546 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 34 states. [2019-08-05 10:22:42,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:42,235 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-08-05 10:22:42,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 10:22:42,237 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 64 [2019-08-05 10:22:42,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:42,238 INFO L225 Difference]: With dead ends: 68 [2019-08-05 10:22:42,238 INFO L226 Difference]: Without dead ends: 68 [2019-08-05 10:22:42,240 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 495 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1584, Invalid=2576, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:22:42,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-05 10:22:42,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2019-08-05 10:22:42,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 10:22:42,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-08-05 10:22:42,242 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 64 [2019-08-05 10:22:42,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:42,242 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-08-05 10:22:42,242 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:22:42,242 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-08-05 10:22:42,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-05 10:22:42,243 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:42,243 INFO L399 BasicCegarLoop]: trace histogram [32, 31, 1, 1, 1] [2019-08-05 10:22:42,243 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:42,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:42,243 INFO L82 PathProgramCache]: Analyzing trace with hash 180253577, now seen corresponding path program 31 times [2019-08-05 10:22:42,244 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:42,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:42,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 10:22:42,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:42,950 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:22:42,966 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:42,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:42,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 10:22:42,966 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:22:42,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:22:42,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=563, Invalid=627, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:22:42,967 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 35 states. [2019-08-05 10:22:43,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:43,705 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-08-05 10:22:43,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 10:22:43,705 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 66 [2019-08-05 10:22:43,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:43,706 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:22:43,707 INFO L226 Difference]: Without dead ends: 70 [2019-08-05 10:22:43,709 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 527 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1683, Invalid=2739, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:22:43,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-05 10:22:43,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2019-08-05 10:22:43,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 10:22:43,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-08-05 10:22:43,711 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 66 [2019-08-05 10:22:43,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:43,712 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-08-05 10:22:43,712 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:22:43,712 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-08-05 10:22:43,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 10:22:43,712 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:43,712 INFO L399 BasicCegarLoop]: trace histogram [33, 32, 1, 1, 1] [2019-08-05 10:22:43,713 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:43,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:43,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1424928645, now seen corresponding path program 32 times [2019-08-05 10:22:43,714 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:43,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:43,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 10:22:43,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:44,338 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:22:44,356 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:44,357 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:44,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:22:44,357 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 10:22:44,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 10:22:44,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=597, Invalid=663, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:22:44,358 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 36 states. [2019-08-05 10:22:45,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:45,078 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-08-05 10:22:45,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 10:22:45,078 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 68 [2019-08-05 10:22:45,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:45,079 INFO L225 Difference]: With dead ends: 72 [2019-08-05 10:22:45,079 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 10:22:45,082 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1785, Invalid=2907, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:22:45,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 10:22:45,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2019-08-05 10:22:45,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 10:22:45,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-08-05 10:22:45,084 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 68 [2019-08-05 10:22:45,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:45,085 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-08-05 10:22:45,085 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 10:22:45,085 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-08-05 10:22:45,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 10:22:45,085 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:45,085 INFO L399 BasicCegarLoop]: trace histogram [34, 33, 1, 1, 1] [2019-08-05 10:22:45,086 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:45,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:45,086 INFO L82 PathProgramCache]: Analyzing trace with hash -738206591, now seen corresponding path program 33 times [2019-08-05 10:22:45,087 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:45,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:45,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 10:22:45,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:46,708 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:22:46,725 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:46,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:46,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 10:22:46,726 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 10:22:46,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 10:22:46,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=632, Invalid=700, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:22:46,727 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 37 states. [2019-08-05 10:22:47,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:47,520 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-08-05 10:22:47,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 10:22:47,521 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 70 [2019-08-05 10:22:47,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:47,521 INFO L225 Difference]: With dead ends: 74 [2019-08-05 10:22:47,521 INFO L226 Difference]: Without dead ends: 74 [2019-08-05 10:22:47,522 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 594 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1890, Invalid=3080, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:22:47,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-05 10:22:47,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2019-08-05 10:22:47,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 10:22:47,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-08-05 10:22:47,525 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 70 [2019-08-05 10:22:47,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:47,525 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-08-05 10:22:47,525 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 10:22:47,525 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-08-05 10:22:47,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-05 10:22:47,526 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:47,526 INFO L399 BasicCegarLoop]: trace histogram [35, 34, 1, 1, 1] [2019-08-05 10:22:47,526 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:47,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:47,527 INFO L82 PathProgramCache]: Analyzing trace with hash -746997123, now seen corresponding path program 34 times [2019-08-05 10:22:47,527 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:47,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:47,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-05 10:22:47,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:48,406 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:22:48,426 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:48,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:48,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:22:48,426 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 10:22:48,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 10:22:48,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=668, Invalid=738, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:22:48,427 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 38 states. [2019-08-05 10:22:49,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:49,388 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-08-05 10:22:49,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 10:22:49,388 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 72 [2019-08-05 10:22:49,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:49,389 INFO L225 Difference]: With dead ends: 76 [2019-08-05 10:22:49,389 INFO L226 Difference]: Without dead ends: 76 [2019-08-05 10:22:49,390 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 629 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1998, Invalid=3258, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:22:49,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-05 10:22:49,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2019-08-05 10:22:49,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 10:22:49,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-08-05 10:22:49,393 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 72 [2019-08-05 10:22:49,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:49,393 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-08-05 10:22:49,394 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 10:22:49,394 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-08-05 10:22:49,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-05 10:22:49,394 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:49,394 INFO L399 BasicCegarLoop]: trace histogram [36, 35, 1, 1, 1] [2019-08-05 10:22:49,395 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:49,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:49,395 INFO L82 PathProgramCache]: Analyzing trace with hash -604763783, now seen corresponding path program 35 times [2019-08-05 10:22:49,395 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:49,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:49,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 10:22:49,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:50,255 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:22:50,274 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:50,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:50,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 10:22:50,274 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 10:22:50,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 10:22:50,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=705, Invalid=777, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:22:50,275 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 39 states. [2019-08-05 10:22:51,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:51,155 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-08-05 10:22:51,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 10:22:51,156 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 74 [2019-08-05 10:22:51,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:51,157 INFO L225 Difference]: With dead ends: 78 [2019-08-05 10:22:51,157 INFO L226 Difference]: Without dead ends: 78 [2019-08-05 10:22:51,158 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 665 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2109, Invalid=3441, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:22:51,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-05 10:22:51,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2019-08-05 10:22:51,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 10:22:51,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-08-05 10:22:51,160 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 74 [2019-08-05 10:22:51,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:51,161 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-08-05 10:22:51,161 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 10:22:51,161 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-08-05 10:22:51,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-05 10:22:51,161 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:51,161 INFO L399 BasicCegarLoop]: trace histogram [37, 36, 1, 1, 1] [2019-08-05 10:22:51,161 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:51,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:51,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1357477515, now seen corresponding path program 36 times [2019-08-05 10:22:51,162 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:51,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:51,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 10:22:51,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:52,039 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:22:52,058 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:52,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:52,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 10:22:52,059 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 10:22:52,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 10:22:52,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=743, Invalid=817, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:22:52,060 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 40 states. [2019-08-05 10:22:52,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:52,936 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-08-05 10:22:52,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 10:22:52,936 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 76 [2019-08-05 10:22:52,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:52,937 INFO L225 Difference]: With dead ends: 80 [2019-08-05 10:22:52,937 INFO L226 Difference]: Without dead ends: 80 [2019-08-05 10:22:52,938 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 702 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2223, Invalid=3629, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:22:52,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-05 10:22:52,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2019-08-05 10:22:52,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 10:22:52,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-08-05 10:22:52,941 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 76 [2019-08-05 10:22:52,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:52,941 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-08-05 10:22:52,941 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 10:22:52,941 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-08-05 10:22:52,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-05 10:22:52,942 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:52,942 INFO L399 BasicCegarLoop]: trace histogram [38, 37, 1, 1, 1] [2019-08-05 10:22:52,942 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:52,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:52,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1134099057, now seen corresponding path program 37 times [2019-08-05 10:22:52,943 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:52,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:52,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 10:22:52,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:54,726 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:22:54,747 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:54,748 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:54,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 10:22:54,748 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 10:22:54,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 10:22:54,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=782, Invalid=858, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:22:54,749 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 41 states. [2019-08-05 10:22:55,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:55,723 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-08-05 10:22:55,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 10:22:55,723 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 78 [2019-08-05 10:22:55,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:55,724 INFO L225 Difference]: With dead ends: 82 [2019-08-05 10:22:55,724 INFO L226 Difference]: Without dead ends: 82 [2019-08-05 10:22:55,725 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 740 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2340, Invalid=3822, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:22:55,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-05 10:22:55,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2019-08-05 10:22:55,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 10:22:55,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-08-05 10:22:55,728 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 78 [2019-08-05 10:22:55,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:55,728 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-08-05 10:22:55,728 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 10:22:55,728 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-08-05 10:22:55,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-08-05 10:22:55,729 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:55,729 INFO L399 BasicCegarLoop]: trace histogram [39, 38, 1, 1, 1] [2019-08-05 10:22:55,729 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:55,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:55,729 INFO L82 PathProgramCache]: Analyzing trace with hash -1052566419, now seen corresponding path program 38 times [2019-08-05 10:22:55,730 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:55,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:55,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 10:22:55,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:56,408 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:22:56,435 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:56,436 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:56,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 10:22:56,436 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:22:56,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:22:56,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=822, Invalid=900, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:22:56,437 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 42 states. [2019-08-05 10:22:57,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:57,386 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-08-05 10:22:57,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 10:22:57,387 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 80 [2019-08-05 10:22:57,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:57,388 INFO L225 Difference]: With dead ends: 84 [2019-08-05 10:22:57,388 INFO L226 Difference]: Without dead ends: 84 [2019-08-05 10:22:57,389 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 779 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2460, Invalid=4020, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:22:57,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-08-05 10:22:57,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2019-08-05 10:22:57,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-05 10:22:57,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-08-05 10:22:57,391 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 80 [2019-08-05 10:22:57,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:57,391 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2019-08-05 10:22:57,391 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:22:57,391 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-08-05 10:22:57,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-08-05 10:22:57,392 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:57,392 INFO L399 BasicCegarLoop]: trace histogram [40, 39, 1, 1, 1] [2019-08-05 10:22:57,392 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:57,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:57,393 INFO L82 PathProgramCache]: Analyzing trace with hash 2095886185, now seen corresponding path program 39 times [2019-08-05 10:22:57,393 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:57,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:57,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 10:22:57,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:58,059 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:22:58,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:58,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:58,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 10:22:58,081 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 10:22:58,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 10:22:58,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=863, Invalid=943, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:22:58,082 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 43 states. [2019-08-05 10:22:59,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:59,140 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-08-05 10:22:59,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:22:59,140 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 82 [2019-08-05 10:22:59,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:59,141 INFO L225 Difference]: With dead ends: 86 [2019-08-05 10:22:59,141 INFO L226 Difference]: Without dead ends: 86 [2019-08-05 10:22:59,143 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 819 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2583, Invalid=4223, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:22:59,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-08-05 10:22:59,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2019-08-05 10:22:59,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-05 10:22:59,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-08-05 10:22:59,145 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 82 [2019-08-05 10:22:59,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:59,146 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-08-05 10:22:59,146 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 10:22:59,146 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-08-05 10:22:59,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-08-05 10:22:59,147 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:59,147 INFO L399 BasicCegarLoop]: trace histogram [41, 40, 1, 1, 1] [2019-08-05 10:22:59,147 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:59,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:59,147 INFO L82 PathProgramCache]: Analyzing trace with hash -193105051, now seen corresponding path program 40 times [2019-08-05 10:22:59,148 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:59,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:59,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 10:22:59,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:00,070 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:00,095 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:00,095 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:00,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 10:23:00,095 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 10:23:00,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 10:23:00,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=905, Invalid=987, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:23:00,096 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 44 states. [2019-08-05 10:23:01,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:01,143 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2019-08-05 10:23:01,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 10:23:01,144 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 84 [2019-08-05 10:23:01,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:01,145 INFO L225 Difference]: With dead ends: 88 [2019-08-05 10:23:01,145 INFO L226 Difference]: Without dead ends: 88 [2019-08-05 10:23:01,146 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 860 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2709, Invalid=4431, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 10:23:01,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-08-05 10:23:01,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2019-08-05 10:23:01,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-08-05 10:23:01,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2019-08-05 10:23:01,148 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 84 [2019-08-05 10:23:01,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:01,149 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2019-08-05 10:23:01,149 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 10:23:01,149 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2019-08-05 10:23:01,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-08-05 10:23:01,149 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:01,149 INFO L399 BasicCegarLoop]: trace histogram [42, 41, 1, 1, 1] [2019-08-05 10:23:01,150 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:01,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:01,150 INFO L82 PathProgramCache]: Analyzing trace with hash -890427295, now seen corresponding path program 41 times [2019-08-05 10:23:01,151 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:01,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:01,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-05 10:23:01,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:02,250 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:02,273 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:02,273 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:02,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 10:23:02,274 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 10:23:02,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 10:23:02,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=948, Invalid=1032, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:23:02,274 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 45 states. [2019-08-05 10:23:03,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:03,415 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-08-05 10:23:03,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 10:23:03,415 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 86 [2019-08-05 10:23:03,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:03,416 INFO L225 Difference]: With dead ends: 90 [2019-08-05 10:23:03,416 INFO L226 Difference]: Without dead ends: 90 [2019-08-05 10:23:03,417 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 902 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2838, Invalid=4644, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 10:23:03,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-08-05 10:23:03,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2019-08-05 10:23:03,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-08-05 10:23:03,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-08-05 10:23:03,420 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 86 [2019-08-05 10:23:03,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:03,420 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2019-08-05 10:23:03,420 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 10:23:03,420 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-08-05 10:23:03,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-08-05 10:23:03,420 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:03,420 INFO L399 BasicCegarLoop]: trace histogram [43, 42, 1, 1, 1] [2019-08-05 10:23:03,421 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:03,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:03,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1002205603, now seen corresponding path program 42 times [2019-08-05 10:23:03,421 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:03,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:03,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-05 10:23:03,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:04,206 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:04,229 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:04,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:04,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 10:23:04,230 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:23:04,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:23:04,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=992, Invalid=1078, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:23:04,230 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 46 states. [2019-08-05 10:23:05,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:05,490 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2019-08-05 10:23:05,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 10:23:05,490 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 88 [2019-08-05 10:23:05,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:05,491 INFO L225 Difference]: With dead ends: 92 [2019-08-05 10:23:05,491 INFO L226 Difference]: Without dead ends: 92 [2019-08-05 10:23:05,492 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 945 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2970, Invalid=4862, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 10:23:05,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-08-05 10:23:05,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2019-08-05 10:23:05,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-08-05 10:23:05,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-08-05 10:23:05,495 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 88 [2019-08-05 10:23:05,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:05,495 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-08-05 10:23:05,496 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:23:05,496 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-08-05 10:23:05,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-08-05 10:23:05,496 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:05,496 INFO L399 BasicCegarLoop]: trace histogram [44, 43, 1, 1, 1] [2019-08-05 10:23:05,497 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:05,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:05,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1046977191, now seen corresponding path program 43 times [2019-08-05 10:23:05,498 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:05,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:05,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 10:23:05,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:06,307 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:06,359 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:06,359 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:06,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 10:23:06,359 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 10:23:06,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 10:23:06,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1037, Invalid=1125, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:23:06,360 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 47 states. [2019-08-05 10:23:07,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:07,787 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2019-08-05 10:23:07,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 10:23:07,788 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 90 [2019-08-05 10:23:07,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:07,789 INFO L225 Difference]: With dead ends: 94 [2019-08-05 10:23:07,789 INFO L226 Difference]: Without dead ends: 94 [2019-08-05 10:23:07,790 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 989 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=3105, Invalid=5085, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 10:23:07,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-08-05 10:23:07,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2019-08-05 10:23:07,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-08-05 10:23:07,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-08-05 10:23:07,792 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 90 [2019-08-05 10:23:07,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:07,793 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2019-08-05 10:23:07,793 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 10:23:07,793 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-08-05 10:23:07,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-08-05 10:23:07,794 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:07,794 INFO L399 BasicCegarLoop]: trace histogram [45, 44, 1, 1, 1] [2019-08-05 10:23:07,794 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:07,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:07,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1122800299, now seen corresponding path program 44 times [2019-08-05 10:23:07,795 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:07,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:07,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 10:23:07,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:08,581 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:08,608 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:08,609 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:08,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 10:23:08,609 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 10:23:08,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 10:23:08,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1083, Invalid=1173, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:23:08,610 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 48 states. [2019-08-05 10:23:09,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:09,970 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-08-05 10:23:09,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 10:23:09,971 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 92 [2019-08-05 10:23:09,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:09,972 INFO L225 Difference]: With dead ends: 96 [2019-08-05 10:23:09,972 INFO L226 Difference]: Without dead ends: 96 [2019-08-05 10:23:09,973 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1034 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=3243, Invalid=5313, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 10:23:09,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-08-05 10:23:09,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2019-08-05 10:23:09,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-08-05 10:23:09,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2019-08-05 10:23:09,976 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 92 [2019-08-05 10:23:09,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:09,977 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2019-08-05 10:23:09,977 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 10:23:09,977 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2019-08-05 10:23:09,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-08-05 10:23:09,977 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:09,977 INFO L399 BasicCegarLoop]: trace histogram [46, 45, 1, 1, 1] [2019-08-05 10:23:09,978 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:09,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:09,978 INFO L82 PathProgramCache]: Analyzing trace with hash -974363055, now seen corresponding path program 45 times [2019-08-05 10:23:09,979 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:10,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:10,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 10:23:10,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:10,955 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:10,982 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:10,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:10,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 10:23:10,983 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 10:23:10,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 10:23:10,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1130, Invalid=1222, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:23:10,984 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 49 states. [2019-08-05 10:23:12,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:12,264 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2019-08-05 10:23:12,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 10:23:12,265 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 94 [2019-08-05 10:23:12,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:12,266 INFO L225 Difference]: With dead ends: 98 [2019-08-05 10:23:12,266 INFO L226 Difference]: Without dead ends: 98 [2019-08-05 10:23:12,267 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1080 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3384, Invalid=5546, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 10:23:12,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-08-05 10:23:12,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2019-08-05 10:23:12,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-08-05 10:23:12,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-08-05 10:23:12,269 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 94 [2019-08-05 10:23:12,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:12,269 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-08-05 10:23:12,269 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 10:23:12,270 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-08-05 10:23:12,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-08-05 10:23:12,270 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:12,270 INFO L399 BasicCegarLoop]: trace histogram [47, 46, 1, 1, 1] [2019-08-05 10:23:12,270 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:12,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:12,270 INFO L82 PathProgramCache]: Analyzing trace with hash -60092339, now seen corresponding path program 46 times [2019-08-05 10:23:12,271 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:12,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:12,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-05 10:23:12,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:13,342 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:13,369 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:13,369 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:13,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 10:23:13,369 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 10:23:13,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 10:23:13,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1178, Invalid=1272, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:23:13,370 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 50 states. [2019-08-05 10:23:14,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:14,863 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-08-05 10:23:14,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 10:23:14,863 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 96 [2019-08-05 10:23:14,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:14,864 INFO L225 Difference]: With dead ends: 100 [2019-08-05 10:23:14,865 INFO L226 Difference]: Without dead ends: 100 [2019-08-05 10:23:14,866 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1127 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3528, Invalid=5784, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 10:23:14,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-08-05 10:23:14,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2019-08-05 10:23:14,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 10:23:14,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2019-08-05 10:23:14,868 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 96 [2019-08-05 10:23:14,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:14,868 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2019-08-05 10:23:14,868 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 10:23:14,869 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2019-08-05 10:23:14,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-08-05 10:23:14,869 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:14,869 INFO L399 BasicCegarLoop]: trace histogram [48, 47, 1, 1, 1] [2019-08-05 10:23:14,869 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:14,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:14,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1914229943, now seen corresponding path program 47 times [2019-08-05 10:23:14,870 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:14,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:14,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-05 10:23:14,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:15,816 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:15,842 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:15,843 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:15,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 10:23:15,843 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 10:23:15,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 10:23:15,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1227, Invalid=1323, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:23:15,844 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 51 states. [2019-08-05 10:23:17,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:17,325 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2019-08-05 10:23:17,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 10:23:17,326 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 98 [2019-08-05 10:23:17,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:17,326 INFO L225 Difference]: With dead ends: 102 [2019-08-05 10:23:17,326 INFO L226 Difference]: Without dead ends: 102 [2019-08-05 10:23:17,327 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1175 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3675, Invalid=6027, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 10:23:17,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-08-05 10:23:17,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2019-08-05 10:23:17,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-08-05 10:23:17,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-08-05 10:23:17,329 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 98 [2019-08-05 10:23:17,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:17,330 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-08-05 10:23:17,330 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 10:23:17,330 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-08-05 10:23:17,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-08-05 10:23:17,331 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:17,331 INFO L399 BasicCegarLoop]: trace histogram [49, 48, 1, 1, 1] [2019-08-05 10:23:17,331 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:17,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:17,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1329039547, now seen corresponding path program 48 times [2019-08-05 10:23:17,332 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:17,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:17,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-05 10:23:17,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:18,266 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:18,293 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:18,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:18,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 10:23:18,293 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 10:23:18,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 10:23:18,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1277, Invalid=1375, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:23:18,294 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 52 states. [2019-08-05 10:23:19,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:19,837 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2019-08-05 10:23:19,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 10:23:19,837 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 100 [2019-08-05 10:23:19,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:19,838 INFO L225 Difference]: With dead ends: 104 [2019-08-05 10:23:19,838 INFO L226 Difference]: Without dead ends: 104 [2019-08-05 10:23:19,838 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1224 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3825, Invalid=6275, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 10:23:19,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-08-05 10:23:19,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2019-08-05 10:23:19,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-05 10:23:19,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2019-08-05 10:23:19,841 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 100 [2019-08-05 10:23:19,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:19,841 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2019-08-05 10:23:19,842 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 10:23:19,842 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2019-08-05 10:23:19,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-08-05 10:23:19,842 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:19,842 INFO L399 BasicCegarLoop]: trace histogram [50, 49, 1, 1, 1] [2019-08-05 10:23:19,843 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:19,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:19,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1601784767, now seen corresponding path program 49 times [2019-08-05 10:23:19,844 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:19,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:19,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 10:23:19,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:21,236 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:21,263 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:21,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:21,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 10:23:21,264 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 10:23:21,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 10:23:21,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1328, Invalid=1428, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:23:21,265 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 53 states. [2019-08-05 10:23:23,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:23,908 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2019-08-05 10:23:23,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 10:23:23,909 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 102 [2019-08-05 10:23:23,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:23,910 INFO L225 Difference]: With dead ends: 106 [2019-08-05 10:23:23,910 INFO L226 Difference]: Without dead ends: 106 [2019-08-05 10:23:23,911 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1274 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=3978, Invalid=6528, Unknown=0, NotChecked=0, Total=10506 [2019-08-05 10:23:23,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-08-05 10:23:23,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2019-08-05 10:23:23,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 10:23:23,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2019-08-05 10:23:23,914 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 102 [2019-08-05 10:23:23,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:23,914 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2019-08-05 10:23:23,914 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 10:23:23,914 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2019-08-05 10:23:23,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-08-05 10:23:23,915 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:23,915 INFO L399 BasicCegarLoop]: trace histogram [51, 50, 1, 1, 1] [2019-08-05 10:23:23,915 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:23,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:23,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1716936131, now seen corresponding path program 50 times [2019-08-05 10:23:23,916 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:23,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:23,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-05 10:23:23,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:25,198 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:25,229 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:25,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:25,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 10:23:25,230 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 10:23:25,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 10:23:25,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1380, Invalid=1482, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:23:25,231 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 54 states. [2019-08-05 10:23:26,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:26,798 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2019-08-05 10:23:26,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 10:23:26,799 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 104 [2019-08-05 10:23:26,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:26,800 INFO L225 Difference]: With dead ends: 108 [2019-08-05 10:23:26,800 INFO L226 Difference]: Without dead ends: 108 [2019-08-05 10:23:26,800 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1325 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=4134, Invalid=6786, Unknown=0, NotChecked=0, Total=10920 [2019-08-05 10:23:26,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-08-05 10:23:26,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2019-08-05 10:23:26,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-05 10:23:26,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2019-08-05 10:23:26,803 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 104 [2019-08-05 10:23:26,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:26,803 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2019-08-05 10:23:26,803 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 10:23:26,803 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2019-08-05 10:23:26,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-08-05 10:23:26,804 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:26,804 INFO L399 BasicCegarLoop]: trace histogram [52, 51, 1, 1, 1] [2019-08-05 10:23:26,804 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:26,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:26,805 INFO L82 PathProgramCache]: Analyzing trace with hash -708247239, now seen corresponding path program 51 times [2019-08-05 10:23:26,805 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:26,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:26,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-05 10:23:26,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:28,262 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:28,292 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:28,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:28,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 10:23:28,293 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 10:23:28,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 10:23:28,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1433, Invalid=1537, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:23:28,294 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 55 states. [2019-08-05 10:23:29,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:29,851 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2019-08-05 10:23:29,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 10:23:29,851 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 106 [2019-08-05 10:23:29,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:29,853 INFO L225 Difference]: With dead ends: 110 [2019-08-05 10:23:29,853 INFO L226 Difference]: Without dead ends: 110 [2019-08-05 10:23:29,854 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1377 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4293, Invalid=7049, Unknown=0, NotChecked=0, Total=11342 [2019-08-05 10:23:29,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-08-05 10:23:29,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2019-08-05 10:23:29,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 10:23:29,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2019-08-05 10:23:29,857 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 106 [2019-08-05 10:23:29,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:29,857 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2019-08-05 10:23:29,857 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 10:23:29,857 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2019-08-05 10:23:29,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-08-05 10:23:29,858 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:29,858 INFO L399 BasicCegarLoop]: trace histogram [53, 52, 1, 1, 1] [2019-08-05 10:23:29,858 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:29,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:29,859 INFO L82 PathProgramCache]: Analyzing trace with hash -2020830923, now seen corresponding path program 52 times [2019-08-05 10:23:29,859 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:29,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:29,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 10:23:29,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:31,214 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:31,257 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:31,257 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:31,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 10:23:31,258 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 10:23:31,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 10:23:31,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1487, Invalid=1593, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:23:31,258 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 56 states. [2019-08-05 10:23:32,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:32,886 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2019-08-05 10:23:32,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 10:23:32,886 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 108 [2019-08-05 10:23:32,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:32,887 INFO L225 Difference]: With dead ends: 112 [2019-08-05 10:23:32,887 INFO L226 Difference]: Without dead ends: 112 [2019-08-05 10:23:32,888 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1430 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4455, Invalid=7317, Unknown=0, NotChecked=0, Total=11772 [2019-08-05 10:23:32,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-08-05 10:23:32,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2019-08-05 10:23:32,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-08-05 10:23:32,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2019-08-05 10:23:32,891 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 108 [2019-08-05 10:23:32,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:32,891 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2019-08-05 10:23:32,891 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 10:23:32,891 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2019-08-05 10:23:32,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-08-05 10:23:32,891 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:32,892 INFO L399 BasicCegarLoop]: trace histogram [54, 53, 1, 1, 1] [2019-08-05 10:23:32,892 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:32,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:32,892 INFO L82 PathProgramCache]: Analyzing trace with hash -693366223, now seen corresponding path program 53 times [2019-08-05 10:23:32,892 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:32,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:32,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-05 10:23:32,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:34,044 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:34,103 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:34,103 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:34,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 10:23:34,103 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 10:23:34,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 10:23:34,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1542, Invalid=1650, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:23:34,104 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 57 states. [2019-08-05 10:23:35,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:35,977 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2019-08-05 10:23:35,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 10:23:35,978 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 110 [2019-08-05 10:23:35,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:35,979 INFO L225 Difference]: With dead ends: 114 [2019-08-05 10:23:35,979 INFO L226 Difference]: Without dead ends: 114 [2019-08-05 10:23:35,980 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1484 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4620, Invalid=7590, Unknown=0, NotChecked=0, Total=12210 [2019-08-05 10:23:35,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-08-05 10:23:35,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2019-08-05 10:23:35,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 10:23:35,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2019-08-05 10:23:35,982 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 110 [2019-08-05 10:23:35,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:35,983 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2019-08-05 10:23:35,983 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 10:23:35,983 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2019-08-05 10:23:35,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-08-05 10:23:35,983 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:35,984 INFO L399 BasicCegarLoop]: trace histogram [55, 54, 1, 1, 1] [2019-08-05 10:23:35,984 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:35,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:35,984 INFO L82 PathProgramCache]: Analyzing trace with hash -605076435, now seen corresponding path program 54 times [2019-08-05 10:23:35,985 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:36,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:36,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 10:23:36,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:37,120 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:37,152 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:37,152 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:37,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 10:23:37,152 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 10:23:37,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 10:23:37,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1598, Invalid=1708, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:23:37,153 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 58 states. [2019-08-05 10:23:38,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:38,921 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2019-08-05 10:23:38,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 10:23:38,921 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 112 [2019-08-05 10:23:38,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:38,923 INFO L225 Difference]: With dead ends: 116 [2019-08-05 10:23:38,923 INFO L226 Difference]: Without dead ends: 116 [2019-08-05 10:23:38,923 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1539 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=4788, Invalid=7868, Unknown=0, NotChecked=0, Total=12656 [2019-08-05 10:23:38,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-08-05 10:23:38,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2019-08-05 10:23:38,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 10:23:38,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2019-08-05 10:23:38,926 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 112 [2019-08-05 10:23:38,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:38,927 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2019-08-05 10:23:38,927 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 10:23:38,927 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2019-08-05 10:23:38,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-08-05 10:23:38,927 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:38,927 INFO L399 BasicCegarLoop]: trace histogram [56, 55, 1, 1, 1] [2019-08-05 10:23:38,928 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:38,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:38,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1657936087, now seen corresponding path program 55 times [2019-08-05 10:23:38,929 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:38,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:38,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-05 10:23:38,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:40,087 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:40,122 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:40,122 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:40,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 10:23:40,123 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 10:23:40,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 10:23:40,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1655, Invalid=1767, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:23:40,124 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 59 states. [2019-08-05 10:23:42,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:42,249 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2019-08-05 10:23:42,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 10:23:42,250 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 114 [2019-08-05 10:23:42,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:42,251 INFO L225 Difference]: With dead ends: 118 [2019-08-05 10:23:42,251 INFO L226 Difference]: Without dead ends: 118 [2019-08-05 10:23:42,252 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1595 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4959, Invalid=8151, Unknown=0, NotChecked=0, Total=13110 [2019-08-05 10:23:42,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-08-05 10:23:42,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2019-08-05 10:23:42,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 10:23:42,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2019-08-05 10:23:42,255 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 114 [2019-08-05 10:23:42,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:42,255 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2019-08-05 10:23:42,255 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 10:23:42,255 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2019-08-05 10:23:42,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-08-05 10:23:42,256 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:42,256 INFO L399 BasicCegarLoop]: trace histogram [57, 56, 1, 1, 1] [2019-08-05 10:23:42,256 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:42,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:42,257 INFO L82 PathProgramCache]: Analyzing trace with hash 156220197, now seen corresponding path program 56 times [2019-08-05 10:23:42,257 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:42,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:42,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 10:23:42,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:43,471 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:43,505 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:43,505 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:43,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 10:23:43,506 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 10:23:43,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 10:23:43,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1713, Invalid=1827, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:23:43,507 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 60 states. [2019-08-05 10:23:45,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:45,576 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2019-08-05 10:23:45,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 10:23:45,577 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 116 [2019-08-05 10:23:45,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:45,578 INFO L225 Difference]: With dead ends: 120 [2019-08-05 10:23:45,578 INFO L226 Difference]: Without dead ends: 120 [2019-08-05 10:23:45,579 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1652 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=5133, Invalid=8439, Unknown=0, NotChecked=0, Total=13572 [2019-08-05 10:23:45,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-08-05 10:23:45,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2019-08-05 10:23:45,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 10:23:45,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2019-08-05 10:23:45,581 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 116 [2019-08-05 10:23:45,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:45,581 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2019-08-05 10:23:45,581 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 10:23:45,582 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2019-08-05 10:23:45,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-08-05 10:23:45,582 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:45,582 INFO L399 BasicCegarLoop]: trace histogram [58, 57, 1, 1, 1] [2019-08-05 10:23:45,582 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:45,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:45,582 INFO L82 PathProgramCache]: Analyzing trace with hash -196313055, now seen corresponding path program 57 times [2019-08-05 10:23:45,583 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:45,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:45,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-05 10:23:45,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:47,473 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:47,507 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:47,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:47,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-05 10:23:47,507 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-05 10:23:47,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-05 10:23:47,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1772, Invalid=1888, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:23:47,508 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 61 states. [2019-08-05 10:23:49,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:49,402 INFO L93 Difference]: Finished difference Result 122 states and 122 transitions. [2019-08-05 10:23:49,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 10:23:49,403 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 118 [2019-08-05 10:23:49,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:49,404 INFO L225 Difference]: With dead ends: 122 [2019-08-05 10:23:49,404 INFO L226 Difference]: Without dead ends: 122 [2019-08-05 10:23:49,405 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1710 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5310, Invalid=8732, Unknown=0, NotChecked=0, Total=14042 [2019-08-05 10:23:49,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-08-05 10:23:49,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2019-08-05 10:23:49,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-05 10:23:49,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2019-08-05 10:23:49,407 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 118 [2019-08-05 10:23:49,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:49,408 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2019-08-05 10:23:49,408 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-05 10:23:49,408 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2019-08-05 10:23:49,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-08-05 10:23:49,408 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:49,409 INFO L399 BasicCegarLoop]: trace histogram [59, 58, 1, 1, 1] [2019-08-05 10:23:49,409 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:49,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:49,409 INFO L82 PathProgramCache]: Analyzing trace with hash 321648157, now seen corresponding path program 58 times [2019-08-05 10:23:49,410 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:49,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:49,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 10:23:49,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:51,452 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:51,485 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:51,485 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:51,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-05 10:23:51,486 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-05 10:23:51,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-05 10:23:51,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1832, Invalid=1950, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:23:51,486 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 62 states. [2019-08-05 10:23:53,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:53,557 INFO L93 Difference]: Finished difference Result 124 states and 124 transitions. [2019-08-05 10:23:53,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 10:23:53,558 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 120 [2019-08-05 10:23:53,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:53,559 INFO L225 Difference]: With dead ends: 124 [2019-08-05 10:23:53,559 INFO L226 Difference]: Without dead ends: 124 [2019-08-05 10:23:53,560 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1769 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5490, Invalid=9030, Unknown=0, NotChecked=0, Total=14520 [2019-08-05 10:23:53,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-08-05 10:23:53,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2019-08-05 10:23:53,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-08-05 10:23:53,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2019-08-05 10:23:53,562 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 120 [2019-08-05 10:23:53,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:53,562 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 123 transitions. [2019-08-05 10:23:53,562 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-05 10:23:53,562 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2019-08-05 10:23:53,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-08-05 10:23:53,563 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:53,563 INFO L399 BasicCegarLoop]: trace histogram [60, 59, 1, 1, 1] [2019-08-05 10:23:53,563 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:53,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:53,563 INFO L82 PathProgramCache]: Analyzing trace with hash -133833447, now seen corresponding path program 59 times [2019-08-05 10:23:53,564 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:53,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:53,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-05 10:23:53,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:55,039 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:55,074 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:55,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:55,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-05 10:23:55,074 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-05 10:23:55,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-05 10:23:55,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1893, Invalid=2013, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:23:55,075 INFO L87 Difference]: Start difference. First operand 123 states and 123 transitions. Second operand 63 states. [2019-08-05 10:23:57,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:57,285 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2019-08-05 10:23:57,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-05 10:23:57,285 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 122 [2019-08-05 10:23:57,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:57,286 INFO L225 Difference]: With dead ends: 126 [2019-08-05 10:23:57,286 INFO L226 Difference]: Without dead ends: 126 [2019-08-05 10:23:57,287 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1829 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=5673, Invalid=9333, Unknown=0, NotChecked=0, Total=15006 [2019-08-05 10:23:57,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-08-05 10:23:57,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2019-08-05 10:23:57,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-08-05 10:23:57,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2019-08-05 10:23:57,289 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 122 [2019-08-05 10:23:57,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:57,290 INFO L475 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2019-08-05 10:23:57,290 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-05 10:23:57,290 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2019-08-05 10:23:57,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-08-05 10:23:57,290 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:57,291 INFO L399 BasicCegarLoop]: trace histogram [61, 60, 1, 1, 1] [2019-08-05 10:23:57,291 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:57,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:57,291 INFO L82 PathProgramCache]: Analyzing trace with hash 235009301, now seen corresponding path program 60 times [2019-08-05 10:23:57,291 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:57,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:57,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-05 10:23:57,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:58,832 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:58,864 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:58,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:58,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-05 10:23:58,865 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-05 10:23:58,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-05 10:23:58,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1955, Invalid=2077, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:23:58,866 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 64 states. [2019-08-05 10:24:01,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:01,062 INFO L93 Difference]: Finished difference Result 128 states and 128 transitions. [2019-08-05 10:24:01,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-05 10:24:01,062 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 124 [2019-08-05 10:24:01,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:01,063 INFO L225 Difference]: With dead ends: 128 [2019-08-05 10:24:01,063 INFO L226 Difference]: Without dead ends: 128 [2019-08-05 10:24:01,064 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1890 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=5859, Invalid=9641, Unknown=0, NotChecked=0, Total=15500 [2019-08-05 10:24:01,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-08-05 10:24:01,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2019-08-05 10:24:01,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-08-05 10:24:01,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2019-08-05 10:24:01,067 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 124 [2019-08-05 10:24:01,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:01,067 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2019-08-05 10:24:01,067 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-05 10:24:01,067 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2019-08-05 10:24:01,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-08-05 10:24:01,068 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:01,068 INFO L399 BasicCegarLoop]: trace histogram [62, 61, 1, 1, 1] [2019-08-05 10:24:01,068 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:01,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:01,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1789395439, now seen corresponding path program 61 times [2019-08-05 10:24:01,069 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:01,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:01,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-05 10:24:01,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:02,482 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:02,517 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:24:02,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:02,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-05 10:24:02,518 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-05 10:24:02,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-05 10:24:02,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2018, Invalid=2142, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:24:02,519 INFO L87 Difference]: Start difference. First operand 127 states and 127 transitions. Second operand 65 states. [2019-08-05 10:24:04,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:04,645 INFO L93 Difference]: Finished difference Result 130 states and 130 transitions. [2019-08-05 10:24:04,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 10:24:04,646 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 126 [2019-08-05 10:24:04,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:04,647 INFO L225 Difference]: With dead ends: 130 [2019-08-05 10:24:04,647 INFO L226 Difference]: Without dead ends: 130 [2019-08-05 10:24:04,648 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1952 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=6048, Invalid=9954, Unknown=0, NotChecked=0, Total=16002 [2019-08-05 10:24:04,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-08-05 10:24:04,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2019-08-05 10:24:04,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-08-05 10:24:04,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2019-08-05 10:24:04,650 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 126 [2019-08-05 10:24:04,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:04,651 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2019-08-05 10:24:04,651 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-05 10:24:04,651 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2019-08-05 10:24:04,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-08-05 10:24:04,651 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:04,651 INFO L399 BasicCegarLoop]: trace histogram [63, 62, 1, 1, 1] [2019-08-05 10:24:04,652 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:04,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:04,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1622165491, now seen corresponding path program 62 times [2019-08-05 10:24:04,652 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:04,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:04,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-05 10:24:04,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:06,327 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:06,361 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:24:06,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:06,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-05 10:24:06,361 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-05 10:24:06,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-05 10:24:06,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2082, Invalid=2208, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:24:06,362 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 66 states. [2019-08-05 10:24:08,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:08,620 INFO L93 Difference]: Finished difference Result 132 states and 132 transitions. [2019-08-05 10:24:08,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 10:24:08,621 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 128 [2019-08-05 10:24:08,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:08,622 INFO L225 Difference]: With dead ends: 132 [2019-08-05 10:24:08,622 INFO L226 Difference]: Without dead ends: 132 [2019-08-05 10:24:08,623 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2015 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=6240, Invalid=10272, Unknown=0, NotChecked=0, Total=16512 [2019-08-05 10:24:08,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-08-05 10:24:08,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 131. [2019-08-05 10:24:08,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-08-05 10:24:08,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2019-08-05 10:24:08,627 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 128 [2019-08-05 10:24:08,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:08,627 INFO L475 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2019-08-05 10:24:08,627 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-05 10:24:08,627 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2019-08-05 10:24:08,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-08-05 10:24:08,628 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:08,628 INFO L399 BasicCegarLoop]: trace histogram [64, 63, 1, 1, 1] [2019-08-05 10:24:08,628 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:08,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:08,629 INFO L82 PathProgramCache]: Analyzing trace with hash 172024585, now seen corresponding path program 63 times [2019-08-05 10:24:08,629 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:08,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:08,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-05 10:24:08,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:10,142 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:10,181 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:24:10,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:10,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-05 10:24:10,182 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-05 10:24:10,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-05 10:24:10,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2147, Invalid=2275, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:24:10,183 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 67 states. [2019-08-05 10:24:12,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:12,789 INFO L93 Difference]: Finished difference Result 134 states and 134 transitions. [2019-08-05 10:24:12,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-05 10:24:12,790 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 130 [2019-08-05 10:24:12,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:12,791 INFO L225 Difference]: With dead ends: 134 [2019-08-05 10:24:12,791 INFO L226 Difference]: Without dead ends: 134 [2019-08-05 10:24:12,792 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2079 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=6435, Invalid=10595, Unknown=0, NotChecked=0, Total=17030 [2019-08-05 10:24:12,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-08-05 10:24:12,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2019-08-05 10:24:12,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-08-05 10:24:12,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2019-08-05 10:24:12,794 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 130 [2019-08-05 10:24:12,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:12,795 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2019-08-05 10:24:12,795 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-05 10:24:12,795 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2019-08-05 10:24:12,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-08-05 10:24:12,796 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:12,796 INFO L399 BasicCegarLoop]: trace histogram [65, 64, 1, 1, 1] [2019-08-05 10:24:12,796 INFO L418 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:12,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:12,796 INFO L82 PathProgramCache]: Analyzing trace with hash 2106801925, now seen corresponding path program 64 times [2019-08-05 10:24:12,797 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:12,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:12,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-05 10:24:12,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:14,776 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:14,813 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:24:14,813 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:14,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-05 10:24:14,814 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-05 10:24:14,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-05 10:24:14,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2213, Invalid=2343, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:24:14,815 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 68 states. [2019-08-05 10:24:17,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:17,365 INFO L93 Difference]: Finished difference Result 136 states and 136 transitions. [2019-08-05 10:24:17,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-05 10:24:17,366 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 132 [2019-08-05 10:24:17,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:17,367 INFO L225 Difference]: With dead ends: 136 [2019-08-05 10:24:17,367 INFO L226 Difference]: Without dead ends: 136 [2019-08-05 10:24:17,368 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2144 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=6633, Invalid=10923, Unknown=0, NotChecked=0, Total=17556 [2019-08-05 10:24:17,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-08-05 10:24:17,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 135. [2019-08-05 10:24:17,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-08-05 10:24:17,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 135 transitions. [2019-08-05 10:24:17,371 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 135 transitions. Word has length 132 [2019-08-05 10:24:17,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:17,371 INFO L475 AbstractCegarLoop]: Abstraction has 135 states and 135 transitions. [2019-08-05 10:24:17,371 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-05 10:24:17,371 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 135 transitions. [2019-08-05 10:24:17,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-08-05 10:24:17,372 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:17,372 INFO L399 BasicCegarLoop]: trace histogram [66, 65, 1, 1, 1] [2019-08-05 10:24:17,372 INFO L418 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:17,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:17,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1706986497, now seen corresponding path program 65 times [2019-08-05 10:24:17,373 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:17,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:17,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-05 10:24:17,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:19,364 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:19,400 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:24:19,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:19,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-05 10:24:19,401 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-05 10:24:19,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-05 10:24:19,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2280, Invalid=2412, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:24:19,401 INFO L87 Difference]: Start difference. First operand 135 states and 135 transitions. Second operand 69 states. [2019-08-05 10:24:22,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:22,038 INFO L93 Difference]: Finished difference Result 138 states and 138 transitions. [2019-08-05 10:24:22,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-05 10:24:22,038 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 134 [2019-08-05 10:24:22,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:22,039 INFO L225 Difference]: With dead ends: 138 [2019-08-05 10:24:22,040 INFO L226 Difference]: Without dead ends: 138 [2019-08-05 10:24:22,040 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2210 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=6834, Invalid=11256, Unknown=0, NotChecked=0, Total=18090 [2019-08-05 10:24:22,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-08-05 10:24:22,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137. [2019-08-05 10:24:22,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-08-05 10:24:22,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2019-08-05 10:24:22,043 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 134 [2019-08-05 10:24:22,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:22,044 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2019-08-05 10:24:22,044 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-05 10:24:22,044 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2019-08-05 10:24:22,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-08-05 10:24:22,045 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:22,045 INFO L399 BasicCegarLoop]: trace histogram [67, 66, 1, 1, 1] [2019-08-05 10:24:22,045 INFO L418 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:22,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:22,045 INFO L82 PathProgramCache]: Analyzing trace with hash -263550467, now seen corresponding path program 66 times [2019-08-05 10:24:22,046 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:22,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:22,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 71 conjunts are in the unsatisfiable core [2019-08-05 10:24:22,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:23,721 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:23,759 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:24:23,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:23,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-05 10:24:23,760 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-05 10:24:23,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-05 10:24:23,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2348, Invalid=2482, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:24:23,761 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 70 states. [2019-08-05 10:24:26,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:26,603 INFO L93 Difference]: Finished difference Result 140 states and 140 transitions. [2019-08-05 10:24:26,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-05 10:24:26,604 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 136 [2019-08-05 10:24:26,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:26,605 INFO L225 Difference]: With dead ends: 140 [2019-08-05 10:24:26,605 INFO L226 Difference]: Without dead ends: 140 [2019-08-05 10:24:26,606 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2277 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=7038, Invalid=11594, Unknown=0, NotChecked=0, Total=18632 [2019-08-05 10:24:26,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-08-05 10:24:26,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 139. [2019-08-05 10:24:26,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-08-05 10:24:26,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 139 transitions. [2019-08-05 10:24:26,609 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 139 transitions. Word has length 136 [2019-08-05 10:24:26,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:26,609 INFO L475 AbstractCegarLoop]: Abstraction has 139 states and 139 transitions. [2019-08-05 10:24:26,609 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-05 10:24:26,609 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 139 transitions. [2019-08-05 10:24:26,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-08-05 10:24:26,610 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:26,610 INFO L399 BasicCegarLoop]: trace histogram [68, 67, 1, 1, 1] [2019-08-05 10:24:26,610 INFO L418 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:26,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:26,610 INFO L82 PathProgramCache]: Analyzing trace with hash 131004665, now seen corresponding path program 67 times [2019-08-05 10:24:26,611 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:26,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:26,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 72 conjunts are in the unsatisfiable core [2019-08-05 10:24:26,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:28,242 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:28,315 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 4556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:24:28,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:28,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-05 10:24:28,316 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-05 10:24:28,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-05 10:24:28,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2417, Invalid=2553, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:24:28,317 INFO L87 Difference]: Start difference. First operand 139 states and 139 transitions. Second operand 71 states. [2019-08-05 10:24:30,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:30,957 INFO L93 Difference]: Finished difference Result 142 states and 142 transitions. [2019-08-05 10:24:30,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-05 10:24:30,958 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 138 [2019-08-05 10:24:30,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:30,959 INFO L225 Difference]: With dead ends: 142 [2019-08-05 10:24:30,959 INFO L226 Difference]: Without dead ends: 142 [2019-08-05 10:24:30,960 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2345 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=7245, Invalid=11937, Unknown=0, NotChecked=0, Total=19182 [2019-08-05 10:24:30,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-08-05 10:24:30,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2019-08-05 10:24:30,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-08-05 10:24:30,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2019-08-05 10:24:30,962 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 138 [2019-08-05 10:24:30,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:30,962 INFO L475 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2019-08-05 10:24:30,962 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-05 10:24:30,963 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2019-08-05 10:24:30,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-08-05 10:24:30,963 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:30,963 INFO L399 BasicCegarLoop]: trace histogram [69, 68, 1, 1, 1] [2019-08-05 10:24:30,963 INFO L418 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:30,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:30,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1341364469, now seen corresponding path program 68 times [2019-08-05 10:24:30,964 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:30,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:30,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 73 conjunts are in the unsatisfiable core [2019-08-05 10:24:30,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:32,841 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:32,879 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 4692 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:24:32,880 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:32,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-05 10:24:32,880 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-05 10:24:32,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-05 10:24:32,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2487, Invalid=2625, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:24:32,881 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 72 states. [2019-08-05 10:24:35,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:35,476 INFO L93 Difference]: Finished difference Result 144 states and 144 transitions. [2019-08-05 10:24:35,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-05 10:24:35,476 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 140 [2019-08-05 10:24:35,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:35,478 INFO L225 Difference]: With dead ends: 144 [2019-08-05 10:24:35,478 INFO L226 Difference]: Without dead ends: 144 [2019-08-05 10:24:35,479 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2414 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=7455, Invalid=12285, Unknown=0, NotChecked=0, Total=19740 [2019-08-05 10:24:35,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-08-05 10:24:35,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 143. [2019-08-05 10:24:35,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-08-05 10:24:35,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2019-08-05 10:24:35,481 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 143 transitions. Word has length 140 [2019-08-05 10:24:35,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:35,481 INFO L475 AbstractCegarLoop]: Abstraction has 143 states and 143 transitions. [2019-08-05 10:24:35,482 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-05 10:24:35,482 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 143 transitions. [2019-08-05 10:24:35,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-08-05 10:24:35,482 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:35,482 INFO L399 BasicCegarLoop]: trace histogram [70, 69, 1, 1, 1] [2019-08-05 10:24:35,483 INFO L418 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:35,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:35,483 INFO L82 PathProgramCache]: Analyzing trace with hash 560998897, now seen corresponding path program 69 times [2019-08-05 10:24:35,483 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:35,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:35,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-05 10:24:35,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:37,515 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:37,555 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 4830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:24:37,555 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:37,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-05 10:24:37,556 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-08-05 10:24:37,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-08-05 10:24:37,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2558, Invalid=2698, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:24:37,557 INFO L87 Difference]: Start difference. First operand 143 states and 143 transitions. Second operand 73 states. [2019-08-05 10:24:40,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:40,274 INFO L93 Difference]: Finished difference Result 146 states and 146 transitions. [2019-08-05 10:24:40,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-05 10:24:40,274 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 142 [2019-08-05 10:24:40,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:40,276 INFO L225 Difference]: With dead ends: 146 [2019-08-05 10:24:40,276 INFO L226 Difference]: Without dead ends: 146 [2019-08-05 10:24:40,277 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2484 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=7668, Invalid=12638, Unknown=0, NotChecked=0, Total=20306 [2019-08-05 10:24:40,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-08-05 10:24:40,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2019-08-05 10:24:40,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-08-05 10:24:40,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2019-08-05 10:24:40,280 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 142 [2019-08-05 10:24:40,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:40,280 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2019-08-05 10:24:40,280 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-08-05 10:24:40,280 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2019-08-05 10:24:40,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-08-05 10:24:40,281 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:40,281 INFO L399 BasicCegarLoop]: trace histogram [71, 70, 1, 1, 1] [2019-08-05 10:24:40,281 INFO L418 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:40,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:40,282 INFO L82 PathProgramCache]: Analyzing trace with hash -2046006291, now seen corresponding path program 70 times [2019-08-05 10:24:40,282 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:40,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:40,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 572 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-05 10:24:40,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:42,447 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:42,501 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 4970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:24:42,502 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:42,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-05 10:24:42,502 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-05 10:24:42,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-05 10:24:42,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2630, Invalid=2772, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:24:42,503 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 74 states. [2019-08-05 10:24:45,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:45,293 INFO L93 Difference]: Finished difference Result 148 states and 148 transitions. [2019-08-05 10:24:45,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-05 10:24:45,294 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 144 [2019-08-05 10:24:45,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:45,294 INFO L225 Difference]: With dead ends: 148 [2019-08-05 10:24:45,294 INFO L226 Difference]: Without dead ends: 148 [2019-08-05 10:24:45,295 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2555 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=7884, Invalid=12996, Unknown=0, NotChecked=0, Total=20880 [2019-08-05 10:24:45,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-08-05 10:24:45,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 147. [2019-08-05 10:24:45,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-08-05 10:24:45,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 147 transitions. [2019-08-05 10:24:45,297 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 147 transitions. Word has length 144 [2019-08-05 10:24:45,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:45,298 INFO L475 AbstractCegarLoop]: Abstraction has 147 states and 147 transitions. [2019-08-05 10:24:45,298 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-05 10:24:45,298 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 147 transitions. [2019-08-05 10:24:45,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-08-05 10:24:45,299 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:45,299 INFO L399 BasicCegarLoop]: trace histogram [72, 71, 1, 1, 1] [2019-08-05 10:24:45,299 INFO L418 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:45,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:45,300 INFO L82 PathProgramCache]: Analyzing trace with hash 882908905, now seen corresponding path program 71 times [2019-08-05 10:24:45,300 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:45,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:45,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 580 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-05 10:24:45,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:47,423 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:47,465 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 5112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:24:47,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:47,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-05 10:24:47,466 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-05 10:24:47,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-05 10:24:47,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2703, Invalid=2847, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:24:47,467 INFO L87 Difference]: Start difference. First operand 147 states and 147 transitions. Second operand 75 states. [2019-08-05 10:24:50,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:50,365 INFO L93 Difference]: Finished difference Result 150 states and 150 transitions. [2019-08-05 10:24:50,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-05 10:24:50,366 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 146 [2019-08-05 10:24:50,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:50,367 INFO L225 Difference]: With dead ends: 150 [2019-08-05 10:24:50,367 INFO L226 Difference]: Without dead ends: 150 [2019-08-05 10:24:50,368 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2627 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=8103, Invalid=13359, Unknown=0, NotChecked=0, Total=21462 [2019-08-05 10:24:50,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-08-05 10:24:50,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2019-08-05 10:24:50,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-08-05 10:24:50,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2019-08-05 10:24:50,371 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 146 [2019-08-05 10:24:50,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:50,371 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2019-08-05 10:24:50,371 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-05 10:24:50,371 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2019-08-05 10:24:50,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-08-05 10:24:50,372 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:50,372 INFO L399 BasicCegarLoop]: trace histogram [73, 72, 1, 1, 1] [2019-08-05 10:24:50,373 INFO L418 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:50,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:50,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1928133915, now seen corresponding path program 72 times [2019-08-05 10:24:50,373 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:50,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:50,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 588 conjuncts, 77 conjunts are in the unsatisfiable core [2019-08-05 10:24:50,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:52,667 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:52,707 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 5256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:24:52,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:52,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-05 10:24:52,708 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-05 10:24:52,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-05 10:24:52,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2777, Invalid=2923, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:24:52,709 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand 76 states. [2019-08-05 10:24:55,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:55,675 INFO L93 Difference]: Finished difference Result 152 states and 152 transitions. [2019-08-05 10:24:55,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-05 10:24:55,676 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 148 [2019-08-05 10:24:55,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:55,677 INFO L225 Difference]: With dead ends: 152 [2019-08-05 10:24:55,677 INFO L226 Difference]: Without dead ends: 152 [2019-08-05 10:24:55,678 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2700 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=8325, Invalid=13727, Unknown=0, NotChecked=0, Total=22052 [2019-08-05 10:24:55,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-08-05 10:24:55,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 151. [2019-08-05 10:24:55,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-08-05 10:24:55,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2019-08-05 10:24:55,681 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 148 [2019-08-05 10:24:55,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:55,681 INFO L475 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2019-08-05 10:24:55,681 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-05 10:24:55,681 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2019-08-05 10:24:55,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-08-05 10:24:55,682 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:55,682 INFO L399 BasicCegarLoop]: trace histogram [74, 73, 1, 1, 1] [2019-08-05 10:24:55,682 INFO L418 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:55,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:55,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1805854751, now seen corresponding path program 73 times [2019-08-05 10:24:55,683 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:55,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:55,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 596 conjuncts, 78 conjunts are in the unsatisfiable core [2019-08-05 10:24:55,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:57,985 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:58,030 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 5402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:24:58,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:58,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-08-05 10:24:58,030 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-08-05 10:24:58,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-08-05 10:24:58,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2852, Invalid=3000, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:24:58,031 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 77 states. [2019-08-05 10:25:01,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:01,039 INFO L93 Difference]: Finished difference Result 154 states and 154 transitions. [2019-08-05 10:25:01,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-05 10:25:01,040 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 150 [2019-08-05 10:25:01,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:01,041 INFO L225 Difference]: With dead ends: 154 [2019-08-05 10:25:01,041 INFO L226 Difference]: Without dead ends: 154 [2019-08-05 10:25:01,042 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2774 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=8550, Invalid=14100, Unknown=0, NotChecked=0, Total=22650 [2019-08-05 10:25:01,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-08-05 10:25:01,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153. [2019-08-05 10:25:01,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-08-05 10:25:01,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2019-08-05 10:25:01,044 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 150 [2019-08-05 10:25:01,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:01,044 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2019-08-05 10:25:01,044 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-08-05 10:25:01,044 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2019-08-05 10:25:01,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-08-05 10:25:01,045 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:01,045 INFO L399 BasicCegarLoop]: trace histogram [75, 74, 1, 1, 1] [2019-08-05 10:25:01,045 INFO L418 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:01,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:01,045 INFO L82 PathProgramCache]: Analyzing trace with hash -259695139, now seen corresponding path program 74 times [2019-08-05 10:25:01,046 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:01,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:01,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 604 conjuncts, 79 conjunts are in the unsatisfiable core [2019-08-05 10:25:01,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:03,333 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:25:03,377 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 5550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:25:03,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:25:03,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-05 10:25:03,378 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-05 10:25:03,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-05 10:25:03,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2928, Invalid=3078, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:25:03,379 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 78 states. [2019-08-05 10:25:06,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:06,401 INFO L93 Difference]: Finished difference Result 156 states and 156 transitions. [2019-08-05 10:25:06,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-08-05 10:25:06,401 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 152 [2019-08-05 10:25:06,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:06,402 INFO L225 Difference]: With dead ends: 156 [2019-08-05 10:25:06,402 INFO L226 Difference]: Without dead ends: 156 [2019-08-05 10:25:06,404 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2849 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=8778, Invalid=14478, Unknown=0, NotChecked=0, Total=23256 [2019-08-05 10:25:06,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-08-05 10:25:06,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 155. [2019-08-05 10:25:06,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-08-05 10:25:06,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 155 transitions. [2019-08-05 10:25:06,406 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 155 transitions. Word has length 152 [2019-08-05 10:25:06,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:06,406 INFO L475 AbstractCegarLoop]: Abstraction has 155 states and 155 transitions. [2019-08-05 10:25:06,407 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-05 10:25:06,407 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 155 transitions. [2019-08-05 10:25:06,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-08-05 10:25:06,407 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:06,407 INFO L399 BasicCegarLoop]: trace histogram [76, 75, 1, 1, 1] [2019-08-05 10:25:06,408 INFO L418 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:06,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:06,408 INFO L82 PathProgramCache]: Analyzing trace with hash -458992423, now seen corresponding path program 75 times [2019-08-05 10:25:06,408 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:06,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:06,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 80 conjunts are in the unsatisfiable core [2019-08-05 10:25:06,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:08,795 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:25:08,839 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 5700 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:25:08,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:25:08,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-08-05 10:25:08,839 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-08-05 10:25:08,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-08-05 10:25:08,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3005, Invalid=3157, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:25:08,840 INFO L87 Difference]: Start difference. First operand 155 states and 155 transitions. Second operand 79 states. [2019-08-05 10:25:12,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:12,104 INFO L93 Difference]: Finished difference Result 158 states and 158 transitions. [2019-08-05 10:25:12,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-08-05 10:25:12,105 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 154 [2019-08-05 10:25:12,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:12,106 INFO L225 Difference]: With dead ends: 158 [2019-08-05 10:25:12,106 INFO L226 Difference]: Without dead ends: 158 [2019-08-05 10:25:12,107 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2925 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=9009, Invalid=14861, Unknown=0, NotChecked=0, Total=23870 [2019-08-05 10:25:12,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-08-05 10:25:12,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 157. [2019-08-05 10:25:12,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-08-05 10:25:12,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2019-08-05 10:25:12,109 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 154 [2019-08-05 10:25:12,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:12,109 INFO L475 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2019-08-05 10:25:12,109 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-08-05 10:25:12,110 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2019-08-05 10:25:12,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-08-05 10:25:12,110 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:12,110 INFO L399 BasicCegarLoop]: trace histogram [77, 76, 1, 1, 1] [2019-08-05 10:25:12,111 INFO L418 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:12,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:12,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1289845973, now seen corresponding path program 76 times [2019-08-05 10:25:12,112 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:12,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:12,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 620 conjuncts, 81 conjunts are in the unsatisfiable core [2019-08-05 10:25:12,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:14,488 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:25:14,535 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 5852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:25:14,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:25:14,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-08-05 10:25:14,536 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-08-05 10:25:14,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-08-05 10:25:14,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3083, Invalid=3237, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:25:14,536 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 80 states. [2019-08-05 10:25:17,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:17,756 INFO L93 Difference]: Finished difference Result 160 states and 160 transitions. [2019-08-05 10:25:17,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-08-05 10:25:17,756 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 156 [2019-08-05 10:25:17,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:17,757 INFO L225 Difference]: With dead ends: 160 [2019-08-05 10:25:17,758 INFO L226 Difference]: Without dead ends: 160 [2019-08-05 10:25:17,759 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3002 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=9243, Invalid=15249, Unknown=0, NotChecked=0, Total=24492 [2019-08-05 10:25:17,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-08-05 10:25:17,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 159. [2019-08-05 10:25:17,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-08-05 10:25:17,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 159 transitions. [2019-08-05 10:25:17,762 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 159 transitions. Word has length 156 [2019-08-05 10:25:17,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:17,763 INFO L475 AbstractCegarLoop]: Abstraction has 159 states and 159 transitions. [2019-08-05 10:25:17,763 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-08-05 10:25:17,763 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 159 transitions. [2019-08-05 10:25:17,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-08-05 10:25:17,764 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:17,764 INFO L399 BasicCegarLoop]: trace histogram [78, 77, 1, 1, 1] [2019-08-05 10:25:17,764 INFO L418 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:17,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:17,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1703635503, now seen corresponding path program 77 times [2019-08-05 10:25:17,765 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:17,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:17,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 628 conjuncts, 82 conjunts are in the unsatisfiable core [2019-08-05 10:25:17,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:19,943 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:25:19,991 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 6006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:25:19,991 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:25:19,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2019-08-05 10:25:19,992 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-08-05 10:25:19,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-08-05 10:25:19,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3162, Invalid=3318, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:25:19,993 INFO L87 Difference]: Start difference. First operand 159 states and 159 transitions. Second operand 81 states. [2019-08-05 10:25:23,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:23,465 INFO L93 Difference]: Finished difference Result 162 states and 162 transitions. [2019-08-05 10:25:23,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-08-05 10:25:23,466 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 158 [2019-08-05 10:25:23,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:23,467 INFO L225 Difference]: With dead ends: 162 [2019-08-05 10:25:23,467 INFO L226 Difference]: Without dead ends: 162 [2019-08-05 10:25:23,468 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3080 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=9480, Invalid=15642, Unknown=0, NotChecked=0, Total=25122 [2019-08-05 10:25:23,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-08-05 10:25:23,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 161. [2019-08-05 10:25:23,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-08-05 10:25:23,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2019-08-05 10:25:23,470 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 158 [2019-08-05 10:25:23,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:23,470 INFO L475 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2019-08-05 10:25:23,471 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-08-05 10:25:23,471 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2019-08-05 10:25:23,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-08-05 10:25:23,471 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:23,471 INFO L399 BasicCegarLoop]: trace histogram [79, 78, 1, 1, 1] [2019-08-05 10:25:23,472 INFO L418 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:23,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:23,472 INFO L82 PathProgramCache]: Analyzing trace with hash -811245619, now seen corresponding path program 78 times [2019-08-05 10:25:23,473 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:23,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:23,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 636 conjuncts, 83 conjunts are in the unsatisfiable core [2019-08-05 10:25:23,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:25,730 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:25:25,779 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 6162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:25:25,780 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:25:25,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2019-08-05 10:25:25,780 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-08-05 10:25:25,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-08-05 10:25:25,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3242, Invalid=3400, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 10:25:25,781 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 82 states. [2019-08-05 10:25:29,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:29,328 INFO L93 Difference]: Finished difference Result 164 states and 164 transitions. [2019-08-05 10:25:29,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-08-05 10:25:29,329 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 160 [2019-08-05 10:25:29,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:29,330 INFO L225 Difference]: With dead ends: 164 [2019-08-05 10:25:29,330 INFO L226 Difference]: Without dead ends: 164 [2019-08-05 10:25:29,331 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3159 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=9720, Invalid=16040, Unknown=0, NotChecked=0, Total=25760 [2019-08-05 10:25:29,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-08-05 10:25:29,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 163. [2019-08-05 10:25:29,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-08-05 10:25:29,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 163 transitions. [2019-08-05 10:25:29,334 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 163 transitions. Word has length 160 [2019-08-05 10:25:29,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:29,334 INFO L475 AbstractCegarLoop]: Abstraction has 163 states and 163 transitions. [2019-08-05 10:25:29,334 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-08-05 10:25:29,334 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 163 transitions. [2019-08-05 10:25:29,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-08-05 10:25:29,335 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:29,335 INFO L399 BasicCegarLoop]: trace histogram [80, 79, 1, 1, 1] [2019-08-05 10:25:29,336 INFO L418 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:29,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:29,336 INFO L82 PathProgramCache]: Analyzing trace with hash 2076941001, now seen corresponding path program 79 times [2019-08-05 10:25:29,336 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:29,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:29,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 644 conjuncts, 84 conjunts are in the unsatisfiable core [2019-08-05 10:25:29,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:31,709 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:25:31,754 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 6320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:25:31,755 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:25:31,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2019-08-05 10:25:31,755 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-08-05 10:25:31,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-08-05 10:25:31,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3323, Invalid=3483, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:25:31,756 INFO L87 Difference]: Start difference. First operand 163 states and 163 transitions. Second operand 83 states. [2019-08-05 10:25:35,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:35,423 INFO L93 Difference]: Finished difference Result 166 states and 166 transitions. [2019-08-05 10:25:35,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-08-05 10:25:35,423 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 162 [2019-08-05 10:25:35,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:35,424 INFO L225 Difference]: With dead ends: 166 [2019-08-05 10:25:35,424 INFO L226 Difference]: Without dead ends: 166 [2019-08-05 10:25:35,426 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3239 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=9963, Invalid=16443, Unknown=0, NotChecked=0, Total=26406 [2019-08-05 10:25:35,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-08-05 10:25:35,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 165. [2019-08-05 10:25:35,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-08-05 10:25:35,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2019-08-05 10:25:35,428 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 162 [2019-08-05 10:25:35,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:35,428 INFO L475 AbstractCegarLoop]: Abstraction has 165 states and 165 transitions. [2019-08-05 10:25:35,428 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-08-05 10:25:35,428 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 165 transitions. [2019-08-05 10:25:35,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-08-05 10:25:35,429 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:35,429 INFO L399 BasicCegarLoop]: trace histogram [81, 80, 1, 1, 1] [2019-08-05 10:25:35,429 INFO L418 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:35,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:35,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1219557691, now seen corresponding path program 80 times [2019-08-05 10:25:35,430 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:35,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:35,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 652 conjuncts, 85 conjunts are in the unsatisfiable core [2019-08-05 10:25:35,492 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:37,803 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:25:37,852 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 6480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:25:37,852 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:25:37,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2019-08-05 10:25:37,852 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-08-05 10:25:37,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-08-05 10:25:37,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3405, Invalid=3567, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 10:25:37,853 INFO L87 Difference]: Start difference. First operand 165 states and 165 transitions. Second operand 84 states. [2019-08-05 10:25:41,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:41,602 INFO L93 Difference]: Finished difference Result 168 states and 168 transitions. [2019-08-05 10:25:41,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-08-05 10:25:41,603 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 164 [2019-08-05 10:25:41,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:41,604 INFO L225 Difference]: With dead ends: 168 [2019-08-05 10:25:41,604 INFO L226 Difference]: Without dead ends: 168 [2019-08-05 10:25:41,605 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3320 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=10209, Invalid=16851, Unknown=0, NotChecked=0, Total=27060 [2019-08-05 10:25:41,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-08-05 10:25:41,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 167. [2019-08-05 10:25:41,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-08-05 10:25:41,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 167 transitions. [2019-08-05 10:25:41,608 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 167 transitions. Word has length 164 [2019-08-05 10:25:41,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:41,608 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 167 transitions. [2019-08-05 10:25:41,608 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-08-05 10:25:41,608 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 167 transitions. [2019-08-05 10:25:41,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-08-05 10:25:41,609 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:41,609 INFO L399 BasicCegarLoop]: trace histogram [82, 81, 1, 1, 1] [2019-08-05 10:25:41,609 INFO L418 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:41,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:41,609 INFO L82 PathProgramCache]: Analyzing trace with hash 531063745, now seen corresponding path program 81 times [2019-08-05 10:25:41,610 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:41,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:41,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 660 conjuncts, 86 conjunts are in the unsatisfiable core [2019-08-05 10:25:41,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:44,233 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:25:44,283 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 6642 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:25:44,283 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:25:44,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2019-08-05 10:25:44,284 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-08-05 10:25:44,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-08-05 10:25:44,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3488, Invalid=3652, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 10:25:44,284 INFO L87 Difference]: Start difference. First operand 167 states and 167 transitions. Second operand 85 states. [2019-08-05 10:25:47,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:47,872 INFO L93 Difference]: Finished difference Result 170 states and 170 transitions. [2019-08-05 10:25:47,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-08-05 10:25:47,872 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 166 [2019-08-05 10:25:47,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:47,873 INFO L225 Difference]: With dead ends: 170 [2019-08-05 10:25:47,873 INFO L226 Difference]: Without dead ends: 170 [2019-08-05 10:25:47,875 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3402 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=10458, Invalid=17264, Unknown=0, NotChecked=0, Total=27722 [2019-08-05 10:25:47,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-08-05 10:25:47,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 169. [2019-08-05 10:25:47,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-08-05 10:25:47,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 169 transitions. [2019-08-05 10:25:47,877 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 169 transitions. Word has length 166 [2019-08-05 10:25:47,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:47,878 INFO L475 AbstractCegarLoop]: Abstraction has 169 states and 169 transitions. [2019-08-05 10:25:47,878 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-08-05 10:25:47,878 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 169 transitions. [2019-08-05 10:25:47,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-08-05 10:25:47,878 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:47,878 INFO L399 BasicCegarLoop]: trace histogram [83, 82, 1, 1, 1] [2019-08-05 10:25:47,879 INFO L418 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:47,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:47,879 INFO L82 PathProgramCache]: Analyzing trace with hash -748916291, now seen corresponding path program 82 times [2019-08-05 10:25:47,879 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:47,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:47,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 668 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-05 10:25:47,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:50,575 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:25:50,623 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 6806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:25:50,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:25:50,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2019-08-05 10:25:50,624 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-08-05 10:25:50,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-08-05 10:25:50,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3572, Invalid=3738, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 10:25:50,625 INFO L87 Difference]: Start difference. First operand 169 states and 169 transitions. Second operand 86 states. [2019-08-05 10:25:54,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:54,555 INFO L93 Difference]: Finished difference Result 172 states and 172 transitions. [2019-08-05 10:25:54,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-08-05 10:25:54,556 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 168 [2019-08-05 10:25:54,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:54,557 INFO L225 Difference]: With dead ends: 172 [2019-08-05 10:25:54,557 INFO L226 Difference]: Without dead ends: 172 [2019-08-05 10:25:54,559 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3485 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=10710, Invalid=17682, Unknown=0, NotChecked=0, Total=28392 [2019-08-05 10:25:54,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-08-05 10:25:54,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 171. [2019-08-05 10:25:54,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-08-05 10:25:54,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2019-08-05 10:25:54,560 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 168 [2019-08-05 10:25:54,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:54,561 INFO L475 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2019-08-05 10:25:54,561 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-08-05 10:25:54,561 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2019-08-05 10:25:54,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-08-05 10:25:54,561 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:54,561 INFO L399 BasicCegarLoop]: trace histogram [84, 83, 1, 1, 1] [2019-08-05 10:25:54,562 INFO L418 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:54,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:54,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1845883065, now seen corresponding path program 83 times [2019-08-05 10:25:54,562 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:54,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:54,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 676 conjuncts, 88 conjunts are in the unsatisfiable core [2019-08-05 10:25:54,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:56,992 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:25:57,040 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 6972 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:25:57,040 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:25:57,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2019-08-05 10:25:57,040 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-08-05 10:25:57,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-08-05 10:25:57,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3657, Invalid=3825, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 10:25:57,041 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 87 states. [2019-08-05 10:26:00,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:00,979 INFO L93 Difference]: Finished difference Result 174 states and 174 transitions. [2019-08-05 10:26:00,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-08-05 10:26:00,979 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 170 [2019-08-05 10:26:00,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:00,980 INFO L225 Difference]: With dead ends: 174 [2019-08-05 10:26:00,980 INFO L226 Difference]: Without dead ends: 174 [2019-08-05 10:26:00,981 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3569 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=10965, Invalid=18105, Unknown=0, NotChecked=0, Total=29070 [2019-08-05 10:26:00,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-08-05 10:26:00,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2019-08-05 10:26:00,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-08-05 10:26:00,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2019-08-05 10:26:00,983 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 170 [2019-08-05 10:26:00,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:00,983 INFO L475 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2019-08-05 10:26:00,983 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-08-05 10:26:00,983 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2019-08-05 10:26:00,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-08-05 10:26:00,984 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:00,984 INFO L399 BasicCegarLoop]: trace histogram [85, 84, 1, 1, 1] [2019-08-05 10:26:00,984 INFO L418 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:00,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:00,985 INFO L82 PathProgramCache]: Analyzing trace with hash 72065205, now seen corresponding path program 84 times [2019-08-05 10:26:00,986 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:01,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:01,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 684 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-05 10:26:01,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:03,707 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:26:03,870 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 7140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:26:03,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:03,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2019-08-05 10:26:03,871 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-08-05 10:26:03,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-08-05 10:26:03,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3743, Invalid=3913, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 10:26:03,872 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 88 states. [2019-08-05 10:26:07,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:07,802 INFO L93 Difference]: Finished difference Result 176 states and 176 transitions. [2019-08-05 10:26:07,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-08-05 10:26:07,803 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 172 [2019-08-05 10:26:07,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:07,804 INFO L225 Difference]: With dead ends: 176 [2019-08-05 10:26:07,804 INFO L226 Difference]: Without dead ends: 176 [2019-08-05 10:26:07,805 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3654 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=11223, Invalid=18533, Unknown=0, NotChecked=0, Total=29756 [2019-08-05 10:26:07,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-08-05 10:26:07,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 175. [2019-08-05 10:26:07,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-08-05 10:26:07,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 175 transitions. [2019-08-05 10:26:07,808 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 175 transitions. Word has length 172 [2019-08-05 10:26:07,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:07,808 INFO L475 AbstractCegarLoop]: Abstraction has 175 states and 175 transitions. [2019-08-05 10:26:07,808 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-08-05 10:26:07,808 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 175 transitions. [2019-08-05 10:26:07,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-08-05 10:26:07,809 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:07,809 INFO L399 BasicCegarLoop]: trace histogram [86, 85, 1, 1, 1] [2019-08-05 10:26:07,810 INFO L418 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:07,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:07,810 INFO L82 PathProgramCache]: Analyzing trace with hash 535118257, now seen corresponding path program 85 times [2019-08-05 10:26:07,811 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:07,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:07,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 692 conjuncts, 90 conjunts are in the unsatisfiable core [2019-08-05 10:26:07,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:10,639 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:26:10,694 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 7310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:26:10,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:10,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2019-08-05 10:26:10,695 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-08-05 10:26:10,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-08-05 10:26:10,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3830, Invalid=4002, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 10:26:10,696 INFO L87 Difference]: Start difference. First operand 175 states and 175 transitions. Second operand 89 states. [2019-08-05 10:26:14,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:14,918 INFO L93 Difference]: Finished difference Result 178 states and 178 transitions. [2019-08-05 10:26:14,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-08-05 10:26:14,918 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 174 [2019-08-05 10:26:14,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:14,919 INFO L225 Difference]: With dead ends: 178 [2019-08-05 10:26:14,920 INFO L226 Difference]: Without dead ends: 178 [2019-08-05 10:26:14,921 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3740 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=11484, Invalid=18966, Unknown=0, NotChecked=0, Total=30450 [2019-08-05 10:26:14,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-08-05 10:26:14,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 177. [2019-08-05 10:26:14,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-08-05 10:26:14,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2019-08-05 10:26:14,924 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 174 [2019-08-05 10:26:14,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:14,924 INFO L475 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2019-08-05 10:26:14,924 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-08-05 10:26:14,924 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2019-08-05 10:26:14,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-08-05 10:26:14,925 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:14,925 INFO L399 BasicCegarLoop]: trace histogram [87, 86, 1, 1, 1] [2019-08-05 10:26:14,926 INFO L418 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:14,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:14,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1147497555, now seen corresponding path program 86 times [2019-08-05 10:26:14,926 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:14,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:14,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 700 conjuncts, 91 conjunts are in the unsatisfiable core [2019-08-05 10:26:14,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:18,194 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:26:18,247 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 7482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:26:18,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:18,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2019-08-05 10:26:18,248 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-08-05 10:26:18,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-08-05 10:26:18,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3918, Invalid=4092, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 10:26:18,249 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 90 states. Received shutdown request... [2019-08-05 10:26:18,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 10:26:18,774 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 10:26:18,780 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 10:26:18,780 INFO L202 PluginConnector]: Adding new model count_by_1_variant.i_2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:26:18 BoogieIcfgContainer [2019-08-05 10:26:18,780 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:26:18,783 INFO L168 Benchmark]: Toolchain (without parser) took 240900.86 ms. Allocated memory was 133.2 MB in the beginning and 962.6 MB in the end (delta: 829.4 MB). Free memory was 109.6 MB in the beginning and 537.9 MB in the end (delta: -428.3 MB). Peak memory consumption was 401.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:26:18,783 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 133.2 MB. Free memory is still 110.4 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 10:26:18,784 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.32 ms. Allocated memory is still 133.2 MB. Free memory was 109.6 MB in the beginning and 107.9 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:26:18,785 INFO L168 Benchmark]: Boogie Preprocessor took 19.87 ms. Allocated memory is still 133.2 MB. Free memory was 107.9 MB in the beginning and 106.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:26:18,786 INFO L168 Benchmark]: RCFGBuilder took 305.17 ms. Allocated memory is still 133.2 MB. Free memory was 106.6 MB in the beginning and 97.2 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. [2019-08-05 10:26:18,787 INFO L168 Benchmark]: TraceAbstraction took 240538.48 ms. Allocated memory was 133.2 MB in the beginning and 962.6 MB in the end (delta: 829.4 MB). Free memory was 97.2 MB in the beginning and 537.9 MB in the end (delta: -440.7 MB). Peak memory consumption was 388.7 MB. Max. memory is 7.1 GB. [2019-08-05 10:26:18,794 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.19 ms. Allocated memory is still 133.2 MB. Free memory is still 110.4 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 32.32 ms. Allocated memory is still 133.2 MB. Free memory was 109.6 MB in the beginning and 107.9 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 19.87 ms. Allocated memory is still 133.2 MB. Free memory was 107.9 MB in the beginning and 106.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 305.17 ms. Allocated memory is still 133.2 MB. Free memory was 106.6 MB in the beginning and 97.2 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 240538.48 ms. Allocated memory was 133.2 MB in the beginning and 962.6 MB in the end (delta: 829.4 MB). Free memory was 97.2 MB in the beginning and 537.9 MB in the end (delta: -440.7 MB). Peak memory consumption was 388.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 34]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 34). Cancelled while BasicCegarLoop was constructing difference of abstraction (177states) and FLOYD_HOARE automaton (currently 30 states, 90 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 117 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. TIMEOUT Result, 240.4s OverallTime, 87 OverallIterations, 87 TraceHistogramMax, 134.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 260 SDtfs, 87 SDslu, 1333 SDs, 0 SdLazy, 8053 SolverSat, 7739 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 11512 GetRequests, 3828 SyntacticMatches, 0 SemanticMatches, 7683 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110103 ImplicationChecksByTransitivity, 216.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=177occurred in iteration=86, 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.2s AutomataMinimizationTime, 86 MinimizatonAttempts, 86 StatesRemovedByMinimization, 86 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 102.4s InterpolantComputationTime, 7830 NumberOfCodeBlocks, 7830 NumberOfCodeBlocksAsserted, 87 NumberOfCheckSat, 7743 ConstructedInterpolants, 0 QuantifiedInterpolants, 2710311 SizeOfPredicates, 261 NumberOfNonLiveVariables, 30972 ConjunctsInSsa, 4176 ConjunctsInUnsatCore, 87 InterpolantComputations, 1 PerfectInterpolantSequences, 0/219472 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown