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/down.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:17:01,580 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:17:01,584 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:17:01,600 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:17:01,600 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:17:01,602 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:17:01,604 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:17:01,607 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:17:01,609 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:17:01,611 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:17:01,613 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:17:01,614 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:17:01,614 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:17:01,615 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:17:01,616 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:17:01,626 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:17:01,627 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:17:01,629 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:17:01,631 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:17:01,635 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:17:01,638 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:17:01,639 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:17:01,640 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:17:01,641 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:17:01,644 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:17:01,645 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:17:01,645 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:17:01,646 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:17:01,647 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:17:01,648 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:17:01,649 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:17:01,651 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:17:01,653 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:17:01,654 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:17:01,656 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:17:01,656 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:17:01,657 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:17:01,657 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:17:01,658 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:17:01,659 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:17:01,659 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:17:01,703 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:17:01,722 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:17:01,726 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:17:01,728 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:17:01,729 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:17:01,729 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/down.i_4.bpl [2019-08-05 10:17:01,730 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/down.i_4.bpl' [2019-08-05 10:17:01,768 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:17:01,770 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:17:01,771 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:17:01,771 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:17:01,771 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:17:01,788 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "down.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:17:01" (1/1) ... [2019-08-05 10:17:01,797 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "down.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:17:01" (1/1) ... [2019-08-05 10:17:01,805 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:17:01,806 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:17:01,807 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:17:01,807 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:17:01,817 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "down.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:17:01" (1/1) ... [2019-08-05 10:17:01,818 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "down.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:17:01" (1/1) ... [2019-08-05 10:17:01,819 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "down.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:17:01" (1/1) ... [2019-08-05 10:17:01,819 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "down.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:17:01" (1/1) ... [2019-08-05 10:17:01,822 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "down.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:17:01" (1/1) ... [2019-08-05 10:17:01,824 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "down.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:17:01" (1/1) ... [2019-08-05 10:17:01,825 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "down.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:17:01" (1/1) ... [2019-08-05 10:17:01,827 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:17:01,827 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:17:01,827 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:17:01,828 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:17:01,829 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "down.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:17:01" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 10:17:01,901 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 10:17:01,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 10:17:02,159 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 10:17:02,160 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-08-05 10:17:02,161 INFO L202 PluginConnector]: Adding new model down.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:17:02 BoogieIcfgContainer [2019-08-05 10:17:02,161 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:17:02,162 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:17:02,163 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:17:02,169 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:17:02,170 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "down.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:17:01" (1/2) ... [2019-08-05 10:17:02,171 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53e7e9cc and model type down.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:17:02, skipping insertion in model container [2019-08-05 10:17:02,171 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "down.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:17:02" (2/2) ... [2019-08-05 10:17:02,174 INFO L109 eAbstractionObserver]: Analyzing ICFG down.i_4.bpl [2019-08-05 10:17:02,185 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:17:02,193 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:17:02,210 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:17:02,239 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:17:02,240 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:17:02,240 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:17:02,240 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:17:02,240 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:17:02,240 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:17:02,241 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:17:02,241 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:17:02,241 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:17:02,255 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-08-05 10:17:02,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:17:02,263 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:02,264 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-05 10:17:02,266 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:02,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:02,272 INFO L82 PathProgramCache]: Analyzing trace with hash 28787237, now seen corresponding path program 1 times [2019-08-05 10:17:02,318 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:02,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:02,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:17:02,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:02,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:02,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:17:02,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:17:02,497 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:17:02,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:17:02,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:17:02,517 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 4 states. [2019-08-05 10:17:02,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:02,633 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2019-08-05 10:17:02,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:17:02,635 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-08-05 10:17:02,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:02,645 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:17:02,646 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 10:17:02,648 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:17:02,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 10:17:02,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 10:17:02,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:17:02,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-08-05 10:17:02,681 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 5 [2019-08-05 10:17:02,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:02,682 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-08-05 10:17:02,682 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:17:02,682 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-08-05 10:17:02,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:17:02,683 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:02,683 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-05 10:17:02,684 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:02,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:02,684 INFO L82 PathProgramCache]: Analyzing trace with hash 894126414, now seen corresponding path program 1 times [2019-08-05 10:17:02,685 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:02,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:02,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:17:02,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:02,790 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:17:02,819 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:02,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:17:02,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 10:17:02,822 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:17:02,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:17:02,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:17:02,823 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 5 states. [2019-08-05 10:17:02,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:02,921 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2019-08-05 10:17:02,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:17:02,922 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-08-05 10:17:02,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:02,923 INFO L225 Difference]: With dead ends: 13 [2019-08-05 10:17:02,923 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 10:17:02,924 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:17:02,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 10:17:02,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 9. [2019-08-05 10:17:02,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:17:02,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-08-05 10:17:02,927 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2019-08-05 10:17:02,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:02,928 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-08-05 10:17:02,928 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:17:02,928 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2019-08-05 10:17:02,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:17:02,929 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:02,929 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-08-05 10:17:02,929 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:02,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:02,930 INFO L82 PathProgramCache]: Analyzing trace with hash 261957866, now seen corresponding path program 1 times [2019-08-05 10:17:02,931 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:02,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:02,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:17:02,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:03,051 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:03,051 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:03,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:17:03,052 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:17:03,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:17:03,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:17:03,053 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 6 states. [2019-08-05 10:17:03,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:03,324 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2019-08-05 10:17:03,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:17:03,325 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2019-08-05 10:17:03,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:03,325 INFO L225 Difference]: With dead ends: 13 [2019-08-05 10:17:03,326 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:17:03,327 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:17:03,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:17:03,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 10:17:03,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:17:03,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2019-08-05 10:17:03,330 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 8 [2019-08-05 10:17:03,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:03,330 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2019-08-05 10:17:03,331 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:17:03,331 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2019-08-05 10:17:03,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:17:03,331 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:03,331 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2019-08-05 10:17:03,332 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:03,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:03,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1187669281, now seen corresponding path program 2 times [2019-08-05 10:17:03,333 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:03,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:03,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:17:03,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:03,462 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:17:03,479 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:03,479 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:03,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:17:03,480 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:17:03,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:17:03,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:17:03,481 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand 6 states. [2019-08-05 10:17:03,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:03,596 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2019-08-05 10:17:03,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:17:03,597 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-08-05 10:17:03,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:03,598 INFO L225 Difference]: With dead ends: 16 [2019-08-05 10:17:03,598 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 10:17:03,599 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:17:03,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 10:17:03,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 12. [2019-08-05 10:17:03,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:17:03,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2019-08-05 10:17:03,602 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 9 [2019-08-05 10:17:03,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:03,602 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-08-05 10:17:03,603 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:17:03,603 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2019-08-05 10:17:03,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:17:03,603 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:03,603 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2019-08-05 10:17:03,604 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:03,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:03,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1111188483, now seen corresponding path program 3 times [2019-08-05 10:17:03,605 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:03,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:03,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:17:03,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:03,856 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:03,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:03,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:17:03,857 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:17:03,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:17:03,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:17:03,858 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand 8 states. [2019-08-05 10:17:03,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:03,961 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2019-08-05 10:17:03,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:17:03,962 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2019-08-05 10:17:03,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:03,963 INFO L225 Difference]: With dead ends: 18 [2019-08-05 10:17:03,963 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 10:17:03,964 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:17:03,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 10:17:03,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 10:17:03,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:17:03,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-08-05 10:17:03,967 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2019-08-05 10:17:03,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:03,967 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-08-05 10:17:03,967 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:17:03,968 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-08-05 10:17:03,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:17:03,968 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:03,968 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1] [2019-08-05 10:17:03,969 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:03,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:03,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1227431834, now seen corresponding path program 4 times [2019-08-05 10:17:03,970 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:04,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:04,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:17:04,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:04,089 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:17:04,108 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:04,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:04,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:17:04,109 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:17:04,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:17:04,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:17:04,110 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 7 states. [2019-08-05 10:17:04,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:04,526 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2019-08-05 10:17:04,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:17:04,527 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-08-05 10:17:04,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:04,528 INFO L225 Difference]: With dead ends: 19 [2019-08-05 10:17:04,528 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 10:17:04,529 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:17:04,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 10:17:04,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 15. [2019-08-05 10:17:04,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 10:17:04,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-08-05 10:17:04,533 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2019-08-05 10:17:04,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:04,533 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-08-05 10:17:04,533 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:17:04,533 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2019-08-05 10:17:04,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:17:04,534 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:04,534 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1] [2019-08-05 10:17:04,534 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:04,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:04,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1553947138, now seen corresponding path program 5 times [2019-08-05 10:17:04,536 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:04,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:04,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:17:04,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:04,697 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:04,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:04,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:17:04,698 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:17:04,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:17:04,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:17:04,698 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 10 states. [2019-08-05 10:17:04,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:04,891 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2019-08-05 10:17:04,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:17:04,891 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 14 [2019-08-05 10:17:04,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:04,892 INFO L225 Difference]: With dead ends: 23 [2019-08-05 10:17:04,892 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 10:17:04,892 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:17:04,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 10:17:04,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 10:17:04,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 10:17:04,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2019-08-05 10:17:04,895 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 14 [2019-08-05 10:17:04,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:04,896 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2019-08-05 10:17:04,896 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:17:04,896 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2019-08-05 10:17:04,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:17:04,896 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:04,897 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1] [2019-08-05 10:17:04,897 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:04,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:04,897 INFO L82 PathProgramCache]: Analyzing trace with hash 291918073, now seen corresponding path program 6 times [2019-08-05 10:17:04,898 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:04,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:04,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:17:04,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:05,008 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:17:05,022 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:05,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:05,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:17:05,023 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:17:05,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:17:05,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:17:05,024 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 8 states. [2019-08-05 10:17:05,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:05,163 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2019-08-05 10:17:05,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:17:05,163 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2019-08-05 10:17:05,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:05,164 INFO L225 Difference]: With dead ends: 22 [2019-08-05 10:17:05,165 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 10:17:05,165 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:17:05,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 10:17:05,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. [2019-08-05 10:17:05,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 10:17:05,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2019-08-05 10:17:05,169 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 15 [2019-08-05 10:17:05,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:05,170 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2019-08-05 10:17:05,170 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:17:05,170 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2019-08-05 10:17:05,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:17:05,170 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:05,171 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1] [2019-08-05 10:17:05,171 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:05,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:05,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1360327125, now seen corresponding path program 7 times [2019-08-05 10:17:05,172 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:05,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:05,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:17:05,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:05,406 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:05,406 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:05,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:17:05,407 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:17:05,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:17:05,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:17:05,407 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 12 states. [2019-08-05 10:17:05,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:05,627 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2019-08-05 10:17:05,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:17:05,627 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2019-08-05 10:17:05,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:05,628 INFO L225 Difference]: With dead ends: 28 [2019-08-05 10:17:05,628 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 10:17:05,629 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:17:05,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 10:17:05,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 10:17:05,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:17:05,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2019-08-05 10:17:05,632 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 17 [2019-08-05 10:17:05,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:05,632 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-08-05 10:17:05,632 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:17:05,632 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2019-08-05 10:17:05,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:17:05,633 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:05,633 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1] [2019-08-05 10:17:05,633 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:05,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:05,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1898806402, now seen corresponding path program 8 times [2019-08-05 10:17:05,635 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:05,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:05,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:17:05,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:05,836 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:17:05,845 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 15 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:05,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:05,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:17:05,846 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:17:05,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:17:05,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:17:05,847 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 9 states. [2019-08-05 10:17:06,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:06,003 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2019-08-05 10:17:06,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:17:06,007 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-08-05 10:17:06,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:06,008 INFO L225 Difference]: With dead ends: 25 [2019-08-05 10:17:06,008 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 10:17:06,009 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:17:06,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 10:17:06,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2019-08-05 10:17:06,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 10:17:06,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-08-05 10:17:06,012 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 18 [2019-08-05 10:17:06,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:06,012 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-08-05 10:17:06,012 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:17:06,012 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-08-05 10:17:06,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:17:06,013 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:06,013 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1] [2019-08-05 10:17:06,013 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:06,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:06,014 INFO L82 PathProgramCache]: Analyzing trace with hash 608081690, now seen corresponding path program 9 times [2019-08-05 10:17:06,014 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:06,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:06,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:17:06,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:06,294 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:06,294 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:06,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:17:06,295 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:17:06,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:17:06,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:17:06,295 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 14 states. [2019-08-05 10:17:06,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:06,429 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2019-08-05 10:17:06,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:17:06,430 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2019-08-05 10:17:06,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:06,430 INFO L225 Difference]: With dead ends: 33 [2019-08-05 10:17:06,430 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 10:17:06,431 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:17:06,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 10:17:06,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-05 10:17:06,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 10:17:06,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2019-08-05 10:17:06,434 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 20 [2019-08-05 10:17:06,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:06,434 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2019-08-05 10:17:06,434 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:17:06,434 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2019-08-05 10:17:06,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:17:06,435 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:06,435 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 5, 1, 1, 1, 1] [2019-08-05 10:17:06,435 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:06,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:06,435 INFO L82 PathProgramCache]: Analyzing trace with hash -208127791, now seen corresponding path program 10 times [2019-08-05 10:17:06,436 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:06,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:06,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 10:17:06,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:06,617 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:17:06,627 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 21 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:06,628 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:06,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:17:06,628 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:17:06,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:17:06,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:17:06,629 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 10 states. [2019-08-05 10:17:07,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:07,366 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2019-08-05 10:17:07,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:17:07,367 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2019-08-05 10:17:07,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:07,367 INFO L225 Difference]: With dead ends: 28 [2019-08-05 10:17:07,367 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 10:17:07,368 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=164, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:17:07,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 10:17:07,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2019-08-05 10:17:07,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 10:17:07,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2019-08-05 10:17:07,371 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 21 [2019-08-05 10:17:07,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:07,372 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2019-08-05 10:17:07,372 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:17:07,372 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2019-08-05 10:17:07,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:17:07,373 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:07,373 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1] [2019-08-05 10:17:07,373 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:07,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:07,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1852588973, now seen corresponding path program 11 times [2019-08-05 10:17:07,375 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:07,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:07,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 10:17:07,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:07,571 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 42 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:07,572 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:07,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:17:07,572 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:17:07,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:17:07,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:17:07,573 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 16 states. [2019-08-05 10:17:07,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:07,723 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2019-08-05 10:17:07,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:17:07,723 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 23 [2019-08-05 10:17:07,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:07,724 INFO L225 Difference]: With dead ends: 38 [2019-08-05 10:17:07,724 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 10:17:07,725 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=365, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:17:07,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 10:17:07,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-05 10:17:07,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 10:17:07,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-08-05 10:17:07,727 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 23 [2019-08-05 10:17:07,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:07,728 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-08-05 10:17:07,728 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:17:07,728 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2019-08-05 10:17:07,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:17:07,729 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:07,729 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 6, 1, 1, 1, 1] [2019-08-05 10:17:07,729 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:07,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:07,729 INFO L82 PathProgramCache]: Analyzing trace with hash -34196842, now seen corresponding path program 12 times [2019-08-05 10:17:07,730 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:07,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:07,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:17:07,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:07,878 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:17:07,885 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 28 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:07,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:07,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:17:07,887 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:17:07,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:17:07,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:17:07,887 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 11 states. [2019-08-05 10:17:08,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:08,036 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2019-08-05 10:17:08,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:17:08,040 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2019-08-05 10:17:08,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:08,041 INFO L225 Difference]: With dead ends: 31 [2019-08-05 10:17:08,041 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 10:17:08,042 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=135, Invalid=207, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:17:08,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 10:17:08,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2019-08-05 10:17:08,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 10:17:08,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-08-05 10:17:08,046 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2019-08-05 10:17:08,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:08,046 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-08-05 10:17:08,047 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:17:08,047 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-08-05 10:17:08,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:17:08,047 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:08,048 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1, 1] [2019-08-05 10:17:08,048 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:08,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:08,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1496506418, now seen corresponding path program 13 times [2019-08-05 10:17:08,049 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:08,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:08,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:17:08,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:08,341 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 56 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:08,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:08,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:17:08,342 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:17:08,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:17:08,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:17:08,343 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 18 states. [2019-08-05 10:17:08,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:08,655 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2019-08-05 10:17:08,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:17:08,656 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 26 [2019-08-05 10:17:08,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:08,656 INFO L225 Difference]: With dead ends: 43 [2019-08-05 10:17:08,656 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 10:17:08,657 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=177, Invalid=473, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:17:08,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 10:17:08,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-05 10:17:08,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:17:08,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2019-08-05 10:17:08,660 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 26 [2019-08-05 10:17:08,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:08,660 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2019-08-05 10:17:08,660 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:17:08,660 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2019-08-05 10:17:08,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:17:08,661 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:08,661 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 7, 1, 1, 1, 1] [2019-08-05 10:17:08,662 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:08,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:08,662 INFO L82 PathProgramCache]: Analyzing trace with hash 497294505, now seen corresponding path program 14 times [2019-08-05 10:17:08,663 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:08,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:08,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 10:17:08,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:08,770 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:17:08,782 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 36 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:08,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:08,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:17:08,783 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:17:08,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:17:08,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:17:08,784 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 12 states. [2019-08-05 10:17:09,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:09,126 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2019-08-05 10:17:09,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:17:09,127 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2019-08-05 10:17:09,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:09,128 INFO L225 Difference]: With dead ends: 34 [2019-08-05 10:17:09,128 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 10:17:09,129 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=255, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:17:09,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 10:17:09,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2019-08-05 10:17:09,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 10:17:09,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2019-08-05 10:17:09,133 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 27 [2019-08-05 10:17:09,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:09,133 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2019-08-05 10:17:09,133 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:17:09,134 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2019-08-05 10:17:09,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:17:09,134 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:09,134 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 8, 1, 1, 1, 1] [2019-08-05 10:17:09,135 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:09,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:09,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1158582661, now seen corresponding path program 15 times [2019-08-05 10:17:09,136 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:09,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:09,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 10:17:09,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:09,577 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 72 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:09,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:09,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:17:09,578 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:17:09,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:17:09,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:17:09,578 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 20 states. [2019-08-05 10:17:09,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:09,760 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2019-08-05 10:17:09,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:17:09,760 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 29 [2019-08-05 10:17:09,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:09,761 INFO L225 Difference]: With dead ends: 48 [2019-08-05 10:17:09,761 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 10:17:09,761 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=217, Invalid=595, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:17:09,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 10:17:09,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-05 10:17:09,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 10:17:09,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2019-08-05 10:17:09,764 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 29 [2019-08-05 10:17:09,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:09,764 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2019-08-05 10:17:09,764 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:17:09,764 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2019-08-05 10:17:09,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:17:09,765 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:09,765 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 8, 1, 1, 1, 1] [2019-08-05 10:17:09,765 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:09,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:09,766 INFO L82 PathProgramCache]: Analyzing trace with hash 2054811054, now seen corresponding path program 16 times [2019-08-05 10:17:09,766 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:09,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:09,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:17:09,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:09,967 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:17:10,026 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 45 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:10,027 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:10,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:17:10,027 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:17:10,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:17:10,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:17:10,028 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 13 states. [2019-08-05 10:17:10,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:10,232 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2019-08-05 10:17:10,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:17:10,233 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2019-08-05 10:17:10,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:10,233 INFO L225 Difference]: With dead ends: 37 [2019-08-05 10:17:10,234 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 10:17:10,235 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=198, Invalid=308, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:17:10,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 10:17:10,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2019-08-05 10:17:10,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 10:17:10,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2019-08-05 10:17:10,238 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 30 [2019-08-05 10:17:10,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:10,239 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2019-08-05 10:17:10,239 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:17:10,239 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2019-08-05 10:17:10,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:17:10,239 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:10,240 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 9, 1, 1, 1, 1] [2019-08-05 10:17:10,240 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:10,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:10,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1011600054, now seen corresponding path program 17 times [2019-08-05 10:17:10,241 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:10,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:10,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:17:10,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:10,967 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 90 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:10,967 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:10,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:17:10,968 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:17:10,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:17:10,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:17:10,969 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 22 states. [2019-08-05 10:17:11,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:11,297 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2019-08-05 10:17:11,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:17:11,298 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 32 [2019-08-05 10:17:11,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:11,299 INFO L225 Difference]: With dead ends: 53 [2019-08-05 10:17:11,299 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 10:17:11,300 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=261, Invalid=731, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:17:11,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 10:17:11,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-08-05 10:17:11,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 10:17:11,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2019-08-05 10:17:11,303 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 32 [2019-08-05 10:17:11,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:11,303 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2019-08-05 10:17:11,303 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:17:11,303 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2019-08-05 10:17:11,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 10:17:11,304 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:11,304 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 9, 1, 1, 1, 1] [2019-08-05 10:17:11,304 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:11,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:11,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1011743873, now seen corresponding path program 18 times [2019-08-05 10:17:11,305 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:11,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:11,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 10:17:11,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:11,465 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:17:11,482 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 55 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:11,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:11,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:17:11,483 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:17:11,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:17:11,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:17:11,484 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 14 states. [2019-08-05 10:17:11,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:11,665 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2019-08-05 10:17:11,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:17:11,666 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 33 [2019-08-05 10:17:11,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:11,666 INFO L225 Difference]: With dead ends: 40 [2019-08-05 10:17:11,666 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 10:17:11,667 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=234, Invalid=366, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:17:11,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 10:17:11,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2019-08-05 10:17:11,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:17:11,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2019-08-05 10:17:11,671 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 33 [2019-08-05 10:17:11,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:11,672 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2019-08-05 10:17:11,672 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:17:11,672 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2019-08-05 10:17:11,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:17:11,672 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:11,673 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1] [2019-08-05 10:17:11,673 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:11,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:11,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1623186269, now seen corresponding path program 19 times [2019-08-05 10:17:11,674 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:11,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:11,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 10:17:11,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:11,988 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 110 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:11,989 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:11,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:17:11,989 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:17:11,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:17:11,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:17:11,990 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 24 states. [2019-08-05 10:17:12,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:12,232 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2019-08-05 10:17:12,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:17:12,232 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 35 [2019-08-05 10:17:12,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:12,233 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:17:12,233 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 10:17:12,234 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=309, Invalid=881, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:17:12,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 10:17:12,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-05 10:17:12,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 10:17:12,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2019-08-05 10:17:12,238 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 35 [2019-08-05 10:17:12,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:12,239 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2019-08-05 10:17:12,239 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:17:12,239 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2019-08-05 10:17:12,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 10:17:12,240 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:12,240 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 10, 1, 1, 1, 1] [2019-08-05 10:17:12,240 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:12,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:12,240 INFO L82 PathProgramCache]: Analyzing trace with hash -803883834, now seen corresponding path program 20 times [2019-08-05 10:17:12,241 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:12,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:12,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 10:17:12,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:12,414 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:17:12,456 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 66 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:12,456 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:12,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:17:12,457 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:17:12,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:17:12,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:17:12,458 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 15 states. [2019-08-05 10:17:13,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:13,053 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2019-08-05 10:17:13,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:17:13,055 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 36 [2019-08-05 10:17:13,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:13,056 INFO L225 Difference]: With dead ends: 43 [2019-08-05 10:17:13,056 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 10:17:13,056 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=273, Invalid=429, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:17:13,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 10:17:13,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2019-08-05 10:17:13,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 10:17:13,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2019-08-05 10:17:13,060 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 36 [2019-08-05 10:17:13,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:13,060 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2019-08-05 10:17:13,060 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:17:13,060 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2019-08-05 10:17:13,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 10:17:13,061 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:13,061 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 11, 1, 1, 1, 1] [2019-08-05 10:17:13,061 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:13,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:13,061 INFO L82 PathProgramCache]: Analyzing trace with hash 561682018, now seen corresponding path program 21 times [2019-08-05 10:17:13,062 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:13,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:13,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 10:17:13,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:14,141 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 132 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:14,142 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:14,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:17:14,142 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:17:14,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:17:14,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=469, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:17:14,143 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 26 states. [2019-08-05 10:17:14,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:14,481 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2019-08-05 10:17:14,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:17:14,481 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 38 [2019-08-05 10:17:14,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:14,482 INFO L225 Difference]: With dead ends: 63 [2019-08-05 10:17:14,482 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 10:17:14,483 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=361, Invalid=1045, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:17:14,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 10:17:14,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-08-05 10:17:14,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:17:14,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2019-08-05 10:17:14,487 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 38 [2019-08-05 10:17:14,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:14,487 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2019-08-05 10:17:14,487 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:17:14,487 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2019-08-05 10:17:14,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 10:17:14,488 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:14,488 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 11, 1, 1, 1, 1] [2019-08-05 10:17:14,488 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:14,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:14,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1490671705, now seen corresponding path program 22 times [2019-08-05 10:17:14,489 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:14,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:14,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 10:17:14,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:14,725 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:17:14,733 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 78 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:14,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:14,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:17:14,734 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:17:14,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:17:14,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=133, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:17:14,736 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 16 states. [2019-08-05 10:17:14,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:14,996 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2019-08-05 10:17:14,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:17:14,996 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 39 [2019-08-05 10:17:14,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:14,997 INFO L225 Difference]: With dead ends: 46 [2019-08-05 10:17:14,997 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 10:17:14,998 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=315, Invalid=497, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:17:14,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 10:17:15,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2019-08-05 10:17:15,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:17:15,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2019-08-05 10:17:15,001 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 39 [2019-08-05 10:17:15,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:15,001 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2019-08-05 10:17:15,001 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:17:15,002 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2019-08-05 10:17:15,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 10:17:15,002 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:15,002 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 12, 1, 1, 1, 1] [2019-08-05 10:17:15,002 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:15,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:15,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1983635147, now seen corresponding path program 23 times [2019-08-05 10:17:15,003 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:15,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:15,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 10:17:15,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:15,716 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 156 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:15,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:15,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 10:17:15,717 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:17:15,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:17:15,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=547, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:17:15,718 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 28 states. [2019-08-05 10:17:16,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:16,173 INFO L93 Difference]: Finished difference Result 68 states and 69 transitions. [2019-08-05 10:17:16,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:17:16,173 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 41 [2019-08-05 10:17:16,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:16,174 INFO L225 Difference]: With dead ends: 68 [2019-08-05 10:17:16,174 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 10:17:16,174 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=417, Invalid=1223, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:17:16,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 10:17:16,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-05 10:17:16,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 10:17:16,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2019-08-05 10:17:16,177 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 41 [2019-08-05 10:17:16,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:16,177 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2019-08-05 10:17:16,177 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:17:16,177 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2019-08-05 10:17:16,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 10:17:16,178 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:16,178 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 12, 1, 1, 1, 1] [2019-08-05 10:17:16,178 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:16,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:16,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1073842142, now seen corresponding path program 24 times [2019-08-05 10:17:16,179 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:16,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:16,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 10:17:16,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:16,443 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:17:16,490 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 91 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:16,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:16,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:17:16,490 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:17:16,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:17:16,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=150, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:17:16,492 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 17 states. [2019-08-05 10:17:16,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:16,712 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2019-08-05 10:17:16,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 10:17:16,712 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 42 [2019-08-05 10:17:16,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:16,713 INFO L225 Difference]: With dead ends: 49 [2019-08-05 10:17:16,713 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 10:17:16,714 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=360, Invalid=570, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:17:16,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 10:17:16,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2019-08-05 10:17:16,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 10:17:16,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2019-08-05 10:17:16,718 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 42 [2019-08-05 10:17:16,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:16,718 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2019-08-05 10:17:16,718 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:17:16,718 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2019-08-05 10:17:16,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 10:17:16,719 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:16,719 INFO L399 BasicCegarLoop]: trace histogram [14, 13, 13, 1, 1, 1, 1] [2019-08-05 10:17:16,719 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:16,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:16,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1170080634, now seen corresponding path program 25 times [2019-08-05 10:17:16,720 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:16,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:16,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 10:17:16,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:17,445 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 182 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:17,445 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:17,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 10:17:17,446 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:17:17,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:17:17,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=631, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:17:17,447 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 30 states. [2019-08-05 10:17:17,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:17,891 INFO L93 Difference]: Finished difference Result 73 states and 74 transitions. [2019-08-05 10:17:17,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 10:17:17,891 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 44 [2019-08-05 10:17:17,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:17,892 INFO L225 Difference]: With dead ends: 73 [2019-08-05 10:17:17,892 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 10:17:17,893 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=477, Invalid=1415, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:17:17,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 10:17:17,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-08-05 10:17:17,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:17:17,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2019-08-05 10:17:17,895 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 44 [2019-08-05 10:17:17,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:17,896 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2019-08-05 10:17:17,896 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:17:17,896 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2019-08-05 10:17:17,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 10:17:17,896 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:17,896 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 13, 1, 1, 1, 1] [2019-08-05 10:17:17,896 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:17,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:17,897 INFO L82 PathProgramCache]: Analyzing trace with hash -1190416335, now seen corresponding path program 26 times [2019-08-05 10:17:17,897 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:17,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:17,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 10:17:17,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:18,122 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:17:18,161 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 105 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:18,161 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:18,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:17:18,162 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:17:18,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:17:18,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=168, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:17:18,162 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 18 states. [2019-08-05 10:17:18,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:18,686 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2019-08-05 10:17:18,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:17:18,687 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 45 [2019-08-05 10:17:18,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:18,688 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:17:18,688 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 10:17:18,689 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=408, Invalid=648, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:17:18,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 10:17:18,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2019-08-05 10:17:18,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:17:18,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2019-08-05 10:17:18,691 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 45 [2019-08-05 10:17:18,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:18,691 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2019-08-05 10:17:18,691 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:17:18,691 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2019-08-05 10:17:18,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 10:17:18,692 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:18,699 INFO L399 BasicCegarLoop]: trace histogram [15, 14, 14, 1, 1, 1, 1] [2019-08-05 10:17:18,699 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:18,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:18,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1528863987, now seen corresponding path program 27 times [2019-08-05 10:17:18,700 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:18,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:18,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 10:17:18,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:19,119 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 210 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:19,119 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:19,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 10:17:19,119 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:17:19,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:17:19,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=721, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:17:19,120 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 32 states. [2019-08-05 10:17:19,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:19,911 INFO L93 Difference]: Finished difference Result 78 states and 79 transitions. [2019-08-05 10:17:19,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:17:19,911 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 47 [2019-08-05 10:17:19,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:19,912 INFO L225 Difference]: With dead ends: 78 [2019-08-05 10:17:19,912 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 10:17:19,913 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=541, Invalid=1621, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:17:19,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 10:17:19,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-08-05 10:17:19,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 10:17:19,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2019-08-05 10:17:19,915 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 47 [2019-08-05 10:17:19,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:19,915 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2019-08-05 10:17:19,916 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:17:19,916 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2019-08-05 10:17:19,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 10:17:19,916 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:19,916 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 14, 1, 1, 1, 1] [2019-08-05 10:17:19,917 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:19,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:19,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1594530058, now seen corresponding path program 28 times [2019-08-05 10:17:19,918 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:19,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:19,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 10:17:19,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:20,110 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:17:20,222 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 120 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:20,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:20,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:17:20,222 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:17:20,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:17:20,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=187, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:17:20,223 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 19 states. [2019-08-05 10:17:20,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:20,477 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2019-08-05 10:17:20,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:17:20,478 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 48 [2019-08-05 10:17:20,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:20,478 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:17:20,478 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 10:17:20,480 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=459, Invalid=731, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:17:20,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 10:17:20,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 51. [2019-08-05 10:17:20,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 10:17:20,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2019-08-05 10:17:20,482 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 48 [2019-08-05 10:17:20,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:20,482 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2019-08-05 10:17:20,483 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:17:20,483 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2019-08-05 10:17:20,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 10:17:20,483 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:20,484 INFO L399 BasicCegarLoop]: trace histogram [16, 15, 15, 1, 1, 1, 1] [2019-08-05 10:17:20,484 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:20,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:20,484 INFO L82 PathProgramCache]: Analyzing trace with hash 959872146, now seen corresponding path program 29 times [2019-08-05 10:17:20,485 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:20,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:20,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 10:17:20,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:21,199 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 240 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:21,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:21,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:17:21,200 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:17:21,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:17:21,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=817, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:17:21,201 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 34 states. [2019-08-05 10:17:22,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:22,348 INFO L93 Difference]: Finished difference Result 83 states and 84 transitions. [2019-08-05 10:17:22,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:17:22,348 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 50 [2019-08-05 10:17:22,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:22,349 INFO L225 Difference]: With dead ends: 83 [2019-08-05 10:17:22,349 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 10:17:22,351 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=609, Invalid=1841, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:17:22,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 10:17:22,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-05 10:17:22,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:17:22,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2019-08-05 10:17:22,353 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 50 [2019-08-05 10:17:22,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:22,353 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2019-08-05 10:17:22,353 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:17:22,353 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2019-08-05 10:17:22,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 10:17:22,354 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:22,354 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 15, 1, 1, 1, 1] [2019-08-05 10:17:22,354 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:22,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:22,354 INFO L82 PathProgramCache]: Analyzing trace with hash -1087929335, now seen corresponding path program 30 times [2019-08-05 10:17:22,355 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:22,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:22,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 10:17:22,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:22,709 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:17:22,760 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 136 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:22,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:22,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:17:22,761 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:17:22,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:17:22,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=207, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:17:22,762 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand 20 states. [2019-08-05 10:17:23,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:23,065 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2019-08-05 10:17:23,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 10:17:23,068 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 51 [2019-08-05 10:17:23,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:23,069 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:17:23,069 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 10:17:23,070 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=513, Invalid=819, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:17:23,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 10:17:23,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2019-08-05 10:17:23,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-05 10:17:23,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2019-08-05 10:17:23,071 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 51 [2019-08-05 10:17:23,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:23,072 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2019-08-05 10:17:23,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:17:23,072 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2019-08-05 10:17:23,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 10:17:23,072 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:23,073 INFO L399 BasicCegarLoop]: trace histogram [17, 16, 16, 1, 1, 1, 1] [2019-08-05 10:17:23,073 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:23,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:23,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1823104795, now seen corresponding path program 31 times [2019-08-05 10:17:23,074 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:23,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:23,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 10:17:23,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:23,543 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 272 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:23,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:23,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:17:23,543 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 10:17:23,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 10:17:23,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=341, Invalid=919, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:17:23,554 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 36 states. [2019-08-05 10:17:23,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:23,896 INFO L93 Difference]: Finished difference Result 88 states and 89 transitions. [2019-08-05 10:17:23,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 10:17:23,896 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 53 [2019-08-05 10:17:23,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:23,897 INFO L225 Difference]: With dead ends: 88 [2019-08-05 10:17:23,897 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 10:17:23,899 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=681, Invalid=2075, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:17:23,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 10:17:23,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-08-05 10:17:23,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 10:17:23,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2019-08-05 10:17:23,900 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 53 [2019-08-05 10:17:23,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:23,900 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2019-08-05 10:17:23,900 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 10:17:23,901 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2019-08-05 10:17:23,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 10:17:23,901 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:23,901 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 16, 1, 1, 1, 1] [2019-08-05 10:17:23,901 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:23,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:23,902 INFO L82 PathProgramCache]: Analyzing trace with hash 2133414414, now seen corresponding path program 32 times [2019-08-05 10:17:23,902 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:23,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:23,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 10:17:23,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:24,118 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:17:24,128 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 153 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:24,129 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:24,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:17:24,129 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:17:24,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:17:24,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=228, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:17:24,130 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 21 states. [2019-08-05 10:17:24,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:24,487 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2019-08-05 10:17:24,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 10:17:24,488 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 54 [2019-08-05 10:17:24,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:24,489 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:17:24,489 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 10:17:24,490 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=570, Invalid=912, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:17:24,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 10:17:24,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 57. [2019-08-05 10:17:24,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 10:17:24,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2019-08-05 10:17:24,492 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 54 [2019-08-05 10:17:24,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:24,492 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2019-08-05 10:17:24,492 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:17:24,492 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2019-08-05 10:17:24,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-05 10:17:24,493 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:24,493 INFO L399 BasicCegarLoop]: trace histogram [18, 17, 17, 1, 1, 1, 1] [2019-08-05 10:17:24,493 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:24,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:24,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1511784874, now seen corresponding path program 33 times [2019-08-05 10:17:24,494 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:24,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:24,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 10:17:24,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:26,117 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 306 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:26,118 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:26,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:17:26,118 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 10:17:26,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 10:17:26,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=379, Invalid=1027, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:17:26,119 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 38 states. [2019-08-05 10:17:26,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:26,933 INFO L93 Difference]: Finished difference Result 93 states and 94 transitions. [2019-08-05 10:17:26,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 10:17:26,933 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 56 [2019-08-05 10:17:26,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:26,933 INFO L225 Difference]: With dead ends: 93 [2019-08-05 10:17:26,934 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 10:17:26,938 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=757, Invalid=2323, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:17:26,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 10:17:26,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-08-05 10:17:26,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-05 10:17:26,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2019-08-05 10:17:26,940 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 56 [2019-08-05 10:17:26,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:26,940 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2019-08-05 10:17:26,940 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 10:17:26,940 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2019-08-05 10:17:26,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-05 10:17:26,941 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:26,941 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 17, 1, 1, 1, 1] [2019-08-05 10:17:26,941 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:26,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:26,941 INFO L82 PathProgramCache]: Analyzing trace with hash -906931231, now seen corresponding path program 34 times [2019-08-05 10:17:26,942 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:26,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:26,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 10:17:26,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:27,186 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:17:27,200 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 171 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:27,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:27,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:17:27,200 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:17:27,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:17:27,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=250, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:17:27,201 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand 22 states. [2019-08-05 10:17:27,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:27,608 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2019-08-05 10:17:27,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 10:17:27,609 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 57 [2019-08-05 10:17:27,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:27,609 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:17:27,609 INFO L226 Difference]: Without dead ends: 64 [2019-08-05 10:17:27,610 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=630, Invalid=1010, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:17:27,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-05 10:17:27,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 60. [2019-08-05 10:17:27,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-05 10:17:27,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2019-08-05 10:17:27,612 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 57 [2019-08-05 10:17:27,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:27,612 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2019-08-05 10:17:27,612 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:17:27,612 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2019-08-05 10:17:27,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-05 10:17:27,613 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:27,613 INFO L399 BasicCegarLoop]: trace histogram [19, 18, 18, 1, 1, 1, 1] [2019-08-05 10:17:27,613 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:27,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:27,614 INFO L82 PathProgramCache]: Analyzing trace with hash 317381309, now seen corresponding path program 35 times [2019-08-05 10:17:27,614 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:27,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:27,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 10:17:27,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:28,390 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 342 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:28,391 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:28,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 10:17:28,391 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 10:17:28,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 10:17:28,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=419, Invalid=1141, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:17:28,392 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 40 states. [2019-08-05 10:17:29,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:29,310 INFO L93 Difference]: Finished difference Result 98 states and 99 transitions. [2019-08-05 10:17:29,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 10:17:29,310 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 59 [2019-08-05 10:17:29,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:29,311 INFO L225 Difference]: With dead ends: 98 [2019-08-05 10:17:29,311 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 10:17:29,312 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 495 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=837, Invalid=2585, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:17:29,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 10:17:29,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-08-05 10:17:29,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 10:17:29,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2019-08-05 10:17:29,314 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 59 [2019-08-05 10:17:29,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:29,314 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2019-08-05 10:17:29,314 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 10:17:29,314 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2019-08-05 10:17:29,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 10:17:29,315 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:29,315 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 18, 1, 1, 1, 1] [2019-08-05 10:17:29,315 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:29,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:29,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1012222246, now seen corresponding path program 36 times [2019-08-05 10:17:29,316 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:29,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:29,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 10:17:29,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:30,177 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:17:30,191 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 190 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:30,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:30,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:17:30,192 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:17:30,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:17:30,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=273, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:17:30,192 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 23 states. [2019-08-05 10:17:30,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:30,558 INFO L93 Difference]: Finished difference Result 67 states and 68 transitions. [2019-08-05 10:17:30,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 10:17:30,559 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 60 [2019-08-05 10:17:30,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:30,560 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:17:30,560 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 10:17:30,561 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=693, Invalid=1113, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:17:30,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 10:17:30,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 63. [2019-08-05 10:17:30,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 10:17:30,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2019-08-05 10:17:30,563 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 60 [2019-08-05 10:17:30,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:30,563 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2019-08-05 10:17:30,564 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:17:30,564 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2019-08-05 10:17:30,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-05 10:17:30,564 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:30,564 INFO L399 BasicCegarLoop]: trace histogram [20, 19, 19, 1, 1, 1, 1] [2019-08-05 10:17:30,565 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:30,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:30,565 INFO L82 PathProgramCache]: Analyzing trace with hash 2082902722, now seen corresponding path program 37 times [2019-08-05 10:17:30,565 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:30,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:30,590 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 10:17:30,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:31,280 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 380 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:31,281 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:31,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 10:17:31,281 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:17:31,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:17:31,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=461, Invalid=1261, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:17:31,282 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 42 states. [2019-08-05 10:17:32,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:32,011 INFO L93 Difference]: Finished difference Result 103 states and 104 transitions. [2019-08-05 10:17:32,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 10:17:32,012 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 62 [2019-08-05 10:17:32,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:32,013 INFO L225 Difference]: With dead ends: 103 [2019-08-05 10:17:32,013 INFO L226 Difference]: Without dead ends: 64 [2019-08-05 10:17:32,014 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 551 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=921, Invalid=2861, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:17:32,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-05 10:17:32,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-08-05 10:17:32,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-05 10:17:32,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2019-08-05 10:17:32,016 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 62 [2019-08-05 10:17:32,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:32,016 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2019-08-05 10:17:32,016 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:17:32,017 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2019-08-05 10:17:32,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-05 10:17:32,017 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:32,017 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 19, 1, 1, 1, 1] [2019-08-05 10:17:32,017 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:32,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:32,018 INFO L82 PathProgramCache]: Analyzing trace with hash 346890169, now seen corresponding path program 38 times [2019-08-05 10:17:32,019 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:32,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:32,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 10:17:32,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:32,296 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:17:32,316 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 210 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:32,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:32,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:17:32,317 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:17:32,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:17:32,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=297, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:17:32,318 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand 24 states. [2019-08-05 10:17:32,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:32,769 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2019-08-05 10:17:32,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:17:32,769 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 63 [2019-08-05 10:17:32,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:32,770 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:17:32,770 INFO L226 Difference]: Without dead ends: 70 [2019-08-05 10:17:32,771 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=759, Invalid=1221, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:17:32,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-05 10:17:32,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 66. [2019-08-05 10:17:32,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-05 10:17:32,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2019-08-05 10:17:32,774 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 67 transitions. Word has length 63 [2019-08-05 10:17:32,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:32,774 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 67 transitions. [2019-08-05 10:17:32,774 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:17:32,774 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2019-08-05 10:17:32,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-08-05 10:17:32,775 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:32,775 INFO L399 BasicCegarLoop]: trace histogram [21, 20, 20, 1, 1, 1, 1] [2019-08-05 10:17:32,775 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:32,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:32,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1646063467, now seen corresponding path program 39 times [2019-08-05 10:17:32,776 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:32,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:32,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 10:17:32,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:33,484 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 420 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:33,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:33,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 10:17:33,484 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 10:17:33,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 10:17:33,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=505, Invalid=1387, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:17:33,485 INFO L87 Difference]: Start difference. First operand 66 states and 67 transitions. Second operand 44 states. [2019-08-05 10:17:34,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:34,343 INFO L93 Difference]: Finished difference Result 108 states and 109 transitions. [2019-08-05 10:17:34,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:17:34,344 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 65 [2019-08-05 10:17:34,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:34,344 INFO L225 Difference]: With dead ends: 108 [2019-08-05 10:17:34,345 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 10:17:34,346 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 610 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1009, Invalid=3151, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:17:34,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 10:17:34,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-08-05 10:17:34,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 10:17:34,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2019-08-05 10:17:34,348 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 65 [2019-08-05 10:17:34,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:34,348 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2019-08-05 10:17:34,348 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 10:17:34,348 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2019-08-05 10:17:34,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-05 10:17:34,349 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:34,349 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 20, 1, 1, 1, 1] [2019-08-05 10:17:34,349 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:34,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:34,350 INFO L82 PathProgramCache]: Analyzing trace with hash 800148542, now seen corresponding path program 40 times [2019-08-05 10:17:34,350 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:34,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:34,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-05 10:17:34,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:34,650 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:17:34,663 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 231 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:34,663 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:34,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:17:34,663 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:17:34,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:17:34,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=322, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:17:34,664 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 25 states. [2019-08-05 10:17:35,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:35,031 INFO L93 Difference]: Finished difference Result 73 states and 74 transitions. [2019-08-05 10:17:35,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 10:17:35,032 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 66 [2019-08-05 10:17:35,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:35,033 INFO L225 Difference]: With dead ends: 73 [2019-08-05 10:17:35,033 INFO L226 Difference]: Without dead ends: 73 [2019-08-05 10:17:35,033 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=828, Invalid=1334, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:17:35,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-05 10:17:35,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 69. [2019-08-05 10:17:35,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 10:17:35,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2019-08-05 10:17:35,036 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 66 [2019-08-05 10:17:35,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:35,036 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2019-08-05 10:17:35,036 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:17:35,036 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2019-08-05 10:17:35,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 10:17:35,037 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:35,037 INFO L399 BasicCegarLoop]: trace histogram [22, 21, 21, 1, 1, 1, 1] [2019-08-05 10:17:35,037 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:35,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:35,037 INFO L82 PathProgramCache]: Analyzing trace with hash 143536090, now seen corresponding path program 41 times [2019-08-05 10:17:35,038 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:35,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:35,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-05 10:17:35,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:35,731 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 462 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:35,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:35,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 10:17:35,731 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:17:35,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:17:35,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=551, Invalid=1519, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:17:35,732 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 46 states. [2019-08-05 10:17:36,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:36,422 INFO L93 Difference]: Finished difference Result 113 states and 114 transitions. [2019-08-05 10:17:36,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 10:17:36,422 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 68 [2019-08-05 10:17:36,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:36,423 INFO L225 Difference]: With dead ends: 113 [2019-08-05 10:17:36,424 INFO L226 Difference]: Without dead ends: 70 [2019-08-05 10:17:36,425 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 672 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1101, Invalid=3455, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:17:36,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-05 10:17:36,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-08-05 10:17:36,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-05 10:17:36,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2019-08-05 10:17:36,427 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 68 [2019-08-05 10:17:36,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:36,427 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2019-08-05 10:17:36,428 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:17:36,428 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2019-08-05 10:17:36,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 10:17:36,428 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:36,428 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 21, 1, 1, 1, 1] [2019-08-05 10:17:36,428 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:36,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:36,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1759582319, now seen corresponding path program 42 times [2019-08-05 10:17:36,429 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:36,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:36,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 10:17:36,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:36,980 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:17:36,993 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 253 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:36,994 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:36,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:17:36,994 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:17:36,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:17:36,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=302, Invalid=348, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:17:36,995 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand 26 states. [2019-08-05 10:17:37,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:37,462 INFO L93 Difference]: Finished difference Result 76 states and 77 transitions. [2019-08-05 10:17:37,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 10:17:37,462 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 69 [2019-08-05 10:17:37,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:37,463 INFO L225 Difference]: With dead ends: 76 [2019-08-05 10:17:37,463 INFO L226 Difference]: Without dead ends: 76 [2019-08-05 10:17:37,464 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 506 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=900, Invalid=1452, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:17:37,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-05 10:17:37,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 72. [2019-08-05 10:17:37,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-08-05 10:17:37,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2019-08-05 10:17:37,466 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 69 [2019-08-05 10:17:37,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:37,466 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2019-08-05 10:17:37,466 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:17:37,467 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2019-08-05 10:17:37,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-05 10:17:37,467 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:37,467 INFO L399 BasicCegarLoop]: trace histogram [23, 22, 22, 1, 1, 1, 1] [2019-08-05 10:17:37,467 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:37,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:37,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1258439277, now seen corresponding path program 43 times [2019-08-05 10:17:37,468 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:37,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:37,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 10:17:37,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:38,448 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 506 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:38,449 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:38,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 10:17:38,449 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 10:17:38,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 10:17:38,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=599, Invalid=1657, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:17:38,450 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 48 states. [2019-08-05 10:17:39,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:39,231 INFO L93 Difference]: Finished difference Result 118 states and 119 transitions. [2019-08-05 10:17:39,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 10:17:39,231 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 71 [2019-08-05 10:17:39,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:39,232 INFO L225 Difference]: With dead ends: 118 [2019-08-05 10:17:39,233 INFO L226 Difference]: Without dead ends: 73 [2019-08-05 10:17:39,234 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 737 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1197, Invalid=3773, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:17:39,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-05 10:17:39,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-08-05 10:17:39,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 10:17:39,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2019-08-05 10:17:39,236 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 71 [2019-08-05 10:17:39,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:39,237 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2019-08-05 10:17:39,237 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 10:17:39,237 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2019-08-05 10:17:39,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-05 10:17:39,238 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:39,238 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 22, 1, 1, 1, 1] [2019-08-05 10:17:39,238 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:39,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:39,238 INFO L82 PathProgramCache]: Analyzing trace with hash -973776042, now seen corresponding path program 44 times [2019-08-05 10:17:39,239 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:39,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:39,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 10:17:39,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:39,589 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:17:39,609 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 276 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:39,609 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:39,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:17:39,609 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:17:39,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:17:39,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=327, Invalid=375, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:17:39,610 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 27 states. [2019-08-05 10:17:40,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:40,052 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2019-08-05 10:17:40,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 10:17:40,053 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 72 [2019-08-05 10:17:40,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:40,054 INFO L225 Difference]: With dead ends: 79 [2019-08-05 10:17:40,054 INFO L226 Difference]: Without dead ends: 79 [2019-08-05 10:17:40,054 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=975, Invalid=1575, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:17:40,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-05 10:17:40,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 75. [2019-08-05 10:17:40,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 10:17:40,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2019-08-05 10:17:40,057 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 72 [2019-08-05 10:17:40,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:40,058 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2019-08-05 10:17:40,058 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:17:40,058 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2019-08-05 10:17:40,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-05 10:17:40,058 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:40,059 INFO L399 BasicCegarLoop]: trace histogram [24, 23, 23, 1, 1, 1, 1] [2019-08-05 10:17:40,059 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:40,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:40,059 INFO L82 PathProgramCache]: Analyzing trace with hash 504027378, now seen corresponding path program 45 times [2019-08-05 10:17:40,060 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:40,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:40,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 10:17:40,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:40,798 INFO L134 CoverageAnalysis]: Checked inductivity of 828 backedges. 552 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:40,798 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:40,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 10:17:40,798 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 10:17:40,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 10:17:40,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=649, Invalid=1801, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:17:40,799 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 50 states. [2019-08-05 10:17:41,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:41,475 INFO L93 Difference]: Finished difference Result 123 states and 124 transitions. [2019-08-05 10:17:41,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 10:17:41,476 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 74 [2019-08-05 10:17:41,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:41,476 INFO L225 Difference]: With dead ends: 123 [2019-08-05 10:17:41,477 INFO L226 Difference]: Without dead ends: 76 [2019-08-05 10:17:41,477 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 805 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1297, Invalid=4105, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:17:41,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-05 10:17:41,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-08-05 10:17:41,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-05 10:17:41,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 77 transitions. [2019-08-05 10:17:41,479 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 77 transitions. Word has length 74 [2019-08-05 10:17:41,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:41,479 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 77 transitions. [2019-08-05 10:17:41,479 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 10:17:41,479 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2019-08-05 10:17:41,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-05 10:17:41,479 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:41,479 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 23, 1, 1, 1, 1] [2019-08-05 10:17:41,480 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:41,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:41,480 INFO L82 PathProgramCache]: Analyzing trace with hash -443896983, now seen corresponding path program 46 times [2019-08-05 10:17:41,480 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:41,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:41,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-05 10:17:41,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:42,124 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:17:42,157 INFO L134 CoverageAnalysis]: Checked inductivity of 852 backedges. 300 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:42,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:42,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 10:17:42,158 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:17:42,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:17:42,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=353, Invalid=403, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:17:42,158 INFO L87 Difference]: Start difference. First operand 76 states and 77 transitions. Second operand 28 states. [2019-08-05 10:17:42,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:42,631 INFO L93 Difference]: Finished difference Result 82 states and 83 transitions. [2019-08-05 10:17:42,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 10:17:42,632 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 75 [2019-08-05 10:17:42,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:42,633 INFO L225 Difference]: With dead ends: 82 [2019-08-05 10:17:42,633 INFO L226 Difference]: Without dead ends: 82 [2019-08-05 10:17:42,634 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 600 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1053, Invalid=1703, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:17:42,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-05 10:17:42,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 78. [2019-08-05 10:17:42,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-08-05 10:17:42,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2019-08-05 10:17:42,637 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 75 [2019-08-05 10:17:42,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:42,637 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2019-08-05 10:17:42,637 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:17:42,637 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2019-08-05 10:17:42,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 10:17:42,638 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:42,638 INFO L399 BasicCegarLoop]: trace histogram [25, 24, 24, 1, 1, 1, 1] [2019-08-05 10:17:42,638 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:42,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:42,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1383305147, now seen corresponding path program 47 times [2019-08-05 10:17:42,639 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:42,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:42,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-05 10:17:42,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:43,749 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 600 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:43,749 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:43,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 10:17:43,750 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 10:17:43,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 10:17:43,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=701, Invalid=1951, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:17:43,750 INFO L87 Difference]: Start difference. First operand 78 states and 79 transitions. Second operand 52 states. [2019-08-05 10:17:45,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:45,064 INFO L93 Difference]: Finished difference Result 128 states and 129 transitions. [2019-08-05 10:17:45,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 10:17:45,065 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 77 [2019-08-05 10:17:45,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:45,065 INFO L225 Difference]: With dead ends: 128 [2019-08-05 10:17:45,066 INFO L226 Difference]: Without dead ends: 79 [2019-08-05 10:17:45,067 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 876 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1401, Invalid=4451, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:17:45,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-05 10:17:45,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-08-05 10:17:45,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 10:17:45,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2019-08-05 10:17:45,069 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 77 [2019-08-05 10:17:45,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:45,069 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2019-08-05 10:17:45,069 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 10:17:45,069 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2019-08-05 10:17:45,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-05 10:17:45,070 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:45,070 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 24, 1, 1, 1, 1] [2019-08-05 10:17:45,070 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:45,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:45,070 INFO L82 PathProgramCache]: Analyzing trace with hash -1587972498, now seen corresponding path program 48 times [2019-08-05 10:17:45,071 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:45,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:45,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 10:17:45,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:45,723 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:17:45,739 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 325 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:45,739 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:45,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 10:17:45,740 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 10:17:45,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 10:17:45,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=380, Invalid=432, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:17:45,741 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 29 states. [2019-08-05 10:17:46,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:46,472 INFO L93 Difference]: Finished difference Result 85 states and 86 transitions. [2019-08-05 10:17:46,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 10:17:46,473 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 78 [2019-08-05 10:17:46,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:46,473 INFO L225 Difference]: With dead ends: 85 [2019-08-05 10:17:46,474 INFO L226 Difference]: Without dead ends: 85 [2019-08-05 10:17:46,474 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 650 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1134, Invalid=1836, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:17:46,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-08-05 10:17:46,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2019-08-05 10:17:46,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 10:17:46,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2019-08-05 10:17:46,477 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 78 [2019-08-05 10:17:46,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:46,478 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2019-08-05 10:17:46,478 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 10:17:46,478 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2019-08-05 10:17:46,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-08-05 10:17:46,478 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:46,478 INFO L399 BasicCegarLoop]: trace histogram [26, 25, 25, 1, 1, 1, 1] [2019-08-05 10:17:46,479 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:46,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:46,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1328247286, now seen corresponding path program 49 times [2019-08-05 10:17:46,480 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:46,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:46,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 10:17:46,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:47,642 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 650 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:47,643 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:47,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 10:17:47,643 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 10:17:47,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 10:17:47,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=755, Invalid=2107, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:17:47,644 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 54 states. [2019-08-05 10:17:49,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:49,040 INFO L93 Difference]: Finished difference Result 133 states and 134 transitions. [2019-08-05 10:17:49,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 10:17:49,041 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 80 [2019-08-05 10:17:49,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:49,042 INFO L225 Difference]: With dead ends: 133 [2019-08-05 10:17:49,042 INFO L226 Difference]: Without dead ends: 82 [2019-08-05 10:17:49,043 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 950 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1509, Invalid=4811, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:17:49,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-05 10:17:49,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-08-05 10:17:49,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-08-05 10:17:49,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 83 transitions. [2019-08-05 10:17:49,045 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 83 transitions. Word has length 80 [2019-08-05 10:17:49,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:49,045 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 83 transitions. [2019-08-05 10:17:49,046 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 10:17:49,046 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 83 transitions. [2019-08-05 10:17:49,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-08-05 10:17:49,046 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:49,046 INFO L399 BasicCegarLoop]: trace histogram [26, 26, 25, 1, 1, 1, 1] [2019-08-05 10:17:49,047 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:49,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:49,047 INFO L82 PathProgramCache]: Analyzing trace with hash 280259393, now seen corresponding path program 50 times [2019-08-05 10:17:49,048 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:49,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:49,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-05 10:17:49,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:49,473 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:17:49,489 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 351 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:49,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:49,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 10:17:49,489 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:17:49,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:17:49,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=408, Invalid=462, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:17:49,490 INFO L87 Difference]: Start difference. First operand 82 states and 83 transitions. Second operand 30 states. [2019-08-05 10:17:50,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:50,021 INFO L93 Difference]: Finished difference Result 88 states and 89 transitions. [2019-08-05 10:17:50,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 10:17:50,022 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 81 [2019-08-05 10:17:50,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:50,023 INFO L225 Difference]: With dead ends: 88 [2019-08-05 10:17:50,023 INFO L226 Difference]: Without dead ends: 88 [2019-08-05 10:17:50,023 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 702 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1218, Invalid=1974, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:17:50,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-08-05 10:17:50,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 84. [2019-08-05 10:17:50,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-08-05 10:17:50,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 85 transitions. [2019-08-05 10:17:50,026 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 85 transitions. Word has length 81 [2019-08-05 10:17:50,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:50,027 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 85 transitions. [2019-08-05 10:17:50,027 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:17:50,027 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2019-08-05 10:17:50,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-08-05 10:17:50,028 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:50,028 INFO L399 BasicCegarLoop]: trace histogram [27, 26, 26, 1, 1, 1, 1] [2019-08-05 10:17:50,028 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:50,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:50,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1253729763, now seen corresponding path program 51 times [2019-08-05 10:17:50,029 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:50,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:50,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-05 10:17:50,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:51,001 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 702 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:51,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:51,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 10:17:51,002 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 10:17:51,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 10:17:51,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=811, Invalid=2269, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:17:51,002 INFO L87 Difference]: Start difference. First operand 84 states and 85 transitions. Second operand 56 states. [2019-08-05 10:17:53,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:53,253 INFO L93 Difference]: Finished difference Result 138 states and 139 transitions. [2019-08-05 10:17:53,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 10:17:53,253 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 83 [2019-08-05 10:17:53,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:53,254 INFO L225 Difference]: With dead ends: 138 [2019-08-05 10:17:53,254 INFO L226 Difference]: Without dead ends: 85 [2019-08-05 10:17:53,255 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1027 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1621, Invalid=5185, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:17:53,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-08-05 10:17:53,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-08-05 10:17:53,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-05 10:17:53,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2019-08-05 10:17:53,256 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 83 [2019-08-05 10:17:53,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:53,256 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2019-08-05 10:17:53,256 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 10:17:53,257 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2019-08-05 10:17:53,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-08-05 10:17:53,257 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:53,257 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 26, 1, 1, 1, 1] [2019-08-05 10:17:53,257 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:53,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:53,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1181377146, now seen corresponding path program 52 times [2019-08-05 10:17:53,258 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:53,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:53,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-05 10:17:53,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:54,546 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:17:54,596 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 378 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:54,597 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:54,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 10:17:54,597 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 10:17:54,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 10:17:54,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=437, Invalid=493, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:17:54,597 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 31 states. [2019-08-05 10:17:55,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:55,121 INFO L93 Difference]: Finished difference Result 91 states and 92 transitions. [2019-08-05 10:17:55,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 10:17:55,121 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 84 [2019-08-05 10:17:55,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:55,122 INFO L225 Difference]: With dead ends: 91 [2019-08-05 10:17:55,122 INFO L226 Difference]: Without dead ends: 91 [2019-08-05 10:17:55,123 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 756 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1305, Invalid=2117, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:17:55,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-08-05 10:17:55,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 87. [2019-08-05 10:17:55,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-08-05 10:17:55,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2019-08-05 10:17:55,126 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 84 [2019-08-05 10:17:55,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:55,126 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2019-08-05 10:17:55,126 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 10:17:55,126 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2019-08-05 10:17:55,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-08-05 10:17:55,127 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:55,127 INFO L399 BasicCegarLoop]: trace histogram [28, 27, 27, 1, 1, 1, 1] [2019-08-05 10:17:55,127 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:55,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:55,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1432137950, now seen corresponding path program 53 times [2019-08-05 10:17:55,128 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:55,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:55,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-05 10:17:55,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:56,245 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 756 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:56,245 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:56,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 10:17:56,245 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 10:17:56,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 10:17:56,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=869, Invalid=2437, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:17:56,246 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 58 states. [2019-08-05 10:17:57,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:57,832 INFO L93 Difference]: Finished difference Result 143 states and 144 transitions. [2019-08-05 10:17:57,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 10:17:57,832 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 86 [2019-08-05 10:17:57,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:57,833 INFO L225 Difference]: With dead ends: 143 [2019-08-05 10:17:57,833 INFO L226 Difference]: Without dead ends: 88 [2019-08-05 10:17:57,834 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1107 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1737, Invalid=5573, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 10:17:57,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-08-05 10:17:57,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-08-05 10:17:57,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-08-05 10:17:57,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 89 transitions. [2019-08-05 10:17:57,836 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 89 transitions. Word has length 86 [2019-08-05 10:17:57,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:57,836 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 89 transitions. [2019-08-05 10:17:57,836 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 10:17:57,836 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 89 transitions. [2019-08-05 10:17:57,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-08-05 10:17:57,837 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:57,837 INFO L399 BasicCegarLoop]: trace histogram [28, 28, 27, 1, 1, 1, 1] [2019-08-05 10:17:57,837 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:57,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:57,838 INFO L82 PathProgramCache]: Analyzing trace with hash -2048907495, now seen corresponding path program 54 times [2019-08-05 10:17:57,838 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:57,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:57,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-05 10:17:57,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:58,257 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:17:58,276 INFO L134 CoverageAnalysis]: Checked inductivity of 1162 backedges. 406 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:58,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:58,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 10:17:58,276 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:17:58,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:17:58,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=467, Invalid=525, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:17:58,277 INFO L87 Difference]: Start difference. First operand 88 states and 89 transitions. Second operand 32 states. [2019-08-05 10:17:58,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:58,820 INFO L93 Difference]: Finished difference Result 94 states and 95 transitions. [2019-08-05 10:17:58,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 10:17:58,820 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 87 [2019-08-05 10:17:58,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:58,821 INFO L225 Difference]: With dead ends: 94 [2019-08-05 10:17:58,821 INFO L226 Difference]: Without dead ends: 94 [2019-08-05 10:17:58,822 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 812 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1395, Invalid=2265, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:17:58,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-08-05 10:17:58,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2019-08-05 10:17:58,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-08-05 10:17:58,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 91 transitions. [2019-08-05 10:17:58,825 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 91 transitions. Word has length 87 [2019-08-05 10:17:58,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:58,825 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 91 transitions. [2019-08-05 10:17:58,826 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:17:58,826 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 91 transitions. [2019-08-05 10:17:58,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-08-05 10:17:58,826 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:58,826 INFO L399 BasicCegarLoop]: trace histogram [29, 28, 28, 1, 1, 1, 1] [2019-08-05 10:17:58,827 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:58,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:58,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1905147915, now seen corresponding path program 55 times [2019-08-05 10:17:58,827 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:58,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:58,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-05 10:17:58,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:59,903 INFO L134 CoverageAnalysis]: Checked inductivity of 1218 backedges. 812 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:59,904 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:59,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 10:17:59,904 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 10:17:59,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 10:17:59,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=929, Invalid=2611, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:17:59,905 INFO L87 Difference]: Start difference. First operand 90 states and 91 transitions. Second operand 60 states. [2019-08-05 10:18:01,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:01,177 INFO L93 Difference]: Finished difference Result 148 states and 149 transitions. [2019-08-05 10:18:01,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 10:18:01,177 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 89 [2019-08-05 10:18:01,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:01,178 INFO L225 Difference]: With dead ends: 148 [2019-08-05 10:18:01,178 INFO L226 Difference]: Without dead ends: 91 [2019-08-05 10:18:01,179 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1190 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1857, Invalid=5975, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 10:18:01,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-08-05 10:18:01,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-08-05 10:18:01,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-08-05 10:18:01,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2019-08-05 10:18:01,182 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 89 [2019-08-05 10:18:01,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:01,182 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2019-08-05 10:18:01,182 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 10:18:01,182 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2019-08-05 10:18:01,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-08-05 10:18:01,183 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:01,183 INFO L399 BasicCegarLoop]: trace histogram [29, 29, 28, 1, 1, 1, 1] [2019-08-05 10:18:01,183 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:01,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:01,183 INFO L82 PathProgramCache]: Analyzing trace with hash 2078396574, now seen corresponding path program 56 times [2019-08-05 10:18:01,184 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:01,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:01,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-05 10:18:01,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:01,587 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:18:01,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1247 backedges. 435 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:01,609 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:01,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:18:01,609 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 10:18:01,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 10:18:01,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=498, Invalid=558, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:18:01,610 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 33 states. [2019-08-05 10:18:02,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:02,167 INFO L93 Difference]: Finished difference Result 97 states and 98 transitions. [2019-08-05 10:18:02,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 10:18:02,168 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 90 [2019-08-05 10:18:02,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:02,169 INFO L225 Difference]: With dead ends: 97 [2019-08-05 10:18:02,169 INFO L226 Difference]: Without dead ends: 97 [2019-08-05 10:18:02,170 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 870 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1488, Invalid=2418, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:18:02,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-08-05 10:18:02,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2019-08-05 10:18:02,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-08-05 10:18:02,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2019-08-05 10:18:02,173 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 90 [2019-08-05 10:18:02,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:02,173 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2019-08-05 10:18:02,173 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 10:18:02,173 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2019-08-05 10:18:02,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-08-05 10:18:02,174 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:02,174 INFO L399 BasicCegarLoop]: trace histogram [30, 29, 29, 1, 1, 1, 1] [2019-08-05 10:18:02,174 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:02,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:02,174 INFO L82 PathProgramCache]: Analyzing trace with hash 179248186, now seen corresponding path program 57 times [2019-08-05 10:18:02,175 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:02,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:02,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-05 10:18:02,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:03,645 INFO L134 CoverageAnalysis]: Checked inductivity of 1305 backedges. 870 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:03,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:03,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-05 10:18:03,646 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-05 10:18:03,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-05 10:18:03,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=991, Invalid=2791, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:18:03,647 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand 62 states. [2019-08-05 10:18:05,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:05,193 INFO L93 Difference]: Finished difference Result 153 states and 154 transitions. [2019-08-05 10:18:05,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 10:18:05,194 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 92 [2019-08-05 10:18:05,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:05,195 INFO L225 Difference]: With dead ends: 153 [2019-08-05 10:18:05,195 INFO L226 Difference]: Without dead ends: 94 [2019-08-05 10:18:05,195 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1276 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1981, Invalid=6391, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 10:18:05,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-08-05 10:18:05,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-08-05 10:18:05,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-08-05 10:18:05,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 95 transitions. [2019-08-05 10:18:05,197 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 95 transitions. Word has length 92 [2019-08-05 10:18:05,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:05,197 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 95 transitions. [2019-08-05 10:18:05,197 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-05 10:18:05,197 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 95 transitions. [2019-08-05 10:18:05,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 10:18:05,198 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:05,198 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 29, 1, 1, 1, 1] [2019-08-05 10:18:05,198 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:05,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:05,199 INFO L82 PathProgramCache]: Analyzing trace with hash -288235791, now seen corresponding path program 58 times [2019-08-05 10:18:05,199 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:05,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:05,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-05 10:18:05,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:05,614 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:18:05,633 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 465 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:05,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:05,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:18:05,633 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:18:05,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:18:05,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=530, Invalid=592, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:18:05,634 INFO L87 Difference]: Start difference. First operand 94 states and 95 transitions. Second operand 34 states. [2019-08-05 10:18:06,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:06,218 INFO L93 Difference]: Finished difference Result 100 states and 101 transitions. [2019-08-05 10:18:06,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-05 10:18:06,218 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 93 [2019-08-05 10:18:06,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:06,219 INFO L225 Difference]: With dead ends: 100 [2019-08-05 10:18:06,219 INFO L226 Difference]: Without dead ends: 100 [2019-08-05 10:18:06,220 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 930 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1584, Invalid=2576, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:18:06,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-08-05 10:18:06,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 96. [2019-08-05 10:18:06,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-08-05 10:18:06,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 97 transitions. [2019-08-05 10:18:06,222 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 97 transitions. Word has length 93 [2019-08-05 10:18:06,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:06,223 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 97 transitions. [2019-08-05 10:18:06,223 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:18:06,223 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 97 transitions. [2019-08-05 10:18:06,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-08-05 10:18:06,223 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:06,223 INFO L399 BasicCegarLoop]: trace histogram [31, 30, 30, 1, 1, 1, 1] [2019-08-05 10:18:06,223 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:06,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:06,224 INFO L82 PathProgramCache]: Analyzing trace with hash -2116754995, now seen corresponding path program 59 times [2019-08-05 10:18:06,224 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:06,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:06,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-05 10:18:06,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:08,045 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 930 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:08,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:08,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-05 10:18:08,046 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-05 10:18:08,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-05 10:18:08,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1055, Invalid=2977, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:18:08,046 INFO L87 Difference]: Start difference. First operand 96 states and 97 transitions. Second operand 64 states. [2019-08-05 10:18:09,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:09,032 INFO L93 Difference]: Finished difference Result 158 states and 159 transitions. [2019-08-05 10:18:09,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-05 10:18:09,032 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 95 [2019-08-05 10:18:09,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:09,033 INFO L225 Difference]: With dead ends: 158 [2019-08-05 10:18:09,033 INFO L226 Difference]: Without dead ends: 97 [2019-08-05 10:18:09,033 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1365 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2109, Invalid=6821, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 10:18:09,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-08-05 10:18:09,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-08-05 10:18:09,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-08-05 10:18:09,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2019-08-05 10:18:09,036 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 95 [2019-08-05 10:18:09,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:09,036 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2019-08-05 10:18:09,036 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-05 10:18:09,036 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2019-08-05 10:18:09,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-08-05 10:18:09,037 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:09,037 INFO L399 BasicCegarLoop]: trace histogram [31, 31, 30, 1, 1, 1, 1] [2019-08-05 10:18:09,037 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:09,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:09,037 INFO L82 PathProgramCache]: Analyzing trace with hash -352972874, now seen corresponding path program 60 times [2019-08-05 10:18:09,038 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:09,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:09,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-05 10:18:09,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:09,494 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:18:09,514 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 496 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:09,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:09,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 10:18:09,515 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:18:09,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:18:09,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=563, Invalid=627, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:18:09,516 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 35 states. [2019-08-05 10:18:10,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:10,140 INFO L93 Difference]: Finished difference Result 103 states and 104 transitions. [2019-08-05 10:18:10,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 10:18:10,140 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 96 [2019-08-05 10:18:10,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:10,141 INFO L225 Difference]: With dead ends: 103 [2019-08-05 10:18:10,141 INFO L226 Difference]: Without dead ends: 103 [2019-08-05 10:18:10,142 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 992 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1683, Invalid=2739, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:18:10,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-08-05 10:18:10,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 99. [2019-08-05 10:18:10,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 10:18:10,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2019-08-05 10:18:10,144 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 96 [2019-08-05 10:18:10,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:10,144 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2019-08-05 10:18:10,144 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:18:10,144 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2019-08-05 10:18:10,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-08-05 10:18:10,145 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:10,145 INFO L399 BasicCegarLoop]: trace histogram [32, 31, 31, 1, 1, 1, 1] [2019-08-05 10:18:10,145 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:10,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:10,145 INFO L82 PathProgramCache]: Analyzing trace with hash 95417682, now seen corresponding path program 61 times [2019-08-05 10:18:10,146 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:10,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:10,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-05 10:18:10,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:11,484 INFO L134 CoverageAnalysis]: Checked inductivity of 1488 backedges. 992 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:11,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:11,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-05 10:18:11,485 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-05 10:18:11,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-05 10:18:11,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1121, Invalid=3169, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:18:11,486 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 66 states. [2019-08-05 10:18:13,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:13,721 INFO L93 Difference]: Finished difference Result 163 states and 164 transitions. [2019-08-05 10:18:13,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 10:18:13,721 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 98 [2019-08-05 10:18:13,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:13,722 INFO L225 Difference]: With dead ends: 163 [2019-08-05 10:18:13,722 INFO L226 Difference]: Without dead ends: 100 [2019-08-05 10:18:13,723 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1457 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2241, Invalid=7265, Unknown=0, NotChecked=0, Total=9506 [2019-08-05 10:18:13,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-08-05 10:18:13,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-08-05 10:18:13,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-08-05 10:18:13,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2019-08-05 10:18:13,725 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 98 [2019-08-05 10:18:13,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:13,725 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2019-08-05 10:18:13,725 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-05 10:18:13,725 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2019-08-05 10:18:13,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-08-05 10:18:13,726 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:13,726 INFO L399 BasicCegarLoop]: trace histogram [32, 32, 31, 1, 1, 1, 1] [2019-08-05 10:18:13,726 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:13,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:13,727 INFO L82 PathProgramCache]: Analyzing trace with hash 298685129, now seen corresponding path program 62 times [2019-08-05 10:18:13,727 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:13,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:13,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-05 10:18:13,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:14,278 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:18:14,339 INFO L134 CoverageAnalysis]: Checked inductivity of 1520 backedges. 528 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:14,339 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:14,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:18:14,340 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 10:18:14,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 10:18:14,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=597, Invalid=663, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:18:14,341 INFO L87 Difference]: Start difference. First operand 100 states and 101 transitions. Second operand 36 states. [2019-08-05 10:18:14,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:14,991 INFO L93 Difference]: Finished difference Result 106 states and 107 transitions. [2019-08-05 10:18:14,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-05 10:18:14,992 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 99 [2019-08-05 10:18:14,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:14,993 INFO L225 Difference]: With dead ends: 106 [2019-08-05 10:18:14,993 INFO L226 Difference]: Without dead ends: 106 [2019-08-05 10:18:14,994 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1056 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1785, Invalid=2907, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:18:14,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-08-05 10:18:14,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 102. [2019-08-05 10:18:14,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-08-05 10:18:14,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 103 transitions. [2019-08-05 10:18:14,997 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 103 transitions. Word has length 99 [2019-08-05 10:18:14,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:14,997 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 103 transitions. [2019-08-05 10:18:14,997 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 10:18:14,998 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 103 transitions. [2019-08-05 10:18:14,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 10:18:14,998 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:14,998 INFO L399 BasicCegarLoop]: trace histogram [33, 32, 32, 1, 1, 1, 1] [2019-08-05 10:18:14,999 INFO L418 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:14,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:14,999 INFO L82 PathProgramCache]: Analyzing trace with hash -726466651, now seen corresponding path program 63 times [2019-08-05 10:18:15,000 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:15,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:15,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-05 10:18:15,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:16,413 INFO L134 CoverageAnalysis]: Checked inductivity of 1584 backedges. 1056 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:16,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:16,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-05 10:18:16,414 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-05 10:18:16,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-05 10:18:16,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1189, Invalid=3367, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:18:16,415 INFO L87 Difference]: Start difference. First operand 102 states and 103 transitions. Second operand 68 states. [2019-08-05 10:18:18,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:18,994 INFO L93 Difference]: Finished difference Result 168 states and 169 transitions. [2019-08-05 10:18:18,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-05 10:18:18,995 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 101 [2019-08-05 10:18:18,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:18,996 INFO L225 Difference]: With dead ends: 168 [2019-08-05 10:18:18,996 INFO L226 Difference]: Without dead ends: 103 [2019-08-05 10:18:18,997 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1552 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2377, Invalid=7723, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 10:18:18,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-08-05 10:18:18,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-08-05 10:18:18,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-05 10:18:18,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2019-08-05 10:18:18,999 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 101 [2019-08-05 10:18:18,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:18,999 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2019-08-05 10:18:18,999 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-05 10:18:18,999 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2019-08-05 10:18:19,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-08-05 10:18:19,000 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:19,000 INFO L399 BasicCegarLoop]: trace histogram [33, 33, 32, 1, 1, 1, 1] [2019-08-05 10:18:19,000 INFO L418 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:19,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:19,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1089840434, now seen corresponding path program 64 times [2019-08-05 10:18:19,001 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:19,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:19,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-05 10:18:19,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:19,603 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:18:19,626 INFO L134 CoverageAnalysis]: Checked inductivity of 1617 backedges. 561 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:19,626 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:19,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 10:18:19,627 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 10:18:19,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 10:18:19,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=632, Invalid=700, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:18:19,627 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 37 states. [2019-08-05 10:18:20,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:20,324 INFO L93 Difference]: Finished difference Result 109 states and 110 transitions. [2019-08-05 10:18:20,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-05 10:18:20,325 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 102 [2019-08-05 10:18:20,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:20,326 INFO L225 Difference]: With dead ends: 109 [2019-08-05 10:18:20,326 INFO L226 Difference]: Without dead ends: 109 [2019-08-05 10:18:20,326 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1122 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1890, Invalid=3080, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:18:20,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-08-05 10:18:20,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 105. [2019-08-05 10:18:20,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 10:18:20,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2019-08-05 10:18:20,329 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 102 [2019-08-05 10:18:20,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:20,330 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2019-08-05 10:18:20,330 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 10:18:20,330 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2019-08-05 10:18:20,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-08-05 10:18:20,331 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:20,331 INFO L399 BasicCegarLoop]: trace histogram [34, 33, 33, 1, 1, 1, 1] [2019-08-05 10:18:20,331 INFO L418 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:20,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:20,331 INFO L82 PathProgramCache]: Analyzing trace with hash 635296362, now seen corresponding path program 65 times [2019-08-05 10:18:20,332 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:20,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:20,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-05 10:18:20,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:21,644 INFO L134 CoverageAnalysis]: Checked inductivity of 1683 backedges. 1122 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:21,644 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:21,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-05 10:18:21,644 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-05 10:18:21,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-05 10:18:21,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1259, Invalid=3571, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:18:21,645 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 70 states. [2019-08-05 10:18:23,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:23,444 INFO L93 Difference]: Finished difference Result 173 states and 174 transitions. [2019-08-05 10:18:23,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-05 10:18:23,445 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 104 [2019-08-05 10:18:23,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:23,445 INFO L225 Difference]: With dead ends: 173 [2019-08-05 10:18:23,446 INFO L226 Difference]: Without dead ends: 106 [2019-08-05 10:18:23,446 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1650 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2517, Invalid=8195, Unknown=0, NotChecked=0, Total=10712 [2019-08-05 10:18:23,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-08-05 10:18:23,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-08-05 10:18:23,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-08-05 10:18:23,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 107 transitions. [2019-08-05 10:18:23,449 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 107 transitions. Word has length 104 [2019-08-05 10:18:23,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:23,449 INFO L475 AbstractCegarLoop]: Abstraction has 106 states and 107 transitions. [2019-08-05 10:18:23,449 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-05 10:18:23,449 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 107 transitions. [2019-08-05 10:18:23,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-08-05 10:18:23,450 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:23,450 INFO L399 BasicCegarLoop]: trace histogram [34, 34, 33, 1, 1, 1, 1] [2019-08-05 10:18:23,450 INFO L418 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:23,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:23,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1315487071, now seen corresponding path program 66 times [2019-08-05 10:18:23,451 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:23,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:23,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 72 conjunts are in the unsatisfiable core [2019-08-05 10:18:23,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:23,996 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:18:24,022 INFO L134 CoverageAnalysis]: Checked inductivity of 1717 backedges. 595 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:24,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:24,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:18:24,023 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 10:18:24,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 10:18:24,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=668, Invalid=738, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:18:24,023 INFO L87 Difference]: Start difference. First operand 106 states and 107 transitions. Second operand 38 states. [2019-08-05 10:18:24,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:24,783 INFO L93 Difference]: Finished difference Result 112 states and 113 transitions. [2019-08-05 10:18:24,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-05 10:18:24,784 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 105 [2019-08-05 10:18:24,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:24,785 INFO L225 Difference]: With dead ends: 112 [2019-08-05 10:18:24,785 INFO L226 Difference]: Without dead ends: 112 [2019-08-05 10:18:24,785 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1190 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1998, Invalid=3258, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:18:24,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-08-05 10:18:24,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 108. [2019-08-05 10:18:24,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-08-05 10:18:24,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 109 transitions. [2019-08-05 10:18:24,788 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 109 transitions. Word has length 105 [2019-08-05 10:18:24,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:24,788 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 109 transitions. [2019-08-05 10:18:24,788 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 10:18:24,788 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 109 transitions. [2019-08-05 10:18:24,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-08-05 10:18:24,789 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:24,789 INFO L399 BasicCegarLoop]: trace histogram [35, 34, 34, 1, 1, 1, 1] [2019-08-05 10:18:24,789 INFO L418 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:24,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:24,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1462756995, now seen corresponding path program 67 times [2019-08-05 10:18:24,790 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:24,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:24,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 72 conjunts are in the unsatisfiable core [2019-08-05 10:18:24,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:26,170 INFO L134 CoverageAnalysis]: Checked inductivity of 1785 backedges. 1190 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:26,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:26,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-05 10:18:26,170 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-05 10:18:26,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-05 10:18:26,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1331, Invalid=3781, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:18:26,171 INFO L87 Difference]: Start difference. First operand 108 states and 109 transitions. Second operand 72 states. [2019-08-05 10:18:27,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:27,353 INFO L93 Difference]: Finished difference Result 178 states and 179 transitions. [2019-08-05 10:18:27,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-05 10:18:27,354 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 107 [2019-08-05 10:18:27,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:27,355 INFO L225 Difference]: With dead ends: 178 [2019-08-05 10:18:27,355 INFO L226 Difference]: Without dead ends: 109 [2019-08-05 10:18:27,356 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1751 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2661, Invalid=8681, Unknown=0, NotChecked=0, Total=11342 [2019-08-05 10:18:27,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-08-05 10:18:27,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-08-05 10:18:27,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 10:18:27,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2019-08-05 10:18:27,358 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 107 [2019-08-05 10:18:27,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:27,358 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2019-08-05 10:18:27,358 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-05 10:18:27,358 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2019-08-05 10:18:27,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-08-05 10:18:27,359 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:27,359 INFO L399 BasicCegarLoop]: trace histogram [35, 35, 34, 1, 1, 1, 1] [2019-08-05 10:18:27,359 INFO L418 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:27,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:27,359 INFO L82 PathProgramCache]: Analyzing trace with hash -2049527322, now seen corresponding path program 68 times [2019-08-05 10:18:27,360 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:27,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:27,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-05 10:18:27,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:28,004 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:18:28,035 INFO L134 CoverageAnalysis]: Checked inductivity of 1820 backedges. 630 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:28,035 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:28,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 10:18:28,036 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 10:18:28,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 10:18:28,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=705, Invalid=777, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:18:28,036 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 39 states. [2019-08-05 10:18:28,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:28,799 INFO L93 Difference]: Finished difference Result 115 states and 116 transitions. [2019-08-05 10:18:28,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-05 10:18:28,800 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 108 [2019-08-05 10:18:28,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:28,801 INFO L225 Difference]: With dead ends: 115 [2019-08-05 10:18:28,801 INFO L226 Difference]: Without dead ends: 115 [2019-08-05 10:18:28,802 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1260 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=2109, Invalid=3441, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:18:28,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-08-05 10:18:28,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 111. [2019-08-05 10:18:28,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-08-05 10:18:28,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2019-08-05 10:18:28,804 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 108 [2019-08-05 10:18:28,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:28,804 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2019-08-05 10:18:28,804 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 10:18:28,804 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2019-08-05 10:18:28,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-08-05 10:18:28,805 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:28,805 INFO L399 BasicCegarLoop]: trace histogram [36, 35, 35, 1, 1, 1, 1] [2019-08-05 10:18:28,805 INFO L418 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:28,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:28,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1794165634, now seen corresponding path program 69 times [2019-08-05 10:18:28,806 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:28,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:28,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 546 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-05 10:18:28,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:30,280 INFO L134 CoverageAnalysis]: Checked inductivity of 1890 backedges. 1260 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:30,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:30,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-05 10:18:30,281 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-05 10:18:30,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-05 10:18:30,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1405, Invalid=3997, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:18:30,282 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand 74 states. [2019-08-05 10:18:31,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:31,555 INFO L93 Difference]: Finished difference Result 183 states and 184 transitions. [2019-08-05 10:18:31,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-05 10:18:31,555 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 110 [2019-08-05 10:18:31,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:31,556 INFO L225 Difference]: With dead ends: 183 [2019-08-05 10:18:31,556 INFO L226 Difference]: Without dead ends: 112 [2019-08-05 10:18:31,557 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1855 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2809, Invalid=9181, Unknown=0, NotChecked=0, Total=11990 [2019-08-05 10:18:31,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-08-05 10:18:31,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-08-05 10:18:31,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-08-05 10:18:31,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 113 transitions. [2019-08-05 10:18:31,559 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 113 transitions. Word has length 110 [2019-08-05 10:18:31,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:31,559 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 113 transitions. [2019-08-05 10:18:31,559 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-05 10:18:31,559 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 113 transitions. [2019-08-05 10:18:31,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-08-05 10:18:31,560 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:31,560 INFO L399 BasicCegarLoop]: trace histogram [36, 36, 35, 1, 1, 1, 1] [2019-08-05 10:18:31,560 INFO L418 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:31,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:31,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1836248697, now seen corresponding path program 70 times [2019-08-05 10:18:31,561 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:31,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:31,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-05 10:18:31,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:32,227 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:18:32,251 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 666 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:32,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:32,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 10:18:32,251 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 10:18:32,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 10:18:32,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=743, Invalid=817, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:18:32,252 INFO L87 Difference]: Start difference. First operand 112 states and 113 transitions. Second operand 40 states. [2019-08-05 10:18:33,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:33,178 INFO L93 Difference]: Finished difference Result 118 states and 119 transitions. [2019-08-05 10:18:33,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-05 10:18:33,178 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 111 [2019-08-05 10:18:33,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:33,179 INFO L225 Difference]: With dead ends: 118 [2019-08-05 10:18:33,180 INFO L226 Difference]: Without dead ends: 118 [2019-08-05 10:18:33,180 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1332 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2223, Invalid=3629, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:18:33,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-08-05 10:18:33,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 114. [2019-08-05 10:18:33,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-08-05 10:18:33,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 115 transitions. [2019-08-05 10:18:33,183 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 115 transitions. Word has length 111 [2019-08-05 10:18:33,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:33,183 INFO L475 AbstractCegarLoop]: Abstraction has 114 states and 115 transitions. [2019-08-05 10:18:33,183 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 10:18:33,183 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 115 transitions. [2019-08-05 10:18:33,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-08-05 10:18:33,184 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:33,184 INFO L399 BasicCegarLoop]: trace histogram [37, 36, 36, 1, 1, 1, 1] [2019-08-05 10:18:33,184 INFO L418 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:33,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:33,185 INFO L82 PathProgramCache]: Analyzing trace with hash -596627627, now seen corresponding path program 71 times [2019-08-05 10:18:33,185 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:33,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:33,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 561 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-05 10:18:33,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:35,023 INFO L134 CoverageAnalysis]: Checked inductivity of 1998 backedges. 1332 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:35,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:35,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-05 10:18:35,024 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-05 10:18:35,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-05 10:18:35,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1481, Invalid=4219, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:18:35,024 INFO L87 Difference]: Start difference. First operand 114 states and 115 transitions. Second operand 76 states. [2019-08-05 10:18:36,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:36,785 INFO L93 Difference]: Finished difference Result 188 states and 189 transitions. [2019-08-05 10:18:36,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-05 10:18:36,785 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 113 [2019-08-05 10:18:36,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:36,786 INFO L225 Difference]: With dead ends: 188 [2019-08-05 10:18:36,786 INFO L226 Difference]: Without dead ends: 115 [2019-08-05 10:18:36,787 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1962 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2961, Invalid=9695, Unknown=0, NotChecked=0, Total=12656 [2019-08-05 10:18:36,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-08-05 10:18:36,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2019-08-05 10:18:36,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 10:18:36,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2019-08-05 10:18:36,789 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 113 [2019-08-05 10:18:36,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:36,789 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2019-08-05 10:18:36,789 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-05 10:18:36,789 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2019-08-05 10:18:36,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-08-05 10:18:36,790 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:36,790 INFO L399 BasicCegarLoop]: trace histogram [37, 37, 36, 1, 1, 1, 1] [2019-08-05 10:18:36,790 INFO L418 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:36,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:36,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1030548226, now seen corresponding path program 72 times [2019-08-05 10:18:36,791 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:36,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:36,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 566 conjuncts, 78 conjunts are in the unsatisfiable core [2019-08-05 10:18:36,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:37,391 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:18:37,417 INFO L134 CoverageAnalysis]: Checked inductivity of 2035 backedges. 703 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:37,418 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:37,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 10:18:37,418 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 10:18:37,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 10:18:37,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=782, Invalid=858, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:18:37,418 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand 41 states. [2019-08-05 10:18:38,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:38,483 INFO L93 Difference]: Finished difference Result 121 states and 122 transitions. [2019-08-05 10:18:38,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-05 10:18:38,484 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 114 [2019-08-05 10:18:38,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:38,485 INFO L225 Difference]: With dead ends: 121 [2019-08-05 10:18:38,485 INFO L226 Difference]: Without dead ends: 121 [2019-08-05 10:18:38,485 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1406 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2340, Invalid=3822, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:18:38,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-08-05 10:18:38,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 117. [2019-08-05 10:18:38,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 10:18:38,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 118 transitions. [2019-08-05 10:18:38,488 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 118 transitions. Word has length 114 [2019-08-05 10:18:38,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:38,488 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 118 transitions. [2019-08-05 10:18:38,488 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 10:18:38,488 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 118 transitions. [2019-08-05 10:18:38,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-08-05 10:18:38,489 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:38,489 INFO L399 BasicCegarLoop]: trace histogram [38, 37, 37, 1, 1, 1, 1] [2019-08-05 10:18:38,489 INFO L418 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:38,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:38,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1780533402, now seen corresponding path program 73 times [2019-08-05 10:18:38,490 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:38,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:38,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 78 conjunts are in the unsatisfiable core [2019-08-05 10:18:38,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:40,173 INFO L134 CoverageAnalysis]: Checked inductivity of 2109 backedges. 1406 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:40,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:40,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-05 10:18:40,174 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-05 10:18:40,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-05 10:18:40,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1559, Invalid=4447, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:18:40,174 INFO L87 Difference]: Start difference. First operand 117 states and 118 transitions. Second operand 78 states. [2019-08-05 10:18:41,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:41,521 INFO L93 Difference]: Finished difference Result 193 states and 194 transitions. [2019-08-05 10:18:41,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-05 10:18:41,521 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 116 [2019-08-05 10:18:41,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:41,522 INFO L225 Difference]: With dead ends: 193 [2019-08-05 10:18:41,522 INFO L226 Difference]: Without dead ends: 118 [2019-08-05 10:18:41,523 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2072 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3117, Invalid=10223, Unknown=0, NotChecked=0, Total=13340 [2019-08-05 10:18:41,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-08-05 10:18:41,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2019-08-05 10:18:41,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-08-05 10:18:41,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 119 transitions. [2019-08-05 10:18:41,525 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 119 transitions. Word has length 116 [2019-08-05 10:18:41,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:41,525 INFO L475 AbstractCegarLoop]: Abstraction has 118 states and 119 transitions. [2019-08-05 10:18:41,525 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-05 10:18:41,525 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 119 transitions. [2019-08-05 10:18:41,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-08-05 10:18:41,526 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:41,526 INFO L399 BasicCegarLoop]: trace histogram [38, 38, 37, 1, 1, 1, 1] [2019-08-05 10:18:41,526 INFO L418 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:41,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:41,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1591437743, now seen corresponding path program 74 times [2019-08-05 10:18:41,527 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:41,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:41,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 581 conjuncts, 80 conjunts are in the unsatisfiable core [2019-08-05 10:18:41,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:42,249 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:18:42,275 INFO L134 CoverageAnalysis]: Checked inductivity of 2147 backedges. 741 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:42,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:42,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 10:18:42,276 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:18:42,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:18:42,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=822, Invalid=900, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:18:42,277 INFO L87 Difference]: Start difference. First operand 118 states and 119 transitions. Second operand 42 states. [2019-08-05 10:18:43,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:43,265 INFO L93 Difference]: Finished difference Result 124 states and 125 transitions. [2019-08-05 10:18:43,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-08-05 10:18:43,266 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 117 [2019-08-05 10:18:43,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:43,267 INFO L225 Difference]: With dead ends: 124 [2019-08-05 10:18:43,267 INFO L226 Difference]: Without dead ends: 124 [2019-08-05 10:18:43,268 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1482 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2460, Invalid=4020, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:18:43,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-08-05 10:18:43,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 120. [2019-08-05 10:18:43,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-08-05 10:18:43,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 121 transitions. [2019-08-05 10:18:43,270 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 121 transitions. Word has length 117 [2019-08-05 10:18:43,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:43,270 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 121 transitions. [2019-08-05 10:18:43,270 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:18:43,270 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 121 transitions. [2019-08-05 10:18:43,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-08-05 10:18:43,271 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:43,271 INFO L399 BasicCegarLoop]: trace histogram [39, 38, 38, 1, 1, 1, 1] [2019-08-05 10:18:43,271 INFO L418 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:43,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:43,271 INFO L82 PathProgramCache]: Analyzing trace with hash -363380435, now seen corresponding path program 75 times [2019-08-05 10:18:43,272 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:43,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:43,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 591 conjuncts, 80 conjunts are in the unsatisfiable core [2019-08-05 10:18:43,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:45,136 INFO L134 CoverageAnalysis]: Checked inductivity of 2223 backedges. 1482 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:45,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:45,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-08-05 10:18:45,137 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-08-05 10:18:45,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-08-05 10:18:45,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1639, Invalid=4681, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:18:45,138 INFO L87 Difference]: Start difference. First operand 120 states and 121 transitions. Second operand 80 states. [2019-08-05 10:18:47,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:47,937 INFO L93 Difference]: Finished difference Result 198 states and 199 transitions. [2019-08-05 10:18:47,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-08-05 10:18:47,937 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 119 [2019-08-05 10:18:47,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:47,938 INFO L225 Difference]: With dead ends: 198 [2019-08-05 10:18:47,938 INFO L226 Difference]: Without dead ends: 121 [2019-08-05 10:18:47,939 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2185 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3277, Invalid=10765, Unknown=0, NotChecked=0, Total=14042 [2019-08-05 10:18:47,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-08-05 10:18:47,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2019-08-05 10:18:47,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-05 10:18:47,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 122 transitions. [2019-08-05 10:18:47,941 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 122 transitions. Word has length 119 [2019-08-05 10:18:47,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:47,941 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 122 transitions. [2019-08-05 10:18:47,941 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-08-05 10:18:47,941 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2019-08-05 10:18:47,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-08-05 10:18:47,942 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:47,942 INFO L399 BasicCegarLoop]: trace histogram [39, 39, 38, 1, 1, 1, 1] [2019-08-05 10:18:47,942 INFO L418 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:47,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:47,942 INFO L82 PathProgramCache]: Analyzing trace with hash 234325014, now seen corresponding path program 76 times [2019-08-05 10:18:47,943 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:47,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:47,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 596 conjuncts, 82 conjunts are in the unsatisfiable core [2019-08-05 10:18:47,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:48,844 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:18:48,873 INFO L134 CoverageAnalysis]: Checked inductivity of 2262 backedges. 780 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:48,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:48,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 10:18:48,874 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 10:18:48,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 10:18:48,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=863, Invalid=943, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:18:48,875 INFO L87 Difference]: Start difference. First operand 121 states and 122 transitions. Second operand 43 states. [2019-08-05 10:18:49,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:49,769 INFO L93 Difference]: Finished difference Result 127 states and 128 transitions. [2019-08-05 10:18:49,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-08-05 10:18:49,770 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 120 [2019-08-05 10:18:49,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:49,771 INFO L225 Difference]: With dead ends: 127 [2019-08-05 10:18:49,771 INFO L226 Difference]: Without dead ends: 127 [2019-08-05 10:18:49,772 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1560 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2583, Invalid=4223, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:18:49,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-08-05 10:18:49,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 123. [2019-08-05 10:18:49,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-08-05 10:18:49,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 124 transitions. [2019-08-05 10:18:49,775 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 124 transitions. Word has length 120 [2019-08-05 10:18:49,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:49,775 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 124 transitions. [2019-08-05 10:18:49,775 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 10:18:49,775 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 124 transitions. [2019-08-05 10:18:49,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-08-05 10:18:49,776 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:49,776 INFO L399 BasicCegarLoop]: trace histogram [40, 39, 39, 1, 1, 1, 1] [2019-08-05 10:18:49,776 INFO L418 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:49,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:49,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1847972274, now seen corresponding path program 77 times [2019-08-05 10:18:49,777 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:49,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:49,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 606 conjuncts, 82 conjunts are in the unsatisfiable core [2019-08-05 10:18:49,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:51,679 INFO L134 CoverageAnalysis]: Checked inductivity of 2340 backedges. 1560 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:51,679 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:51,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2019-08-05 10:18:51,679 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-08-05 10:18:51,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-08-05 10:18:51,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1721, Invalid=4921, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 10:18:51,680 INFO L87 Difference]: Start difference. First operand 123 states and 124 transitions. Second operand 82 states. [2019-08-05 10:18:53,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:53,327 INFO L93 Difference]: Finished difference Result 203 states and 204 transitions. [2019-08-05 10:18:53,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-08-05 10:18:53,327 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 122 [2019-08-05 10:18:53,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:53,328 INFO L225 Difference]: With dead ends: 203 [2019-08-05 10:18:53,328 INFO L226 Difference]: Without dead ends: 124 [2019-08-05 10:18:53,329 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2301 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3441, Invalid=11321, Unknown=0, NotChecked=0, Total=14762 [2019-08-05 10:18:53,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-08-05 10:18:53,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2019-08-05 10:18:53,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-08-05 10:18:53,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 125 transitions. [2019-08-05 10:18:53,331 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 125 transitions. Word has length 122 [2019-08-05 10:18:53,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:53,331 INFO L475 AbstractCegarLoop]: Abstraction has 124 states and 125 transitions. [2019-08-05 10:18:53,331 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-08-05 10:18:53,331 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 125 transitions. [2019-08-05 10:18:53,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-08-05 10:18:53,332 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:53,332 INFO L399 BasicCegarLoop]: trace histogram [40, 40, 39, 1, 1, 1, 1] [2019-08-05 10:18:53,332 INFO L418 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:53,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:53,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1156594217, now seen corresponding path program 78 times [2019-08-05 10:18:53,333 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:53,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:53,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 611 conjuncts, 84 conjunts are in the unsatisfiable core [2019-08-05 10:18:53,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:54,392 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:18:54,421 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 820 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:54,421 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:54,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 10:18:54,421 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 10:18:54,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 10:18:54,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=905, Invalid=987, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:18:54,422 INFO L87 Difference]: Start difference. First operand 124 states and 125 transitions. Second operand 44 states. [2019-08-05 10:18:55,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:55,326 INFO L93 Difference]: Finished difference Result 130 states and 131 transitions. [2019-08-05 10:18:55,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-08-05 10:18:55,327 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 123 [2019-08-05 10:18:55,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:55,328 INFO L225 Difference]: With dead ends: 130 [2019-08-05 10:18:55,328 INFO L226 Difference]: Without dead ends: 130 [2019-08-05 10:18:55,329 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1640 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2709, Invalid=4431, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 10:18:55,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-08-05 10:18:55,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 126. [2019-08-05 10:18:55,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-08-05 10:18:55,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 127 transitions. [2019-08-05 10:18:55,331 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 127 transitions. Word has length 123 [2019-08-05 10:18:55,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:55,332 INFO L475 AbstractCegarLoop]: Abstraction has 126 states and 127 transitions. [2019-08-05 10:18:55,332 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 10:18:55,332 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 127 transitions. [2019-08-05 10:18:55,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-08-05 10:18:55,332 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:55,332 INFO L399 BasicCegarLoop]: trace histogram [41, 40, 40, 1, 1, 1, 1] [2019-08-05 10:18:55,333 INFO L418 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:55,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:55,333 INFO L82 PathProgramCache]: Analyzing trace with hash -909553915, now seen corresponding path program 79 times [2019-08-05 10:18:55,333 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:55,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:55,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 621 conjuncts, 84 conjunts are in the unsatisfiable core [2019-08-05 10:18:55,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:57,311 INFO L134 CoverageAnalysis]: Checked inductivity of 2460 backedges. 1640 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:57,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:57,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2019-08-05 10:18:57,312 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-08-05 10:18:57,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-08-05 10:18:57,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1805, Invalid=5167, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 10:18:57,312 INFO L87 Difference]: Start difference. First operand 126 states and 127 transitions. Second operand 84 states. [2019-08-05 10:19:00,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:00,003 INFO L93 Difference]: Finished difference Result 208 states and 209 transitions. [2019-08-05 10:19:00,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-08-05 10:19:00,003 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 125 [2019-08-05 10:19:00,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:00,004 INFO L225 Difference]: With dead ends: 208 [2019-08-05 10:19:00,004 INFO L226 Difference]: Without dead ends: 127 [2019-08-05 10:19:00,005 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2420 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3609, Invalid=11891, Unknown=0, NotChecked=0, Total=15500 [2019-08-05 10:19:00,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-08-05 10:19:00,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2019-08-05 10:19:00,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-08-05 10:19:00,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2019-08-05 10:19:00,007 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 125 [2019-08-05 10:19:00,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:00,008 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2019-08-05 10:19:00,008 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-08-05 10:19:00,008 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2019-08-05 10:19:00,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-08-05 10:19:00,009 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:00,009 INFO L399 BasicCegarLoop]: trace histogram [41, 41, 40, 1, 1, 1, 1] [2019-08-05 10:19:00,009 INFO L418 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:00,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:00,009 INFO L82 PathProgramCache]: Analyzing trace with hash 909901614, now seen corresponding path program 80 times [2019-08-05 10:19:00,010 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:00,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:00,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 626 conjuncts, 86 conjunts are in the unsatisfiable core [2019-08-05 10:19:00,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:00,795 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:00,823 INFO L134 CoverageAnalysis]: Checked inductivity of 2501 backedges. 861 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:00,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:00,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 10:19:00,824 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 10:19:00,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 10:19:00,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=948, Invalid=1032, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:19:00,825 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand 45 states. [2019-08-05 10:19:02,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:02,234 INFO L93 Difference]: Finished difference Result 133 states and 134 transitions. [2019-08-05 10:19:02,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-08-05 10:19:02,235 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 126 [2019-08-05 10:19:02,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:02,236 INFO L225 Difference]: With dead ends: 133 [2019-08-05 10:19:02,236 INFO L226 Difference]: Without dead ends: 133 [2019-08-05 10:19:02,237 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1722 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2838, Invalid=4644, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 10:19:02,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-08-05 10:19:02,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 129. [2019-08-05 10:19:02,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-08-05 10:19:02,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 130 transitions. [2019-08-05 10:19:02,239 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 130 transitions. Word has length 126 [2019-08-05 10:19:02,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:02,239 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 130 transitions. [2019-08-05 10:19:02,239 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 10:19:02,239 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2019-08-05 10:19:02,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-08-05 10:19:02,240 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:02,240 INFO L399 BasicCegarLoop]: trace histogram [42, 41, 41, 1, 1, 1, 1] [2019-08-05 10:19:02,240 INFO L418 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:02,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:02,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1757944118, now seen corresponding path program 81 times [2019-08-05 10:19:02,241 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:02,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:02,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 636 conjuncts, 86 conjunts are in the unsatisfiable core [2019-08-05 10:19:02,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:04,525 INFO L134 CoverageAnalysis]: Checked inductivity of 2583 backedges. 1722 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:04,525 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:04,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2019-08-05 10:19:04,526 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-08-05 10:19:04,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-08-05 10:19:04,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=5419, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 10:19:04,527 INFO L87 Difference]: Start difference. First operand 129 states and 130 transitions. Second operand 86 states. [2019-08-05 10:19:06,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:06,930 INFO L93 Difference]: Finished difference Result 213 states and 214 transitions. [2019-08-05 10:19:06,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-08-05 10:19:06,930 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 128 [2019-08-05 10:19:06,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:06,931 INFO L225 Difference]: With dead ends: 213 [2019-08-05 10:19:06,931 INFO L226 Difference]: Without dead ends: 130 [2019-08-05 10:19:06,933 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2542 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=3781, Invalid=12475, Unknown=0, NotChecked=0, Total=16256 [2019-08-05 10:19:06,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-08-05 10:19:06,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2019-08-05 10:19:06,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-08-05 10:19:06,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 131 transitions. [2019-08-05 10:19:06,935 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 131 transitions. Word has length 128 [2019-08-05 10:19:06,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:06,935 INFO L475 AbstractCegarLoop]: Abstraction has 130 states and 131 transitions. [2019-08-05 10:19:06,935 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-08-05 10:19:06,935 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 131 transitions. [2019-08-05 10:19:06,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-08-05 10:19:06,936 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:06,936 INFO L399 BasicCegarLoop]: trace histogram [42, 42, 41, 1, 1, 1, 1] [2019-08-05 10:19:06,936 INFO L418 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:06,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:06,937 INFO L82 PathProgramCache]: Analyzing trace with hash -845555199, now seen corresponding path program 82 times [2019-08-05 10:19:06,937 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:06,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:07,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 641 conjuncts, 88 conjunts are in the unsatisfiable core [2019-08-05 10:19:07,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:07,727 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:07,771 INFO L134 CoverageAnalysis]: Checked inductivity of 2625 backedges. 903 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:07,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:07,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 10:19:07,772 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:19:07,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:19:07,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=992, Invalid=1078, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:19:07,772 INFO L87 Difference]: Start difference. First operand 130 states and 131 transitions. Second operand 46 states. [2019-08-05 10:19:08,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:08,873 INFO L93 Difference]: Finished difference Result 136 states and 137 transitions. [2019-08-05 10:19:08,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-08-05 10:19:08,874 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 129 [2019-08-05 10:19:08,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:08,875 INFO L225 Difference]: With dead ends: 136 [2019-08-05 10:19:08,875 INFO L226 Difference]: Without dead ends: 136 [2019-08-05 10:19:08,876 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1806 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2970, Invalid=4862, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 10:19:08,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-08-05 10:19:08,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 132. [2019-08-05 10:19:08,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-08-05 10:19:08,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 133 transitions. [2019-08-05 10:19:08,879 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 133 transitions. Word has length 129 [2019-08-05 10:19:08,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:08,879 INFO L475 AbstractCegarLoop]: Abstraction has 132 states and 133 transitions. [2019-08-05 10:19:08,879 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:19:08,879 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 133 transitions. [2019-08-05 10:19:08,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-08-05 10:19:08,880 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:08,880 INFO L399 BasicCegarLoop]: trace histogram [43, 42, 42, 1, 1, 1, 1] [2019-08-05 10:19:08,880 INFO L418 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:08,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:08,881 INFO L82 PathProgramCache]: Analyzing trace with hash -829794083, now seen corresponding path program 83 times [2019-08-05 10:19:08,881 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:08,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:08,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 651 conjuncts, 88 conjunts are in the unsatisfiable core [2019-08-05 10:19:08,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:11,064 INFO L134 CoverageAnalysis]: Checked inductivity of 2709 backedges. 1806 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:11,064 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:11,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2019-08-05 10:19:11,064 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-08-05 10:19:11,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-08-05 10:19:11,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1979, Invalid=5677, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 10:19:11,065 INFO L87 Difference]: Start difference. First operand 132 states and 133 transitions. Second operand 88 states. [2019-08-05 10:19:13,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:13,848 INFO L93 Difference]: Finished difference Result 218 states and 219 transitions. [2019-08-05 10:19:13,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-08-05 10:19:13,849 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 131 [2019-08-05 10:19:13,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:13,850 INFO L225 Difference]: With dead ends: 218 [2019-08-05 10:19:13,850 INFO L226 Difference]: Without dead ends: 133 [2019-08-05 10:19:13,851 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2667 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=3957, Invalid=13073, Unknown=0, NotChecked=0, Total=17030 [2019-08-05 10:19:13,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-08-05 10:19:13,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2019-08-05 10:19:13,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-08-05 10:19:13,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 134 transitions. [2019-08-05 10:19:13,852 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 134 transitions. Word has length 131 [2019-08-05 10:19:13,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:13,853 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 134 transitions. [2019-08-05 10:19:13,853 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-08-05 10:19:13,853 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 134 transitions. [2019-08-05 10:19:13,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-08-05 10:19:13,854 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:13,854 INFO L399 BasicCegarLoop]: trace histogram [43, 43, 42, 1, 1, 1, 1] [2019-08-05 10:19:13,854 INFO L418 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:13,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:13,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1595442758, now seen corresponding path program 84 times [2019-08-05 10:19:13,855 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:13,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:13,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 656 conjuncts, 90 conjunts are in the unsatisfiable core [2019-08-05 10:19:13,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:15,036 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:15,066 INFO L134 CoverageAnalysis]: Checked inductivity of 2752 backedges. 946 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:15,066 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:15,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 10:19:15,067 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 10:19:15,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 10:19:15,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1037, Invalid=1125, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:19:15,068 INFO L87 Difference]: Start difference. First operand 133 states and 134 transitions. Second operand 47 states. [2019-08-05 10:19:16,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:16,041 INFO L93 Difference]: Finished difference Result 139 states and 140 transitions. [2019-08-05 10:19:16,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-08-05 10:19:16,041 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 132 [2019-08-05 10:19:16,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:16,042 INFO L225 Difference]: With dead ends: 139 [2019-08-05 10:19:16,042 INFO L226 Difference]: Without dead ends: 139 [2019-08-05 10:19:16,043 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1892 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=3105, Invalid=5085, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 10:19:16,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-08-05 10:19:16,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 135. [2019-08-05 10:19:16,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-08-05 10:19:16,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2019-08-05 10:19:16,046 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 132 [2019-08-05 10:19:16,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:16,046 INFO L475 AbstractCegarLoop]: Abstraction has 135 states and 136 transitions. [2019-08-05 10:19:16,046 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 10:19:16,046 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 136 transitions. [2019-08-05 10:19:16,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-08-05 10:19:16,047 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:16,047 INFO L399 BasicCegarLoop]: trace histogram [44, 43, 43, 1, 1, 1, 1] [2019-08-05 10:19:16,047 INFO L418 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:16,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:16,048 INFO L82 PathProgramCache]: Analyzing trace with hash -82901022, now seen corresponding path program 85 times [2019-08-05 10:19:16,048 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:16,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:16,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 666 conjuncts, 90 conjunts are in the unsatisfiable core [2019-08-05 10:19:16,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:18,269 INFO L134 CoverageAnalysis]: Checked inductivity of 2838 backedges. 1892 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:18,270 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:18,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2019-08-05 10:19:18,270 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-08-05 10:19:18,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-08-05 10:19:18,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2069, Invalid=5941, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 10:19:18,271 INFO L87 Difference]: Start difference. First operand 135 states and 136 transitions. Second operand 90 states. [2019-08-05 10:19:20,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:20,271 INFO L93 Difference]: Finished difference Result 223 states and 224 transitions. [2019-08-05 10:19:20,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-08-05 10:19:20,272 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 134 [2019-08-05 10:19:20,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:20,273 INFO L225 Difference]: With dead ends: 223 [2019-08-05 10:19:20,273 INFO L226 Difference]: Without dead ends: 136 [2019-08-05 10:19:20,274 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2795 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4137, Invalid=13685, Unknown=0, NotChecked=0, Total=17822 [2019-08-05 10:19:20,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-08-05 10:19:20,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2019-08-05 10:19:20,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-08-05 10:19:20,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 137 transitions. [2019-08-05 10:19:20,275 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 137 transitions. Word has length 134 [2019-08-05 10:19:20,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:20,275 INFO L475 AbstractCegarLoop]: Abstraction has 136 states and 137 transitions. [2019-08-05 10:19:20,275 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-08-05 10:19:20,275 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 137 transitions. [2019-08-05 10:19:20,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-08-05 10:19:20,276 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:20,276 INFO L399 BasicCegarLoop]: trace histogram [44, 44, 43, 1, 1, 1, 1] [2019-08-05 10:19:20,276 INFO L418 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:20,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:20,276 INFO L82 PathProgramCache]: Analyzing trace with hash 207975897, now seen corresponding path program 86 times [2019-08-05 10:19:20,277 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:20,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:20,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 671 conjuncts, 92 conjunts are in the unsatisfiable core [2019-08-05 10:19:20,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:21,128 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:21,157 INFO L134 CoverageAnalysis]: Checked inductivity of 2882 backedges. 990 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:21,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:21,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 10:19:21,158 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 10:19:21,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 10:19:21,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1083, Invalid=1173, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:19:21,158 INFO L87 Difference]: Start difference. First operand 136 states and 137 transitions. Second operand 48 states. [2019-08-05 10:19:22,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:22,204 INFO L93 Difference]: Finished difference Result 142 states and 143 transitions. [2019-08-05 10:19:22,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-08-05 10:19:22,204 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 135 [2019-08-05 10:19:22,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:22,205 INFO L225 Difference]: With dead ends: 142 [2019-08-05 10:19:22,206 INFO L226 Difference]: Without dead ends: 142 [2019-08-05 10:19:22,207 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1980 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=3243, Invalid=5313, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 10:19:22,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-08-05 10:19:22,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 138. [2019-08-05 10:19:22,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-08-05 10:19:22,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 139 transitions. [2019-08-05 10:19:22,210 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 139 transitions. Word has length 135 [2019-08-05 10:19:22,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:22,210 INFO L475 AbstractCegarLoop]: Abstraction has 138 states and 139 transitions. [2019-08-05 10:19:22,210 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 10:19:22,210 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 139 transitions. [2019-08-05 10:19:22,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-08-05 10:19:22,211 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:22,211 INFO L399 BasicCegarLoop]: trace histogram [45, 44, 44, 1, 1, 1, 1] [2019-08-05 10:19:22,211 INFO L418 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:22,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:22,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1998692683, now seen corresponding path program 87 times [2019-08-05 10:19:22,212 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:22,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:22,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 681 conjuncts, 92 conjunts are in the unsatisfiable core [2019-08-05 10:19:22,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:24,760 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 1980 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:24,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:24,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2019-08-05 10:19:24,760 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-08-05 10:19:24,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-08-05 10:19:24,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2161, Invalid=6211, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 10:19:24,762 INFO L87 Difference]: Start difference. First operand 138 states and 139 transitions. Second operand 92 states. [2019-08-05 10:19:28,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:28,068 INFO L93 Difference]: Finished difference Result 228 states and 229 transitions. [2019-08-05 10:19:28,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-08-05 10:19:28,068 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 137 [2019-08-05 10:19:28,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:28,069 INFO L225 Difference]: With dead ends: 228 [2019-08-05 10:19:28,069 INFO L226 Difference]: Without dead ends: 139 [2019-08-05 10:19:28,070 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2926 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=4321, Invalid=14311, Unknown=0, NotChecked=0, Total=18632 [2019-08-05 10:19:28,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-08-05 10:19:28,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2019-08-05 10:19:28,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-08-05 10:19:28,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2019-08-05 10:19:28,073 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 137 [2019-08-05 10:19:28,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:28,073 INFO L475 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2019-08-05 10:19:28,073 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-08-05 10:19:28,073 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2019-08-05 10:19:28,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-08-05 10:19:28,074 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:28,074 INFO L399 BasicCegarLoop]: trace histogram [45, 45, 44, 1, 1, 1, 1] [2019-08-05 10:19:28,074 INFO L418 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:28,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:28,074 INFO L82 PathProgramCache]: Analyzing trace with hash 566565214, now seen corresponding path program 88 times [2019-08-05 10:19:28,075 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:28,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:28,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 94 conjunts are in the unsatisfiable core [2019-08-05 10:19:28,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:29,127 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:29,176 INFO L134 CoverageAnalysis]: Checked inductivity of 3015 backedges. 1035 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:29,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:29,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 10:19:29,177 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 10:19:29,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 10:19:29,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1130, Invalid=1222, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:19:29,178 INFO L87 Difference]: Start difference. First operand 139 states and 140 transitions. Second operand 49 states. [2019-08-05 10:19:30,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:30,472 INFO L93 Difference]: Finished difference Result 145 states and 146 transitions. [2019-08-05 10:19:30,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-08-05 10:19:30,472 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 138 [2019-08-05 10:19:30,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:30,473 INFO L225 Difference]: With dead ends: 145 [2019-08-05 10:19:30,473 INFO L226 Difference]: Without dead ends: 145 [2019-08-05 10:19:30,474 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2070 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=3384, Invalid=5546, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 10:19:30,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-08-05 10:19:30,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 141. [2019-08-05 10:19:30,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-08-05 10:19:30,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 142 transitions. [2019-08-05 10:19:30,476 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 142 transitions. Word has length 138 [2019-08-05 10:19:30,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:30,477 INFO L475 AbstractCegarLoop]: Abstraction has 141 states and 142 transitions. [2019-08-05 10:19:30,477 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 10:19:30,477 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 142 transitions. [2019-08-05 10:19:30,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-08-05 10:19:30,477 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:30,478 INFO L399 BasicCegarLoop]: trace histogram [46, 45, 45, 1, 1, 1, 1] [2019-08-05 10:19:30,478 INFO L418 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:30,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:30,478 INFO L82 PathProgramCache]: Analyzing trace with hash -991742726, now seen corresponding path program 89 times [2019-08-05 10:19:30,479 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:30,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:30,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 696 conjuncts, 94 conjunts are in the unsatisfiable core [2019-08-05 10:19:30,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:32,880 INFO L134 CoverageAnalysis]: Checked inductivity of 3105 backedges. 2070 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:32,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:32,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2019-08-05 10:19:32,881 INFO L454 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-08-05 10:19:32,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-08-05 10:19:32,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2255, Invalid=6487, Unknown=0, NotChecked=0, Total=8742 [2019-08-05 10:19:32,882 INFO L87 Difference]: Start difference. First operand 141 states and 142 transitions. Second operand 94 states. [2019-08-05 10:19:36,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:36,600 INFO L93 Difference]: Finished difference Result 233 states and 234 transitions. [2019-08-05 10:19:36,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-08-05 10:19:36,600 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 140 [2019-08-05 10:19:36,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:36,601 INFO L225 Difference]: With dead ends: 233 [2019-08-05 10:19:36,601 INFO L226 Difference]: Without dead ends: 142 [2019-08-05 10:19:36,602 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3060 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4509, Invalid=14951, Unknown=0, NotChecked=0, Total=19460 [2019-08-05 10:19:36,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-08-05 10:19:36,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2019-08-05 10:19:36,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-08-05 10:19:36,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 143 transitions. [2019-08-05 10:19:36,604 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 143 transitions. Word has length 140 [2019-08-05 10:19:36,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:36,605 INFO L475 AbstractCegarLoop]: Abstraction has 142 states and 143 transitions. [2019-08-05 10:19:36,605 INFO L476 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-08-05 10:19:36,605 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 143 transitions. [2019-08-05 10:19:36,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-08-05 10:19:36,605 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:36,605 INFO L399 BasicCegarLoop]: trace histogram [46, 46, 45, 1, 1, 1, 1] [2019-08-05 10:19:36,605 INFO L418 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:36,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:36,606 INFO L82 PathProgramCache]: Analyzing trace with hash 253169073, now seen corresponding path program 90 times [2019-08-05 10:19:36,606 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:36,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:36,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 701 conjuncts, 96 conjunts are in the unsatisfiable core [2019-08-05 10:19:36,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:37,949 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:37,982 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 1081 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:37,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:37,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 10:19:37,982 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 10:19:37,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 10:19:37,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1178, Invalid=1272, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:19:37,983 INFO L87 Difference]: Start difference. First operand 142 states and 143 transitions. Second operand 50 states. [2019-08-05 10:19:39,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:39,085 INFO L93 Difference]: Finished difference Result 148 states and 149 transitions. [2019-08-05 10:19:39,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-08-05 10:19:39,086 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 141 [2019-08-05 10:19:39,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:39,087 INFO L225 Difference]: With dead ends: 148 [2019-08-05 10:19:39,087 INFO L226 Difference]: Without dead ends: 148 [2019-08-05 10:19:39,088 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2162 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3528, Invalid=5784, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 10:19:39,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-08-05 10:19:39,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 144. [2019-08-05 10:19:39,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-08-05 10:19:39,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 145 transitions. [2019-08-05 10:19:39,090 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 145 transitions. Word has length 141 [2019-08-05 10:19:39,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:39,090 INFO L475 AbstractCegarLoop]: Abstraction has 144 states and 145 transitions. [2019-08-05 10:19:39,091 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 10:19:39,091 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 145 transitions. [2019-08-05 10:19:39,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-08-05 10:19:39,091 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:39,091 INFO L399 BasicCegarLoop]: trace histogram [47, 46, 46, 1, 1, 1, 1] [2019-08-05 10:19:39,091 INFO L418 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:39,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:39,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1517723507, now seen corresponding path program 91 times [2019-08-05 10:19:39,092 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:39,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:39,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 711 conjuncts, 96 conjunts are in the unsatisfiable core [2019-08-05 10:19:39,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:41,806 INFO L134 CoverageAnalysis]: Checked inductivity of 3243 backedges. 2162 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:41,807 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:41,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2019-08-05 10:19:41,807 INFO L454 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-08-05 10:19:41,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-08-05 10:19:41,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2351, Invalid=6769, Unknown=0, NotChecked=0, Total=9120 [2019-08-05 10:19:41,809 INFO L87 Difference]: Start difference. First operand 144 states and 145 transitions. Second operand 96 states. [2019-08-05 10:19:44,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:44,247 INFO L93 Difference]: Finished difference Result 238 states and 239 transitions. [2019-08-05 10:19:44,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-08-05 10:19:44,247 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 143 [2019-08-05 10:19:44,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:44,248 INFO L225 Difference]: With dead ends: 238 [2019-08-05 10:19:44,248 INFO L226 Difference]: Without dead ends: 145 [2019-08-05 10:19:44,250 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3197 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=4701, Invalid=15605, Unknown=0, NotChecked=0, Total=20306 [2019-08-05 10:19:44,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-08-05 10:19:44,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2019-08-05 10:19:44,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-08-05 10:19:44,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 146 transitions. [2019-08-05 10:19:44,251 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 146 transitions. Word has length 143 [2019-08-05 10:19:44,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:44,252 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 146 transitions. [2019-08-05 10:19:44,252 INFO L476 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-08-05 10:19:44,252 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 146 transitions. [2019-08-05 10:19:44,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-08-05 10:19:44,252 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:44,252 INFO L399 BasicCegarLoop]: trace histogram [47, 47, 46, 1, 1, 1, 1] [2019-08-05 10:19:44,253 INFO L418 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:44,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:44,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1392920458, now seen corresponding path program 92 times [2019-08-05 10:19:44,253 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:44,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:44,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 716 conjuncts, 98 conjunts are in the unsatisfiable core [2019-08-05 10:19:44,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:45,532 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:45,565 INFO L134 CoverageAnalysis]: Checked inductivity of 3290 backedges. 1128 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:45,566 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:45,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 10:19:45,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 10:19:45,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 10:19:45,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1227, Invalid=1323, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:19:45,567 INFO L87 Difference]: Start difference. First operand 145 states and 146 transitions. Second operand 51 states. [2019-08-05 10:19:46,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:46,774 INFO L93 Difference]: Finished difference Result 151 states and 152 transitions. [2019-08-05 10:19:46,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-08-05 10:19:46,774 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 144 [2019-08-05 10:19:46,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:46,775 INFO L225 Difference]: With dead ends: 151 [2019-08-05 10:19:46,775 INFO L226 Difference]: Without dead ends: 151 [2019-08-05 10:19:46,777 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2256 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3675, Invalid=6027, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 10:19:46,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-08-05 10:19:46,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 147. [2019-08-05 10:19:46,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-08-05 10:19:46,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 148 transitions. [2019-08-05 10:19:46,779 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 148 transitions. Word has length 144 [2019-08-05 10:19:46,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:46,779 INFO L475 AbstractCegarLoop]: Abstraction has 147 states and 148 transitions. [2019-08-05 10:19:46,780 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 10:19:46,780 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 148 transitions. [2019-08-05 10:19:46,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-08-05 10:19:46,780 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:46,780 INFO L399 BasicCegarLoop]: trace histogram [48, 47, 47, 1, 1, 1, 1] [2019-08-05 10:19:46,780 INFO L418 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:46,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:46,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1433169426, now seen corresponding path program 93 times [2019-08-05 10:19:46,781 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:46,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:46,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 726 conjuncts, 98 conjunts are in the unsatisfiable core [2019-08-05 10:19:46,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:49,371 INFO L134 CoverageAnalysis]: Checked inductivity of 3384 backedges. 2256 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:49,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:49,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2019-08-05 10:19:49,372 INFO L454 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-08-05 10:19:49,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-08-05 10:19:49,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2449, Invalid=7057, Unknown=0, NotChecked=0, Total=9506 [2019-08-05 10:19:49,373 INFO L87 Difference]: Start difference. First operand 147 states and 148 transitions. Second operand 98 states. [2019-08-05 10:19:53,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:53,242 INFO L93 Difference]: Finished difference Result 243 states and 244 transitions. [2019-08-05 10:19:53,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-08-05 10:19:53,242 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 146 [2019-08-05 10:19:53,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:53,243 INFO L225 Difference]: With dead ends: 243 [2019-08-05 10:19:53,244 INFO L226 Difference]: Without dead ends: 148 [2019-08-05 10:19:53,244 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3337 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=4897, Invalid=16273, Unknown=0, NotChecked=0, Total=21170 [2019-08-05 10:19:53,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-08-05 10:19:53,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2019-08-05 10:19:53,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-08-05 10:19:53,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 149 transitions. [2019-08-05 10:19:53,246 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 149 transitions. Word has length 146 [2019-08-05 10:19:53,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:53,247 INFO L475 AbstractCegarLoop]: Abstraction has 148 states and 149 transitions. [2019-08-05 10:19:53,247 INFO L476 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-08-05 10:19:53,247 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 149 transitions. [2019-08-05 10:19:53,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-08-05 10:19:53,247 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:53,248 INFO L399 BasicCegarLoop]: trace histogram [48, 48, 47, 1, 1, 1, 1] [2019-08-05 10:19:53,248 INFO L418 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:53,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:53,248 INFO L82 PathProgramCache]: Analyzing trace with hash -876151, now seen corresponding path program 94 times [2019-08-05 10:19:53,249 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:53,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:53,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 731 conjuncts, 100 conjunts are in the unsatisfiable core [2019-08-05 10:19:53,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:54,281 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:54,313 INFO L134 CoverageAnalysis]: Checked inductivity of 3432 backedges. 1176 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:54,314 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:54,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 10:19:54,314 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 10:19:54,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 10:19:54,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1277, Invalid=1375, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:19:54,315 INFO L87 Difference]: Start difference. First operand 148 states and 149 transitions. Second operand 52 states. [2019-08-05 10:19:55,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:55,706 INFO L93 Difference]: Finished difference Result 154 states and 155 transitions. [2019-08-05 10:19:55,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-08-05 10:19:55,707 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 147 [2019-08-05 10:19:55,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:55,708 INFO L225 Difference]: With dead ends: 154 [2019-08-05 10:19:55,708 INFO L226 Difference]: Without dead ends: 154 [2019-08-05 10:19:55,709 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2352 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=3825, Invalid=6275, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 10:19:55,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-08-05 10:19:55,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 150. [2019-08-05 10:19:55,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-08-05 10:19:55,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 151 transitions. [2019-08-05 10:19:55,712 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 151 transitions. Word has length 147 [2019-08-05 10:19:55,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:55,712 INFO L475 AbstractCegarLoop]: Abstraction has 150 states and 151 transitions. [2019-08-05 10:19:55,712 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 10:19:55,712 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 151 transitions. [2019-08-05 10:19:55,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-08-05 10:19:55,713 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:55,713 INFO L399 BasicCegarLoop]: trace histogram [49, 48, 48, 1, 1, 1, 1] [2019-08-05 10:19:55,713 INFO L418 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:55,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:55,714 INFO L82 PathProgramCache]: Analyzing trace with hash -842047899, now seen corresponding path program 95 times [2019-08-05 10:19:55,714 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:55,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:55,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 741 conjuncts, 100 conjunts are in the unsatisfiable core [2019-08-05 10:19:55,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:58,461 INFO L134 CoverageAnalysis]: Checked inductivity of 3528 backedges. 2352 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:58,462 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:58,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2019-08-05 10:19:58,462 INFO L454 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-08-05 10:19:58,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-08-05 10:19:58,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2549, Invalid=7351, Unknown=0, NotChecked=0, Total=9900 [2019-08-05 10:19:58,463 INFO L87 Difference]: Start difference. First operand 150 states and 151 transitions. Second operand 100 states. [2019-08-05 10:20:02,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:02,568 INFO L93 Difference]: Finished difference Result 248 states and 249 transitions. [2019-08-05 10:20:02,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-08-05 10:20:02,569 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 149 [2019-08-05 10:20:02,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:02,569 INFO L225 Difference]: With dead ends: 248 [2019-08-05 10:20:02,569 INFO L226 Difference]: Without dead ends: 151 [2019-08-05 10:20:02,570 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3480 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=5097, Invalid=16955, Unknown=0, NotChecked=0, Total=22052 [2019-08-05 10:20:02,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-08-05 10:20:02,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2019-08-05 10:20:02,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-08-05 10:20:02,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 152 transitions. [2019-08-05 10:20:02,572 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 152 transitions. Word has length 149 [2019-08-05 10:20:02,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:02,573 INFO L475 AbstractCegarLoop]: Abstraction has 151 states and 152 transitions. [2019-08-05 10:20:02,573 INFO L476 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-08-05 10:20:02,573 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 152 transitions. [2019-08-05 10:20:02,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-08-05 10:20:02,574 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:02,574 INFO L399 BasicCegarLoop]: trace histogram [49, 49, 48, 1, 1, 1, 1] [2019-08-05 10:20:02,574 INFO L418 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:02,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:02,574 INFO L82 PathProgramCache]: Analyzing trace with hash -454138994, now seen corresponding path program 96 times [2019-08-05 10:20:02,575 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:02,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:02,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 746 conjuncts, 102 conjunts are in the unsatisfiable core [2019-08-05 10:20:02,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:03,677 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:20:03,712 INFO L134 CoverageAnalysis]: Checked inductivity of 3577 backedges. 1225 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:03,712 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:03,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 10:20:03,712 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 10:20:03,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 10:20:03,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1328, Invalid=1428, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:20:03,713 INFO L87 Difference]: Start difference. First operand 151 states and 152 transitions. Second operand 53 states. [2019-08-05 10:20:04,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:04,957 INFO L93 Difference]: Finished difference Result 157 states and 158 transitions. [2019-08-05 10:20:04,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-08-05 10:20:04,958 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 150 [2019-08-05 10:20:04,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:04,959 INFO L225 Difference]: With dead ends: 157 [2019-08-05 10:20:04,959 INFO L226 Difference]: Without dead ends: 157 [2019-08-05 10:20:04,960 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2450 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=3978, Invalid=6528, Unknown=0, NotChecked=0, Total=10506 [2019-08-05 10:20:04,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-08-05 10:20:04,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 153. [2019-08-05 10:20:04,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-08-05 10:20:04,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 154 transitions. [2019-08-05 10:20:04,962 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 154 transitions. Word has length 150 [2019-08-05 10:20:04,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:04,962 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 154 transitions. [2019-08-05 10:20:04,962 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 10:20:04,962 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 154 transitions. [2019-08-05 10:20:04,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-08-05 10:20:04,963 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:04,963 INFO L399 BasicCegarLoop]: trace histogram [50, 49, 49, 1, 1, 1, 1] [2019-08-05 10:20:04,963 INFO L418 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:04,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:04,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1659024170, now seen corresponding path program 97 times [2019-08-05 10:20:04,964 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:05,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:05,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 756 conjuncts, 102 conjunts are in the unsatisfiable core [2019-08-05 10:20:05,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:08,007 INFO L134 CoverageAnalysis]: Checked inductivity of 3675 backedges. 2450 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:08,008 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:08,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2019-08-05 10:20:08,008 INFO L454 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-08-05 10:20:08,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-08-05 10:20:08,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2651, Invalid=7651, Unknown=0, NotChecked=0, Total=10302 [2019-08-05 10:20:08,009 INFO L87 Difference]: Start difference. First operand 153 states and 154 transitions. Second operand 102 states. [2019-08-05 10:20:10,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:10,711 INFO L93 Difference]: Finished difference Result 253 states and 254 transitions. [2019-08-05 10:20:10,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-08-05 10:20:10,711 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 152 [2019-08-05 10:20:10,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:10,712 INFO L225 Difference]: With dead ends: 253 [2019-08-05 10:20:10,712 INFO L226 Difference]: Without dead ends: 154 [2019-08-05 10:20:10,713 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3626 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=5301, Invalid=17651, Unknown=0, NotChecked=0, Total=22952 [2019-08-05 10:20:10,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-08-05 10:20:10,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2019-08-05 10:20:10,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-08-05 10:20:10,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 155 transitions. [2019-08-05 10:20:10,715 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 155 transitions. Word has length 152 [2019-08-05 10:20:10,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:10,715 INFO L475 AbstractCegarLoop]: Abstraction has 154 states and 155 transitions. [2019-08-05 10:20:10,715 INFO L476 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-08-05 10:20:10,715 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 155 transitions. [2019-08-05 10:20:10,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-08-05 10:20:10,716 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:10,716 INFO L399 BasicCegarLoop]: trace histogram [50, 50, 49, 1, 1, 1, 1] [2019-08-05 10:20:10,716 INFO L418 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:10,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:10,717 INFO L82 PathProgramCache]: Analyzing trace with hash 96219489, now seen corresponding path program 98 times [2019-08-05 10:20:10,717 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:10,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:10,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 761 conjuncts, 104 conjunts are in the unsatisfiable core [2019-08-05 10:20:10,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:11,775 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:20:11,811 INFO L134 CoverageAnalysis]: Checked inductivity of 3725 backedges. 1275 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:11,812 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:11,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 10:20:11,812 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 10:20:11,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 10:20:11,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1380, Invalid=1482, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:20:11,813 INFO L87 Difference]: Start difference. First operand 154 states and 155 transitions. Second operand 54 states. [2019-08-05 10:20:13,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:13,049 INFO L93 Difference]: Finished difference Result 160 states and 161 transitions. [2019-08-05 10:20:13,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-08-05 10:20:13,050 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 153 [2019-08-05 10:20:13,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:13,051 INFO L225 Difference]: With dead ends: 160 [2019-08-05 10:20:13,051 INFO L226 Difference]: Without dead ends: 160 [2019-08-05 10:20:13,052 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2550 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=4134, Invalid=6786, Unknown=0, NotChecked=0, Total=10920 [2019-08-05 10:20:13,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-08-05 10:20:13,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 156. [2019-08-05 10:20:13,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-08-05 10:20:13,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 157 transitions. [2019-08-05 10:20:13,054 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 157 transitions. Word has length 153 [2019-08-05 10:20:13,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:13,055 INFO L475 AbstractCegarLoop]: Abstraction has 156 states and 157 transitions. [2019-08-05 10:20:13,055 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 10:20:13,055 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 157 transitions. [2019-08-05 10:20:13,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-08-05 10:20:13,056 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:13,056 INFO L399 BasicCegarLoop]: trace histogram [51, 50, 50, 1, 1, 1, 1] [2019-08-05 10:20:13,056 INFO L418 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:13,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:13,056 INFO L82 PathProgramCache]: Analyzing trace with hash -2022418371, now seen corresponding path program 99 times [2019-08-05 10:20:13,057 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:13,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:13,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 771 conjuncts, 104 conjunts are in the unsatisfiable core [2019-08-05 10:20:13,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:16,382 INFO L134 CoverageAnalysis]: Checked inductivity of 3825 backedges. 2550 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:16,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:16,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2019-08-05 10:20:16,383 INFO L454 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-08-05 10:20:16,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-08-05 10:20:16,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2755, Invalid=7957, Unknown=0, NotChecked=0, Total=10712 [2019-08-05 10:20:16,384 INFO L87 Difference]: Start difference. First operand 156 states and 157 transitions. Second operand 104 states. [2019-08-05 10:20:22,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:22,091 INFO L93 Difference]: Finished difference Result 258 states and 259 transitions. [2019-08-05 10:20:22,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-08-05 10:20:22,091 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 155 [2019-08-05 10:20:22,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:22,092 INFO L225 Difference]: With dead ends: 258 [2019-08-05 10:20:22,092 INFO L226 Difference]: Without dead ends: 157 [2019-08-05 10:20:22,093 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3775 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=5509, Invalid=18361, Unknown=0, NotChecked=0, Total=23870 [2019-08-05 10:20:22,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-08-05 10:20:22,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2019-08-05 10:20:22,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-08-05 10:20:22,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 158 transitions. [2019-08-05 10:20:22,095 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 158 transitions. Word has length 155 [2019-08-05 10:20:22,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:22,095 INFO L475 AbstractCegarLoop]: Abstraction has 157 states and 158 transitions. [2019-08-05 10:20:22,095 INFO L476 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-08-05 10:20:22,095 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 158 transitions. [2019-08-05 10:20:22,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-08-05 10:20:22,096 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:22,096 INFO L399 BasicCegarLoop]: trace histogram [51, 51, 50, 1, 1, 1, 1] [2019-08-05 10:20:22,097 INFO L418 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:22,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:22,097 INFO L82 PathProgramCache]: Analyzing trace with hash -2091181402, now seen corresponding path program 100 times [2019-08-05 10:20:22,097 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:22,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:22,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 776 conjuncts, 106 conjunts are in the unsatisfiable core [2019-08-05 10:20:22,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:23,226 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:20:23,263 INFO L134 CoverageAnalysis]: Checked inductivity of 3876 backedges. 1326 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:23,263 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:23,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 10:20:23,263 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 10:20:23,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 10:20:23,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1433, Invalid=1537, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:20:23,264 INFO L87 Difference]: Start difference. First operand 157 states and 158 transitions. Second operand 55 states. [2019-08-05 10:20:24,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:24,598 INFO L93 Difference]: Finished difference Result 163 states and 164 transitions. [2019-08-05 10:20:24,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-08-05 10:20:24,599 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 156 [2019-08-05 10:20:24,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:24,600 INFO L225 Difference]: With dead ends: 163 [2019-08-05 10:20:24,600 INFO L226 Difference]: Without dead ends: 163 [2019-08-05 10:20:24,601 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2652 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=4293, Invalid=7049, Unknown=0, NotChecked=0, Total=11342 [2019-08-05 10:20:24,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-08-05 10:20:24,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 159. [2019-08-05 10:20:24,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-08-05 10:20:24,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 160 transitions. [2019-08-05 10:20:24,604 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 160 transitions. Word has length 156 [2019-08-05 10:20:24,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:24,604 INFO L475 AbstractCegarLoop]: Abstraction has 159 states and 160 transitions. [2019-08-05 10:20:24,604 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 10:20:24,605 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 160 transitions. [2019-08-05 10:20:24,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-08-05 10:20:24,605 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:24,606 INFO L399 BasicCegarLoop]: trace histogram [52, 51, 51, 1, 1, 1, 1] [2019-08-05 10:20:24,606 INFO L418 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:24,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:24,606 INFO L82 PathProgramCache]: Analyzing trace with hash 419300418, now seen corresponding path program 101 times [2019-08-05 10:20:24,607 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:24,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:24,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 786 conjuncts, 106 conjunts are in the unsatisfiable core [2019-08-05 10:20:24,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:27,821 INFO L134 CoverageAnalysis]: Checked inductivity of 3978 backedges. 2652 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:27,821 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:27,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2019-08-05 10:20:27,821 INFO L454 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-08-05 10:20:27,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-08-05 10:20:27,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2861, Invalid=8269, Unknown=0, NotChecked=0, Total=11130 [2019-08-05 10:20:27,822 INFO L87 Difference]: Start difference. First operand 159 states and 160 transitions. Second operand 106 states. [2019-08-05 10:20:33,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:33,481 INFO L93 Difference]: Finished difference Result 263 states and 264 transitions. [2019-08-05 10:20:33,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-08-05 10:20:33,481 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 158 [2019-08-05 10:20:33,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:33,482 INFO L225 Difference]: With dead ends: 263 [2019-08-05 10:20:33,483 INFO L226 Difference]: Without dead ends: 160 [2019-08-05 10:20:33,484 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3927 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=5721, Invalid=19085, Unknown=0, NotChecked=0, Total=24806 [2019-08-05 10:20:33,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-08-05 10:20:33,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2019-08-05 10:20:33,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-08-05 10:20:33,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 161 transitions. [2019-08-05 10:20:33,486 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 161 transitions. Word has length 158 [2019-08-05 10:20:33,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:33,486 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 161 transitions. [2019-08-05 10:20:33,487 INFO L476 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-08-05 10:20:33,487 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 161 transitions. [2019-08-05 10:20:33,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-08-05 10:20:33,487 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:33,488 INFO L399 BasicCegarLoop]: trace histogram [52, 52, 51, 1, 1, 1, 1] [2019-08-05 10:20:33,488 INFO L418 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:33,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:33,488 INFO L82 PathProgramCache]: Analyzing trace with hash 599244089, now seen corresponding path program 102 times [2019-08-05 10:20:33,489 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:33,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:33,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 791 conjuncts, 108 conjunts are in the unsatisfiable core [2019-08-05 10:20:33,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:34,647 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:20:34,707 INFO L134 CoverageAnalysis]: Checked inductivity of 4030 backedges. 1378 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:34,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:34,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 10:20:34,707 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 10:20:34,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 10:20:34,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1487, Invalid=1593, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:20:34,708 INFO L87 Difference]: Start difference. First operand 160 states and 161 transitions. Second operand 56 states. [2019-08-05 10:20:36,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:36,340 INFO L93 Difference]: Finished difference Result 166 states and 167 transitions. [2019-08-05 10:20:36,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-08-05 10:20:36,341 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 159 [2019-08-05 10:20:36,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:36,341 INFO L225 Difference]: With dead ends: 166 [2019-08-05 10:20:36,341 INFO L226 Difference]: Without dead ends: 166 [2019-08-05 10:20:36,342 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2756 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=4455, Invalid=7317, Unknown=0, NotChecked=0, Total=11772 [2019-08-05 10:20:36,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-08-05 10:20:36,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 162. [2019-08-05 10:20:36,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-08-05 10:20:36,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 163 transitions. [2019-08-05 10:20:36,344 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 163 transitions. Word has length 159 [2019-08-05 10:20:36,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:36,344 INFO L475 AbstractCegarLoop]: Abstraction has 162 states and 163 transitions. [2019-08-05 10:20:36,344 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 10:20:36,344 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 163 transitions. [2019-08-05 10:20:36,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-08-05 10:20:36,345 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:36,345 INFO L399 BasicCegarLoop]: trace histogram [53, 52, 52, 1, 1, 1, 1] [2019-08-05 10:20:36,345 INFO L418 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:36,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:36,346 INFO L82 PathProgramCache]: Analyzing trace with hash 347885077, now seen corresponding path program 103 times [2019-08-05 10:20:36,346 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:36,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:36,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 801 conjuncts, 108 conjunts are in the unsatisfiable core [2019-08-05 10:20:36,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:39,437 INFO L134 CoverageAnalysis]: Checked inductivity of 4134 backedges. 2756 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:39,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:39,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2019-08-05 10:20:39,438 INFO L454 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-08-05 10:20:39,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-08-05 10:20:39,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2969, Invalid=8587, Unknown=0, NotChecked=0, Total=11556 [2019-08-05 10:20:39,439 INFO L87 Difference]: Start difference. First operand 162 states and 163 transitions. Second operand 108 states. [2019-08-05 10:20:45,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:45,353 INFO L93 Difference]: Finished difference Result 268 states and 269 transitions. [2019-08-05 10:20:45,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-08-05 10:20:45,353 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 161 [2019-08-05 10:20:45,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:45,354 INFO L225 Difference]: With dead ends: 268 [2019-08-05 10:20:45,354 INFO L226 Difference]: Without dead ends: 163 [2019-08-05 10:20:45,355 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4082 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=5937, Invalid=19823, Unknown=0, NotChecked=0, Total=25760 [2019-08-05 10:20:45,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-08-05 10:20:45,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2019-08-05 10:20:45,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-08-05 10:20:45,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 164 transitions. [2019-08-05 10:20:45,357 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 164 transitions. Word has length 161 [2019-08-05 10:20:45,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:45,357 INFO L475 AbstractCegarLoop]: Abstraction has 163 states and 164 transitions. [2019-08-05 10:20:45,357 INFO L476 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-08-05 10:20:45,357 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 164 transitions. [2019-08-05 10:20:45,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-08-05 10:20:45,358 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:45,358 INFO L399 BasicCegarLoop]: trace histogram [53, 53, 52, 1, 1, 1, 1] [2019-08-05 10:20:45,358 INFO L418 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:45,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:45,359 INFO L82 PathProgramCache]: Analyzing trace with hash 930602430, now seen corresponding path program 104 times [2019-08-05 10:20:45,359 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:45,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:45,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 806 conjuncts, 110 conjunts are in the unsatisfiable core [2019-08-05 10:20:45,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:46,845 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:20:46,883 INFO L134 CoverageAnalysis]: Checked inductivity of 4187 backedges. 1431 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:46,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:46,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 10:20:46,884 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 10:20:46,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 10:20:46,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1542, Invalid=1650, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:20:46,885 INFO L87 Difference]: Start difference. First operand 163 states and 164 transitions. Second operand 57 states. [2019-08-05 10:20:48,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:48,261 INFO L93 Difference]: Finished difference Result 169 states and 170 transitions. [2019-08-05 10:20:48,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-08-05 10:20:48,261 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 162 [2019-08-05 10:20:48,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:48,262 INFO L225 Difference]: With dead ends: 169 [2019-08-05 10:20:48,262 INFO L226 Difference]: Without dead ends: 169 [2019-08-05 10:20:48,263 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2862 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=4620, Invalid=7590, Unknown=0, NotChecked=0, Total=12210 [2019-08-05 10:20:48,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-08-05 10:20:48,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 165. [2019-08-05 10:20:48,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-08-05 10:20:48,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 166 transitions. [2019-08-05 10:20:48,265 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 166 transitions. Word has length 162 [2019-08-05 10:20:48,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:48,266 INFO L475 AbstractCegarLoop]: Abstraction has 165 states and 166 transitions. [2019-08-05 10:20:48,266 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 10:20:48,266 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 166 transitions. [2019-08-05 10:20:48,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-08-05 10:20:48,267 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:48,267 INFO L399 BasicCegarLoop]: trace histogram [54, 53, 53, 1, 1, 1, 1] [2019-08-05 10:20:48,267 INFO L418 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:48,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:48,267 INFO L82 PathProgramCache]: Analyzing trace with hash 955670874, now seen corresponding path program 105 times [2019-08-05 10:20:48,268 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:48,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:48,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 816 conjuncts, 110 conjunts are in the unsatisfiable core [2019-08-05 10:20:48,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:51,917 INFO L134 CoverageAnalysis]: Checked inductivity of 4293 backedges. 2862 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:51,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:51,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2019-08-05 10:20:51,917 INFO L454 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-08-05 10:20:51,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-08-05 10:20:51,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3079, Invalid=8911, Unknown=0, NotChecked=0, Total=11990 [2019-08-05 10:20:51,919 INFO L87 Difference]: Start difference. First operand 165 states and 166 transitions. Second operand 110 states. [2019-08-05 10:20:55,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:55,066 INFO L93 Difference]: Finished difference Result 273 states and 274 transitions. [2019-08-05 10:20:55,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-08-05 10:20:55,066 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 164 [2019-08-05 10:20:55,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:55,067 INFO L225 Difference]: With dead ends: 273 [2019-08-05 10:20:55,067 INFO L226 Difference]: Without dead ends: 166 [2019-08-05 10:20:55,068 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4240 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=6157, Invalid=20575, Unknown=0, NotChecked=0, Total=26732 [2019-08-05 10:20:55,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-08-05 10:20:55,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2019-08-05 10:20:55,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-08-05 10:20:55,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 167 transitions. [2019-08-05 10:20:55,071 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 167 transitions. Word has length 164 [2019-08-05 10:20:55,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:55,071 INFO L475 AbstractCegarLoop]: Abstraction has 166 states and 167 transitions. [2019-08-05 10:20:55,071 INFO L476 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-08-05 10:20:55,071 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 167 transitions. [2019-08-05 10:20:55,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-08-05 10:20:55,072 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:55,072 INFO L399 BasicCegarLoop]: trace histogram [54, 54, 53, 1, 1, 1, 1] [2019-08-05 10:20:55,072 INFO L418 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:55,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:55,072 INFO L82 PathProgramCache]: Analyzing trace with hash 430523665, now seen corresponding path program 106 times [2019-08-05 10:20:55,073 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:55,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:55,165 INFO L256 TraceCheckSpWp]: Trace formula consists of 821 conjuncts, 112 conjunts are in the unsatisfiable core [2019-08-05 10:20:55,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:56,628 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:20:56,721 INFO L134 CoverageAnalysis]: Checked inductivity of 4347 backedges. 1485 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:56,722 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:56,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 10:20:56,722 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 10:20:56,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 10:20:56,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1598, Invalid=1708, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:20:56,723 INFO L87 Difference]: Start difference. First operand 166 states and 167 transitions. Second operand 58 states. [2019-08-05 10:20:58,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:58,186 INFO L93 Difference]: Finished difference Result 172 states and 173 transitions. [2019-08-05 10:20:58,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2019-08-05 10:20:58,187 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 165 [2019-08-05 10:20:58,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:58,188 INFO L225 Difference]: With dead ends: 172 [2019-08-05 10:20:58,188 INFO L226 Difference]: Without dead ends: 172 [2019-08-05 10:20:58,189 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2970 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=4788, Invalid=7868, Unknown=0, NotChecked=0, Total=12656 [2019-08-05 10:20:58,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-08-05 10:20:58,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 168. [2019-08-05 10:20:58,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-08-05 10:20:58,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 169 transitions. [2019-08-05 10:20:58,192 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 169 transitions. Word has length 165 [2019-08-05 10:20:58,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:58,193 INFO L475 AbstractCegarLoop]: Abstraction has 168 states and 169 transitions. [2019-08-05 10:20:58,193 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 10:20:58,193 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 169 transitions. [2019-08-05 10:20:58,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-08-05 10:20:58,193 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:58,194 INFO L399 BasicCegarLoop]: trace histogram [55, 54, 54, 1, 1, 1, 1] [2019-08-05 10:20:58,194 INFO L418 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:58,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:58,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1416314861, now seen corresponding path program 107 times [2019-08-05 10:20:58,195 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:58,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:58,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 831 conjuncts, 112 conjunts are in the unsatisfiable core [2019-08-05 10:20:58,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:01,775 INFO L134 CoverageAnalysis]: Checked inductivity of 4455 backedges. 2970 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:01,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:01,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2019-08-05 10:21:01,775 INFO L454 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-08-05 10:21:01,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-08-05 10:21:01,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3191, Invalid=9241, Unknown=0, NotChecked=0, Total=12432 [2019-08-05 10:21:01,777 INFO L87 Difference]: Start difference. First operand 168 states and 169 transitions. Second operand 112 states. Received shutdown request... [2019-08-05 10:21:02,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 10:21:02,715 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 10:21:02,719 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 10:21:02,720 INFO L202 PluginConnector]: Adding new model down.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:21:02 BoogieIcfgContainer [2019-08-05 10:21:02,720 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:21:02,722 INFO L168 Benchmark]: Toolchain (without parser) took 240951.87 ms. Allocated memory was 133.2 MB in the beginning and 896.0 MB in the end (delta: 762.8 MB). Free memory was 109.6 MB in the beginning and 768.5 MB in the end (delta: -658.9 MB). Peak memory consumption was 103.9 MB. Max. memory is 7.1 GB. [2019-08-05 10:21:02,723 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 133.2 MB. Free memory was 110.8 MB in the beginning and 110.6 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-08-05 10:21:02,724 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.42 ms. Allocated memory is still 133.2 MB. Free memory was 109.3 MB in the beginning and 107.7 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:21:02,724 INFO L168 Benchmark]: Boogie Preprocessor took 20.50 ms. Allocated memory is still 133.2 MB. Free memory was 107.7 MB in the beginning and 106.5 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:21:02,725 INFO L168 Benchmark]: RCFGBuilder took 334.00 ms. Allocated memory is still 133.2 MB. Free memory was 106.5 MB in the beginning and 96.5 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2019-08-05 10:21:02,726 INFO L168 Benchmark]: TraceAbstraction took 240557.38 ms. Allocated memory was 133.2 MB in the beginning and 896.0 MB in the end (delta: 762.8 MB). Free memory was 96.1 MB in the beginning and 768.5 MB in the end (delta: -672.4 MB). Peak memory consumption was 90.5 MB. Max. memory is 7.1 GB. [2019-08-05 10:21:02,729 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 133.2 MB. Free memory was 110.8 MB in the beginning and 110.6 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 35.42 ms. Allocated memory is still 133.2 MB. Free memory was 109.3 MB in the beginning and 107.7 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 20.50 ms. Allocated memory is still 133.2 MB. Free memory was 107.7 MB in the beginning and 106.5 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 334.00 ms. Allocated memory is still 133.2 MB. Free memory was 106.5 MB in the beginning and 96.5 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 240557.38 ms. Allocated memory was 133.2 MB in the beginning and 896.0 MB in the end (delta: 762.8 MB). Free memory was 96.1 MB in the beginning and 768.5 MB in the end (delta: -672.4 MB). Peak memory consumption was 90.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 66]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 66). Cancelled while BasicCegarLoop was constructing difference of abstraction (168states) and FLOYD_HOARE automaton (currently 67 states, 112 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 122 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. TIMEOUT Result, 240.4s OverallTime, 109 OverallIterations, 55 TraceHistogramMax, 127.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 381 SDtfs, 742 SDslu, 2370 SDs, 0 SdLazy, 74824 SolverSat, 6036 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 46.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12273 GetRequests, 4565 SyntacticMatches, 0 SemanticMatches, 7707 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136169 ImplicationChecksByTransitivity, 171.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=168occurred in iteration=108, 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, 108 MinimizatonAttempts, 216 StatesRemovedByMinimization, 54 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 3.8s SatisfiabilityAnalysisTime, 108.0s InterpolantComputationTime, 9347 NumberOfCodeBlocks, 9347 NumberOfCodeBlocksAsserted, 109 NumberOfCheckSat, 9238 ConstructedInterpolants, 0 QuantifiedInterpolants, 3049412 SizeOfPredicates, 327 NumberOfNonLiveVariables, 46299 ConjunctsInSsa, 6376 ConjunctsInUnsatCore, 109 InterpolantComputations, 2 PerfectInterpolantSequences, 83160/163350 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown