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/abstractInterpretation/regression/non_con/loop-procedure.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:13:58,679 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:13:58,681 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:13:58,693 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:13:58,693 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:13:58,694 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:13:58,695 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:13:58,697 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:13:58,699 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:13:58,700 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:13:58,701 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:13:58,702 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:13:58,702 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:13:58,703 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:13:58,704 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:13:58,705 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:13:58,706 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:13:58,707 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:13:58,709 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:13:58,711 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:13:58,712 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:13:58,714 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:13:58,715 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:13:58,716 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:13:58,718 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:13:58,718 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:13:58,719 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:13:58,720 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:13:58,720 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:13:58,721 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:13:58,721 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:13:58,722 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:13:58,723 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:13:58,724 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:13:58,725 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:13:58,725 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:13:58,726 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:13:58,726 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:13:58,727 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:13:58,728 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:13:58,728 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:13:58,777 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:13:58,795 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:13:58,799 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:13:58,800 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:13:58,801 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:13:58,802 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/abstractInterpretation/regression/non_con/loop-procedure.bpl [2019-08-05 11:13:58,802 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/abstractInterpretation/regression/non_con/loop-procedure.bpl' [2019-08-05 11:13:58,839 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:13:58,840 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:13:58,841 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:13:58,841 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:13:58,841 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:13:58,857 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "loop-procedure.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:13:58" (1/1) ... [2019-08-05 11:13:58,867 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "loop-procedure.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:13:58" (1/1) ... [2019-08-05 11:13:58,888 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:13:58,889 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:13:58,889 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:13:58,889 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:13:58,901 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "loop-procedure.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:13:58" (1/1) ... [2019-08-05 11:13:58,901 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "loop-procedure.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:13:58" (1/1) ... [2019-08-05 11:13:58,902 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "loop-procedure.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:13:58" (1/1) ... [2019-08-05 11:13:58,902 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "loop-procedure.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:13:58" (1/1) ... [2019-08-05 11:13:58,904 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "loop-procedure.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:13:58" (1/1) ... [2019-08-05 11:13:58,908 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "loop-procedure.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:13:58" (1/1) ... [2019-08-05 11:13:58,909 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "loop-procedure.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:13:58" (1/1) ... [2019-08-05 11:13:58,911 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:13:58,911 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:13:58,912 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:13:58,912 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:13:58,913 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "loop-procedure.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:13:58" (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 11:13:58,983 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-08-05 11:13:58,984 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 11:13:58,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 11:13:59,520 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 11:13:59,520 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-08-05 11:13:59,522 INFO L202 PluginConnector]: Adding new model loop-procedure.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:13:59 BoogieIcfgContainer [2019-08-05 11:13:59,522 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:13:59,524 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:13:59,524 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:13:59,527 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:13:59,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "loop-procedure.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:13:58" (1/2) ... [2019-08-05 11:13:59,529 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ba676b2 and model type loop-procedure.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:13:59, skipping insertion in model container [2019-08-05 11:13:59,529 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "loop-procedure.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:13:59" (2/2) ... [2019-08-05 11:13:59,531 INFO L109 eAbstractionObserver]: Analyzing ICFG loop-procedure.bpl [2019-08-05 11:13:59,541 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:13:59,549 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 11:13:59,564 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 11:13:59,585 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:13:59,586 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:13:59,586 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:13:59,587 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:13:59,587 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:13:59,587 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:13:59,587 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:13:59,587 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:13:59,588 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:13:59,600 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-08-05 11:13:59,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 11:13:59,608 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:59,609 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 11:13:59,612 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:59,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:59,618 INFO L82 PathProgramCache]: Analyzing trace with hash 936847, now seen corresponding path program 1 times [2019-08-05 11:13:59,668 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:59,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:59,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 11:13:59,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:59,761 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 11:13:59,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:13:59,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:13:59,769 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:13:59,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:13:59,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:13:59,786 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2019-08-05 11:13:59,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:59,893 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2019-08-05 11:13:59,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:13:59,895 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-08-05 11:13:59,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:59,908 INFO L225 Difference]: With dead ends: 8 [2019-08-05 11:13:59,909 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 11:13:59,912 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:13:59,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 11:13:59,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 11:13:59,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 11:13:59,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-08-05 11:13:59,940 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 4 [2019-08-05 11:13:59,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:59,941 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-08-05 11:13:59,941 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:13:59,941 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-08-05 11:13:59,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 11:13:59,942 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:59,942 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-05 11:13:59,942 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:59,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:59,943 INFO L82 PathProgramCache]: Analyzing trace with hash 921170266, now seen corresponding path program 1 times [2019-08-05 11:13:59,944 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:59,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:59,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 11:13:59,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:59,999 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:00,049 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:14:00,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:00,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 11:14:00,052 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:14:00,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:14:00,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:14:00,053 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 4 states. [2019-08-05 11:14:00,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:00,109 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-08-05 11:14:00,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:14:00,110 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-08-05 11:14:00,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:00,111 INFO L225 Difference]: With dead ends: 9 [2019-08-05 11:14:00,111 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 11:14:00,112 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:14:00,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 11:14:00,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 11:14:00,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 11:14:00,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-08-05 11:14:00,115 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2019-08-05 11:14:00,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:00,115 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-08-05 11:14:00,115 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:14:00,116 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2019-08-05 11:14:00,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 11:14:00,116 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:00,116 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2019-08-05 11:14:00,117 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:00,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:00,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1121577839, now seen corresponding path program 2 times [2019-08-05 11:14:00,118 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:00,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:00,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 11:14:00,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:00,160 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:00,196 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:00,242 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-08-05 11:14:00,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:00,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 11:14:00,243 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:14:00,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:14:00,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:14:00,244 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 5 states. [2019-08-05 11:14:00,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:00,370 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2019-08-05 11:14:00,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:14:00,370 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-08-05 11:14:00,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:00,371 INFO L225 Difference]: With dead ends: 11 [2019-08-05 11:14:00,371 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 11:14:00,372 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:14:00,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 11:14:00,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 11:14:00,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 11:14:00,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2019-08-05 11:14:00,375 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 8 [2019-08-05 11:14:00,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:00,375 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-08-05 11:14:00,375 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:14:00,375 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2019-08-05 11:14:00,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 11:14:00,376 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:00,376 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1] [2019-08-05 11:14:00,376 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:00,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:00,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1835107718, now seen corresponding path program 3 times [2019-08-05 11:14:00,378 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:00,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:00,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 11:14:00,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:00,431 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:00,466 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:00,577 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:00,676 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 11:14:00,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:00,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 11:14:00,677 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:14:00,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:14:00,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:14:00,678 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 6 states. [2019-08-05 11:14:00,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:00,747 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2019-08-05 11:14:00,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 11:14:00,748 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-08-05 11:14:00,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:00,749 INFO L225 Difference]: With dead ends: 13 [2019-08-05 11:14:00,749 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 11:14:00,750 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:14:00,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 11:14:00,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 11:14:00,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 11:14:00,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-08-05 11:14:00,753 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2019-08-05 11:14:00,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:00,753 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-08-05 11:14:00,753 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:14:00,753 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-08-05 11:14:00,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 11:14:00,754 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:00,754 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1] [2019-08-05 11:14:00,755 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:00,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:00,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1741982897, now seen corresponding path program 4 times [2019-08-05 11:14:00,756 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:00,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:00,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:14:00,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:00,838 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:00,877 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:00,949 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:00,989 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:01,017 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-08-05 11:14:01,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:01,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 11:14:01,018 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:14:01,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:14:01,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:14:01,019 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 7 states. [2019-08-05 11:14:01,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:01,163 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2019-08-05 11:14:01,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:14:01,164 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-08-05 11:14:01,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:01,164 INFO L225 Difference]: With dead ends: 15 [2019-08-05 11:14:01,165 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 11:14:01,165 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:14:01,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 11:14:01,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 11:14:01,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 11:14:01,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-08-05 11:14:01,168 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2019-08-05 11:14:01,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:01,169 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-08-05 11:14:01,169 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:14:01,169 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2019-08-05 11:14:01,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 11:14:01,170 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:01,170 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1] [2019-08-05 11:14:01,170 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:01,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:01,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1873648538, now seen corresponding path program 5 times [2019-08-05 11:14:01,172 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:01,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:01,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 11:14:01,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:01,226 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:01,281 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:01,301 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:01,324 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:01,375 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:01,406 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-08-05 11:14:01,406 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:01,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:14:01,407 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 11:14:01,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 11:14:01,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:14:01,408 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 8 states. [2019-08-05 11:14:01,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:01,506 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2019-08-05 11:14:01,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 11:14:01,507 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-08-05 11:14:01,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:01,508 INFO L225 Difference]: With dead ends: 17 [2019-08-05 11:14:01,509 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 11:14:01,510 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:14:01,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 11:14:01,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 11:14:01,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 11:14:01,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-08-05 11:14:01,514 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 14 [2019-08-05 11:14:01,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:01,514 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-08-05 11:14:01,514 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 11:14:01,514 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-08-05 11:14:01,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 11:14:01,515 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:01,515 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1] [2019-08-05 11:14:01,515 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:01,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:01,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1745296593, now seen corresponding path program 6 times [2019-08-05 11:14:01,517 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:01,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:01,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:14:01,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:01,591 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:01,619 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:01,658 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:01,681 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:01,851 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:02,027 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:02,092 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-08-05 11:14:02,093 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:02,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 11:14:02,093 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:14:02,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:14:02,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:14:02,094 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 9 states. [2019-08-05 11:14:02,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:02,194 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2019-08-05 11:14:02,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 11:14:02,195 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2019-08-05 11:14:02,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:02,195 INFO L225 Difference]: With dead ends: 19 [2019-08-05 11:14:02,196 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 11:14:02,196 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:14:02,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 11:14:02,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 11:14:02,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 11:14:02,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2019-08-05 11:14:02,199 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 16 [2019-08-05 11:14:02,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:02,199 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-08-05 11:14:02,200 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:14:02,200 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2019-08-05 11:14:02,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 11:14:02,201 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:02,201 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1] [2019-08-05 11:14:02,202 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:02,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:02,202 INFO L82 PathProgramCache]: Analyzing trace with hash -937470790, now seen corresponding path program 7 times [2019-08-05 11:14:02,203 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:02,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:02,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 11:14:02,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:02,295 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:02,346 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:02,367 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:02,387 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:02,477 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:02,508 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:02,547 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:02,571 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-08-05 11:14:02,572 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:02,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:14:02,572 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 11:14:02,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 11:14:02,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:14:02,573 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 10 states. [2019-08-05 11:14:02,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:02,653 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2019-08-05 11:14:02,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 11:14:02,655 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2019-08-05 11:14:02,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:02,656 INFO L225 Difference]: With dead ends: 21 [2019-08-05 11:14:02,656 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 11:14:02,657 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:14:02,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 11:14:02,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-05 11:14:02,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 11:14:02,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-08-05 11:14:02,660 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 18 [2019-08-05 11:14:02,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:02,661 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-08-05 11:14:02,661 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 11:14:02,661 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-08-05 11:14:02,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 11:14:02,662 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:02,662 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1] [2019-08-05 11:14:02,662 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:02,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:02,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1287142159, now seen corresponding path program 8 times [2019-08-05 11:14:02,664 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:02,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:02,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 11:14:02,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:02,745 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:02,782 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:02,799 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:02,827 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:02,866 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:02,895 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:02,915 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:02,927 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:02,947 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-08-05 11:14:02,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:02,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 11:14:02,948 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 11:14:02,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 11:14:02,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:14:02,949 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 11 states. [2019-08-05 11:14:03,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:03,062 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2019-08-05 11:14:03,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 11:14:03,062 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2019-08-05 11:14:03,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:03,063 INFO L225 Difference]: With dead ends: 23 [2019-08-05 11:14:03,063 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 11:14:03,064 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:14:03,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 11:14:03,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-05 11:14:03,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 11:14:03,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-08-05 11:14:03,069 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 20 [2019-08-05 11:14:03,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:03,070 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-08-05 11:14:03,070 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 11:14:03,070 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-08-05 11:14:03,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 11:14:03,071 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:03,071 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1] [2019-08-05 11:14:03,071 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:03,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:03,071 INFO L82 PathProgramCache]: Analyzing trace with hash -746740262, now seen corresponding path program 9 times [2019-08-05 11:14:03,072 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:03,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:03,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:14:03,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:03,140 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:03,176 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:03,186 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:03,375 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:03,582 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:03,682 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:03,698 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:03,718 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:03,799 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:03,858 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-08-05 11:14:03,859 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:03,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 11:14:03,859 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 11:14:03,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 11:14:03,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:14:03,860 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 12 states. [2019-08-05 11:14:04,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:04,009 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2019-08-05 11:14:04,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 11:14:04,010 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2019-08-05 11:14:04,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:04,011 INFO L225 Difference]: With dead ends: 25 [2019-08-05 11:14:04,011 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 11:14:04,012 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:14:04,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 11:14:04,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-05 11:14:04,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 11:14:04,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-08-05 11:14:04,016 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 22 [2019-08-05 11:14:04,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:04,016 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-08-05 11:14:04,016 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 11:14:04,016 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2019-08-05 11:14:04,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 11:14:04,017 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:04,017 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1] [2019-08-05 11:14:04,017 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:04,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:04,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1822459153, now seen corresponding path program 10 times [2019-08-05 11:14:04,019 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:04,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:04,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 11:14:04,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:04,083 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:04,113 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:04,128 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:04,143 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:04,220 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:04,236 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:04,276 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:04,305 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:04,317 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:04,361 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:04,374 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-08-05 11:14:04,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:04,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 11:14:04,375 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 11:14:04,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 11:14:04,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:14:04,376 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 13 states. [2019-08-05 11:14:04,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:04,702 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2019-08-05 11:14:04,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 11:14:04,702 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2019-08-05 11:14:04,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:04,704 INFO L225 Difference]: With dead ends: 27 [2019-08-05 11:14:04,704 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 11:14:04,705 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:14:04,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 11:14:04,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-08-05 11:14:04,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 11:14:04,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-08-05 11:14:04,708 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2019-08-05 11:14:04,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:04,709 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-08-05 11:14:04,709 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 11:14:04,709 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-08-05 11:14:04,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 11:14:04,710 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:04,710 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1] [2019-08-05 11:14:04,710 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:04,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:04,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1496150278, now seen corresponding path program 11 times [2019-08-05 11:14:04,712 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:04,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:04,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 11:14:04,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:04,772 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:04,806 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:04,817 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:04,898 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:04,910 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:04,964 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:04,979 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:04,991 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:05,011 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:05,032 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:05,053 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:05,087 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-08-05 11:14:05,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:05,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 11:14:05,088 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 11:14:05,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 11:14:05,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:14:05,089 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 14 states. [2019-08-05 11:14:05,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:05,202 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2019-08-05 11:14:05,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 11:14:05,203 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2019-08-05 11:14:05,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:05,204 INFO L225 Difference]: With dead ends: 29 [2019-08-05 11:14:05,204 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 11:14:05,205 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:14:05,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 11:14:05,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-05 11:14:05,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 11:14:05,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-08-05 11:14:05,208 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 26 [2019-08-05 11:14:05,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:05,209 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-08-05 11:14:05,209 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 11:14:05,209 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-08-05 11:14:05,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 11:14:05,210 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:05,210 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1] [2019-08-05 11:14:05,210 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:05,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:05,210 INFO L82 PathProgramCache]: Analyzing trace with hash 2070192847, now seen corresponding path program 12 times [2019-08-05 11:14:05,211 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:05,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:05,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 11:14:05,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:05,279 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:05,327 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:05,339 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:05,346 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:05,354 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:05,367 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:05,379 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:05,391 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:05,414 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:05,427 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:05,456 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:05,473 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:05,493 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-08-05 11:14:05,494 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:05,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 11:14:05,494 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:14:05,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:14:05,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:14:05,495 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 15 states. [2019-08-05 11:14:05,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:05,573 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2019-08-05 11:14:05,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:14:05,573 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2019-08-05 11:14:05,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:05,575 INFO L225 Difference]: With dead ends: 31 [2019-08-05 11:14:05,575 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 11:14:05,576 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:14:05,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 11:14:05,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-05 11:14:05,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 11:14:05,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2019-08-05 11:14:05,581 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 28 [2019-08-05 11:14:05,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:05,581 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2019-08-05 11:14:05,581 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:14:05,581 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2019-08-05 11:14:05,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 11:14:05,582 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:05,582 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1] [2019-08-05 11:14:05,583 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:05,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:05,583 INFO L82 PathProgramCache]: Analyzing trace with hash -727183334, now seen corresponding path program 13 times [2019-08-05 11:14:05,584 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:05,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:05,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 11:14:05,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:05,637 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:05,648 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:05,654 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:05,661 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:05,681 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:05,689 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:05,718 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:05,727 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:05,762 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:05,791 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:05,822 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:05,835 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:05,856 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:05,897 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-08-05 11:14:05,897 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:05,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:14:05,898 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 11:14:05,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 11:14:05,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:14:05,899 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 16 states. [2019-08-05 11:14:06,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:06,001 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2019-08-05 11:14:06,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 11:14:06,002 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2019-08-05 11:14:06,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:06,003 INFO L225 Difference]: With dead ends: 33 [2019-08-05 11:14:06,003 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 11:14:06,004 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:14:06,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 11:14:06,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-08-05 11:14:06,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 11:14:06,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2019-08-05 11:14:06,007 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 30 [2019-08-05 11:14:06,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:06,008 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2019-08-05 11:14:06,008 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 11:14:06,008 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2019-08-05 11:14:06,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 11:14:06,009 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:06,009 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1] [2019-08-05 11:14:06,009 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:06,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:06,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1497517393, now seen corresponding path program 14 times [2019-08-05 11:14:06,010 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:06,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:06,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 11:14:06,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:06,098 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:06,235 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:06,267 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:06,434 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:06,620 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:06,754 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:06,763 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:06,773 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:06,885 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:06,938 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:06,987 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:07,011 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:07,029 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:07,047 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:07,135 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-08-05 11:14:07,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:07,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 11:14:07,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:14:07,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:14:07,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:14:07,137 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 17 states. [2019-08-05 11:14:07,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:07,275 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2019-08-05 11:14:07,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:14:07,275 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2019-08-05 11:14:07,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:07,276 INFO L225 Difference]: With dead ends: 35 [2019-08-05 11:14:07,276 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 11:14:07,276 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:14:07,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 11:14:07,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-05 11:14:07,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 11:14:07,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-08-05 11:14:07,279 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 32 [2019-08-05 11:14:07,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:07,280 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-08-05 11:14:07,280 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:14:07,280 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-08-05 11:14:07,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 11:14:07,281 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:07,281 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1] [2019-08-05 11:14:07,281 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:07,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:07,282 INFO L82 PathProgramCache]: Analyzing trace with hash 218638650, now seen corresponding path program 15 times [2019-08-05 11:14:07,282 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:07,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:07,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-05 11:14:07,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:07,378 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:07,510 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:07,665 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:07,847 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:07,962 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:08,196 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:08,354 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:08,364 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:08,405 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:08,417 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:08,437 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:08,449 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:08,468 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:08,488 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:08,531 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:08,551 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-08-05 11:14:08,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:08,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:14:08,552 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 11:14:08,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 11:14:08,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:14:08,553 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 18 states. [2019-08-05 11:14:08,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:08,649 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2019-08-05 11:14:08,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 11:14:08,650 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 34 [2019-08-05 11:14:08,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:08,651 INFO L225 Difference]: With dead ends: 37 [2019-08-05 11:14:08,651 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 11:14:08,652 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:14:08,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 11:14:08,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-05 11:14:08,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 11:14:08,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2019-08-05 11:14:08,658 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 34 [2019-08-05 11:14:08,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:08,659 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2019-08-05 11:14:08,659 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 11:14:08,659 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2019-08-05 11:14:08,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 11:14:08,660 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:08,660 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1] [2019-08-05 11:14:08,661 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:08,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:08,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1444894065, now seen corresponding path program 16 times [2019-08-05 11:14:08,662 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:08,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:08,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 11:14:08,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:08,724 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:08,764 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:08,774 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:08,783 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:08,792 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:08,915 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:08,929 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:08,946 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:08,959 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:08,970 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:08,982 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:08,999 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:09,092 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:09,113 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:09,131 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:09,148 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:09,168 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-08-05 11:14:09,168 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:09,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 11:14:09,169 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:14:09,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:14:09,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:14:09,170 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 19 states. [2019-08-05 11:14:09,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:09,259 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2019-08-05 11:14:09,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:14:09,260 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2019-08-05 11:14:09,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:09,261 INFO L225 Difference]: With dead ends: 39 [2019-08-05 11:14:09,261 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 11:14:09,262 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:14:09,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 11:14:09,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-08-05 11:14:09,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 11:14:09,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2019-08-05 11:14:09,266 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 36 [2019-08-05 11:14:09,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:09,266 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2019-08-05 11:14:09,266 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:14:09,266 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2019-08-05 11:14:09,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 11:14:09,267 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:09,267 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1] [2019-08-05 11:14:09,267 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:09,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:09,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1115891110, now seen corresponding path program 17 times [2019-08-05 11:14:09,268 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:09,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:09,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-05 11:14:09,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:09,384 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:09,460 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:09,489 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:09,495 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:09,505 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:09,513 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:09,526 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:09,535 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:09,546 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:09,557 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:09,569 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:09,582 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:09,596 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:09,611 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:09,628 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:09,644 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:09,662 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:09,683 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-08-05 11:14:09,684 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:09,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:14:09,685 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 11:14:09,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 11:14:09,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:14:09,685 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 20 states. [2019-08-05 11:14:09,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:09,806 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2019-08-05 11:14:09,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 11:14:09,806 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 38 [2019-08-05 11:14:09,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:09,807 INFO L225 Difference]: With dead ends: 41 [2019-08-05 11:14:09,808 INFO L226 Difference]: Without dead ends: 41 [2019-08-05 11:14:09,808 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:14:09,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-05 11:14:09,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-08-05 11:14:09,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 11:14:09,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2019-08-05 11:14:09,813 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 38 [2019-08-05 11:14:09,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:09,813 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2019-08-05 11:14:09,813 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 11:14:09,813 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-08-05 11:14:09,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 11:14:09,814 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:09,814 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1] [2019-08-05 11:14:09,814 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:09,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:09,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1807977071, now seen corresponding path program 18 times [2019-08-05 11:14:09,815 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:09,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:09,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-05 11:14:09,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:09,900 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:09,944 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:09,949 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:09,957 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:09,964 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:09,974 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:09,994 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:10,003 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:10,015 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:10,028 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:10,041 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:10,102 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:10,264 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:10,277 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:10,294 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:10,311 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:10,363 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:10,449 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:10,472 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-08-05 11:14:10,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:10,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 11:14:10,473 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:14:10,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:14:10,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:14:10,474 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 21 states. [2019-08-05 11:14:10,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:10,687 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2019-08-05 11:14:10,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:14:10,687 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 40 [2019-08-05 11:14:10,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:10,688 INFO L225 Difference]: With dead ends: 43 [2019-08-05 11:14:10,688 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 11:14:10,688 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:14:10,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 11:14:10,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-05 11:14:10,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 11:14:10,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2019-08-05 11:14:10,691 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 40 [2019-08-05 11:14:10,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:10,691 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2019-08-05 11:14:10,691 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:14:10,691 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2019-08-05 11:14:10,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 11:14:10,692 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:10,692 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1] [2019-08-05 11:14:10,693 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:10,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:10,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1324342406, now seen corresponding path program 19 times [2019-08-05 11:14:10,694 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:10,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:10,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 11:14:10,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:10,773 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:10,802 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:10,832 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:10,839 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:10,850 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:10,906 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:10,920 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:10,932 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:10,948 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:10,960 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:10,972 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:10,989 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:11,008 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:11,028 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:11,046 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:11,067 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:11,087 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:11,123 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:11,140 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:11,161 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-08-05 11:14:11,161 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:11,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:14:11,162 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 11:14:11,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 11:14:11,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:14:11,162 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 22 states. [2019-08-05 11:14:11,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:11,236 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2019-08-05 11:14:11,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 11:14:11,237 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 42 [2019-08-05 11:14:11,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:11,238 INFO L225 Difference]: With dead ends: 45 [2019-08-05 11:14:11,238 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 11:14:11,239 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:14:11,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 11:14:11,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-05 11:14:11,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 11:14:11,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2019-08-05 11:14:11,244 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 42 [2019-08-05 11:14:11,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:11,244 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2019-08-05 11:14:11,244 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 11:14:11,244 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2019-08-05 11:14:11,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 11:14:11,245 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:11,245 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1] [2019-08-05 11:14:11,245 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:11,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:11,245 INFO L82 PathProgramCache]: Analyzing trace with hash -2049158577, now seen corresponding path program 20 times [2019-08-05 11:14:11,246 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:11,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:11,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-05 11:14:11,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:11,320 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:11,404 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:11,414 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:11,421 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:11,428 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:11,436 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:11,446 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:11,590 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:11,599 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:11,610 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:11,622 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:11,635 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:11,674 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:11,687 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:11,701 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:11,715 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:11,735 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:11,751 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:11,768 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:11,786 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:11,809 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-08-05 11:14:11,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:11,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 11:14:11,810 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:14:11,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:14:11,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:14:11,811 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 23 states. [2019-08-05 11:14:11,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:11,894 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2019-08-05 11:14:11,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:14:11,900 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2019-08-05 11:14:11,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:11,900 INFO L225 Difference]: With dead ends: 47 [2019-08-05 11:14:11,900 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 11:14:11,901 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:14:11,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 11:14:11,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-08-05 11:14:11,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 11:14:11,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2019-08-05 11:14:11,904 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 44 [2019-08-05 11:14:11,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:11,904 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2019-08-05 11:14:11,904 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:14:11,904 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2019-08-05 11:14:11,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 11:14:11,905 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:11,905 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1] [2019-08-05 11:14:11,905 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:11,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:11,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1337195366, now seen corresponding path program 21 times [2019-08-05 11:14:11,906 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:11,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:11,932 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-05 11:14:11,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:11,983 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:12,083 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:12,095 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:12,103 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:12,124 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:12,133 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:12,143 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:12,152 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:12,162 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:12,177 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:12,220 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:12,278 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:12,341 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:12,387 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:12,456 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:12,500 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:12,537 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:12,861 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:12,878 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:12,896 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:12,927 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:12,960 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-08-05 11:14:12,960 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:12,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:14:12,961 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 11:14:12,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 11:14:12,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:14:12,963 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 24 states. [2019-08-05 11:14:13,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:13,059 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2019-08-05 11:14:13,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 11:14:13,060 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 46 [2019-08-05 11:14:13,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:13,061 INFO L225 Difference]: With dead ends: 49 [2019-08-05 11:14:13,061 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 11:14:13,062 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:14:13,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 11:14:13,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-08-05 11:14:13,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 11:14:13,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2019-08-05 11:14:13,064 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 46 [2019-08-05 11:14:13,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:13,064 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2019-08-05 11:14:13,064 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 11:14:13,065 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2019-08-05 11:14:13,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 11:14:13,065 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:13,065 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1] [2019-08-05 11:14:13,066 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:13,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:13,066 INFO L82 PathProgramCache]: Analyzing trace with hash -1541340625, now seen corresponding path program 22 times [2019-08-05 11:14:13,067 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:13,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:13,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-05 11:14:13,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:13,143 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:13,270 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:13,398 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:13,411 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:13,418 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:13,428 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:13,437 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:13,448 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:13,458 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:13,469 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:13,485 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:13,497 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:13,512 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:13,545 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:13,561 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:13,577 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:13,594 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:13,610 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:13,642 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:13,661 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:13,681 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:13,700 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:13,725 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-08-05 11:14:13,725 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:13,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 11:14:13,726 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:14:13,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:14:13,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:14:13,726 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 25 states. [2019-08-05 11:14:13,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:13,844 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2019-08-05 11:14:13,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:14:13,844 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 48 [2019-08-05 11:14:13,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:13,845 INFO L225 Difference]: With dead ends: 51 [2019-08-05 11:14:13,845 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 11:14:13,846 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:14:13,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 11:14:13,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-08-05 11:14:13,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 11:14:13,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2019-08-05 11:14:13,849 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 48 [2019-08-05 11:14:13,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:13,849 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2019-08-05 11:14:13,849 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:14:13,850 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2019-08-05 11:14:13,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 11:14:13,850 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:13,850 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1] [2019-08-05 11:14:13,850 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:13,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:13,851 INFO L82 PathProgramCache]: Analyzing trace with hash 557481402, now seen corresponding path program 23 times [2019-08-05 11:14:13,851 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:13,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:13,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 71 conjunts are in the unsatisfiable core [2019-08-05 11:14:13,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:13,921 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:13,944 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:13,950 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:13,962 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:13,971 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:13,979 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:13,988 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:13,998 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:14,008 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:14,020 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:14,032 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:14,046 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:14,059 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:14,072 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:14,086 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:14,100 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:14,116 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:14,132 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:14,151 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:14,205 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:14,222 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:14,240 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:14,260 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:14,297 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-08-05 11:14:14,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:14,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:14:14,297 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 11:14:14,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 11:14:14,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:14:14,298 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 26 states. [2019-08-05 11:14:14,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:14,400 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2019-08-05 11:14:14,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 11:14:14,400 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 50 [2019-08-05 11:14:14,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:14,401 INFO L225 Difference]: With dead ends: 53 [2019-08-05 11:14:14,401 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 11:14:14,402 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:14:14,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 11:14:14,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-08-05 11:14:14,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 11:14:14,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2019-08-05 11:14:14,404 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 50 [2019-08-05 11:14:14,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:14,405 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2019-08-05 11:14:14,405 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 11:14:14,405 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2019-08-05 11:14:14,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 11:14:14,405 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:14,405 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1] [2019-08-05 11:14:14,405 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:14,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:14,406 INFO L82 PathProgramCache]: Analyzing trace with hash -452486641, now seen corresponding path program 24 times [2019-08-05 11:14:14,406 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:14,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:14,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-05 11:14:14,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:14,473 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:14,496 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:14,508 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:14,514 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:14,522 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:14,652 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:14,662 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:14,673 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:14,683 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:14,693 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:14,705 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:14,720 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:14,764 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:14,776 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:14,791 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:14,809 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:14,824 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:14,840 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:14,858 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:14,875 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:14,910 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:14,929 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:15,124 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:15,148 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:15,174 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-08-05 11:14:15,175 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:15,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 11:14:15,175 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:14:15,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:14:15,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:14:15,176 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 27 states. [2019-08-05 11:14:15,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:15,283 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2019-08-05 11:14:15,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:14:15,284 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 52 [2019-08-05 11:14:15,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:15,284 INFO L225 Difference]: With dead ends: 55 [2019-08-05 11:14:15,285 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 11:14:15,286 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:14:15,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 11:14:15,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-08-05 11:14:15,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 11:14:15,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2019-08-05 11:14:15,289 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 52 [2019-08-05 11:14:15,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:15,289 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2019-08-05 11:14:15,289 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:14:15,289 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2019-08-05 11:14:15,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:14:15,290 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:15,290 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1] [2019-08-05 11:14:15,290 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:15,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:15,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1486516518, now seen corresponding path program 25 times [2019-08-05 11:14:15,291 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:15,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:15,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 77 conjunts are in the unsatisfiable core [2019-08-05 11:14:15,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:15,368 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:15,425 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:15,438 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:15,503 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:15,511 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:15,520 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:15,529 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:15,540 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:15,550 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:15,561 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:15,578 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:15,591 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:15,603 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:15,617 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:15,633 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:15,648 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:15,664 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:15,680 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:15,697 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:15,716 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:15,737 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:15,760 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:15,782 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:15,803 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:15,971 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:15,996 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-08-05 11:14:15,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:15,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:14:15,996 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 11:14:15,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 11:14:15,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:14:15,998 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 28 states. [2019-08-05 11:14:16,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:16,157 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2019-08-05 11:14:16,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 11:14:16,157 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 54 [2019-08-05 11:14:16,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:16,158 INFO L225 Difference]: With dead ends: 57 [2019-08-05 11:14:16,158 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 11:14:16,159 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:14:16,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 11:14:16,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-08-05 11:14:16,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 11:14:16,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2019-08-05 11:14:16,162 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 54 [2019-08-05 11:14:16,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:16,163 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2019-08-05 11:14:16,163 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 11:14:16,163 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2019-08-05 11:14:16,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-05 11:14:16,164 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:16,164 INFO L399 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1] [2019-08-05 11:14:16,164 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:16,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:16,164 INFO L82 PathProgramCache]: Analyzing trace with hash 965089775, now seen corresponding path program 26 times [2019-08-05 11:14:16,165 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:16,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:16,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 80 conjunts are in the unsatisfiable core [2019-08-05 11:14:16,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:16,248 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:16,384 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:16,446 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:16,453 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:16,462 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:16,470 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:16,480 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:16,489 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:16,500 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:16,513 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:16,524 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:16,537 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:16,549 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:16,565 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:16,578 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:16,593 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:16,610 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:16,627 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:16,645 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:16,662 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:16,690 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:16,708 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:16,728 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:16,749 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:16,852 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:17,353 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:17,461 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-08-05 11:14:17,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:17,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 11:14:17,461 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:14:17,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:14:17,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:14:17,462 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 29 states. [2019-08-05 11:14:17,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:17,633 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2019-08-05 11:14:17,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:14:17,634 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 56 [2019-08-05 11:14:17,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:17,635 INFO L225 Difference]: With dead ends: 59 [2019-08-05 11:14:17,635 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 11:14:17,636 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:14:17,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 11:14:17,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-08-05 11:14:17,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 11:14:17,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2019-08-05 11:14:17,638 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 56 [2019-08-05 11:14:17,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:17,639 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2019-08-05 11:14:17,639 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:14:17,639 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2019-08-05 11:14:17,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 11:14:17,639 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:17,640 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1] [2019-08-05 11:14:17,640 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:17,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:17,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1009305606, now seen corresponding path program 27 times [2019-08-05 11:14:17,641 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:17,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:17,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 137 conjunts are in the unsatisfiable core [2019-08-05 11:14:17,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:18,166 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2019-08-05 11:14:18,166 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:18,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:14:18,167 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 11:14:18,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 11:14:18,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2019-08-05 11:14:18,168 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 30 states. [2019-08-05 11:14:19,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:19,453 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2019-08-05 11:14:19,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 11:14:19,453 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 58 [2019-08-05 11:14:19,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:19,454 INFO L225 Difference]: With dead ends: 61 [2019-08-05 11:14:19,454 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 11:14:19,455 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2019-08-05 11:14:19,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 11:14:19,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-08-05 11:14:19,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 11:14:19,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2019-08-05 11:14:19,458 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 58 [2019-08-05 11:14:19,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:19,458 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2019-08-05 11:14:19,458 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 11:14:19,458 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2019-08-05 11:14:19,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 11:14:19,459 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:19,459 INFO L399 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1] [2019-08-05 11:14:19,459 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:19,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:19,459 INFO L82 PathProgramCache]: Analyzing trace with hash -988642865, now seen corresponding path program 28 times [2019-08-05 11:14:19,460 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:19,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:19,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 142 conjunts are in the unsatisfiable core [2019-08-05 11:14:19,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:20,467 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-08-05 11:14:20,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:20,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 11:14:20,468 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 11:14:20,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 11:14:20,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2019-08-05 11:14:20,468 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 31 states. [2019-08-05 11:14:21,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:21,748 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2019-08-05 11:14:21,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 11:14:21,748 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 60 [2019-08-05 11:14:21,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:21,749 INFO L225 Difference]: With dead ends: 63 [2019-08-05 11:14:21,749 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 11:14:21,750 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2019-08-05 11:14:21,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 11:14:21,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-08-05 11:14:21,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 11:14:21,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2019-08-05 11:14:21,753 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 60 [2019-08-05 11:14:21,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:21,753 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2019-08-05 11:14:21,754 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 11:14:21,754 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2019-08-05 11:14:21,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-05 11:14:21,754 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:21,754 INFO L399 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1] [2019-08-05 11:14:21,754 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:21,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:21,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1964603674, now seen corresponding path program 29 times [2019-08-05 11:14:21,755 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:21,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:21,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 147 conjunts are in the unsatisfiable core [2019-08-05 11:14:21,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:22,234 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2019-08-05 11:14:22,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:22,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 11:14:22,235 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 11:14:22,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 11:14:22,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:14:22,235 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 32 states. [2019-08-05 11:14:24,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:24,357 INFO L93 Difference]: Finished difference Result 65 states and 66 transitions. [2019-08-05 11:14:24,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 11:14:24,358 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 62 [2019-08-05 11:14:24,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:24,359 INFO L225 Difference]: With dead ends: 65 [2019-08-05 11:14:24,359 INFO L226 Difference]: Without dead ends: 65 [2019-08-05 11:14:24,360 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:14:24,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-05 11:14:24,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-08-05 11:14:24,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 11:14:24,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2019-08-05 11:14:24,362 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 62 [2019-08-05 11:14:24,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:24,363 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2019-08-05 11:14:24,363 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 11:14:24,363 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2019-08-05 11:14:24,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-05 11:14:24,363 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:24,363 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1] [2019-08-05 11:14:24,363 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:24,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:24,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1034080687, now seen corresponding path program 30 times [2019-08-05 11:14:24,364 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:24,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:24,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 152 conjunts are in the unsatisfiable core [2019-08-05 11:14:24,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:24,919 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-08-05 11:14:24,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:24,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 11:14:24,919 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 11:14:24,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 11:14:24,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 11:14:24,920 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 33 states. [2019-08-05 11:14:26,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:26,295 INFO L93 Difference]: Finished difference Result 67 states and 68 transitions. [2019-08-05 11:14:26,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 11:14:26,296 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 64 [2019-08-05 11:14:26,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:26,297 INFO L225 Difference]: With dead ends: 67 [2019-08-05 11:14:26,297 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 11:14:26,298 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 11:14:26,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 11:14:26,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-08-05 11:14:26,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 11:14:26,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2019-08-05 11:14:26,300 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 64 [2019-08-05 11:14:26,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:26,301 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2019-08-05 11:14:26,301 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 11:14:26,301 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2019-08-05 11:14:26,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-05 11:14:26,301 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:26,301 INFO L399 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1] [2019-08-05 11:14:26,302 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:26,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:26,302 INFO L82 PathProgramCache]: Analyzing trace with hash -684305862, now seen corresponding path program 31 times [2019-08-05 11:14:26,303 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:26,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:26,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 157 conjunts are in the unsatisfiable core [2019-08-05 11:14:26,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:26,839 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2019-08-05 11:14:26,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:26,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 11:14:26,840 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 11:14:26,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 11:14:26,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1026, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 11:14:26,841 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 34 states. [2019-08-05 11:14:28,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:28,497 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2019-08-05 11:14:28,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 11:14:28,498 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 66 [2019-08-05 11:14:28,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:28,498 INFO L225 Difference]: With dead ends: 69 [2019-08-05 11:14:28,499 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 11:14:28,500 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=96, Invalid=1026, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 11:14:28,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 11:14:28,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-08-05 11:14:28,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 11:14:28,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2019-08-05 11:14:28,502 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 66 [2019-08-05 11:14:28,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:28,503 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2019-08-05 11:14:28,503 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 11:14:28,503 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2019-08-05 11:14:28,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:14:28,503 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:28,504 INFO L399 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1] [2019-08-05 11:14:28,504 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:28,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:28,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1269631375, now seen corresponding path program 32 times [2019-08-05 11:14:28,505 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:28,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:28,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 162 conjunts are in the unsatisfiable core [2019-08-05 11:14:28,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:29,391 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-08-05 11:14:29,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:29,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 11:14:29,392 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 11:14:29,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 11:14:29,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:14:29,393 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 35 states. [2019-08-05 11:14:30,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:30,948 INFO L93 Difference]: Finished difference Result 71 states and 72 transitions. [2019-08-05 11:14:30,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 11:14:30,948 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 68 [2019-08-05 11:14:30,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:30,949 INFO L225 Difference]: With dead ends: 71 [2019-08-05 11:14:30,949 INFO L226 Difference]: Without dead ends: 71 [2019-08-05 11:14:30,951 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:14:30,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-05 11:14:30,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-08-05 11:14:30,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 11:14:30,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2019-08-05 11:14:30,953 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 68 [2019-08-05 11:14:30,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:30,953 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2019-08-05 11:14:30,953 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 11:14:30,954 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2019-08-05 11:14:30,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 11:14:30,954 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:30,954 INFO L399 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1] [2019-08-05 11:14:30,954 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:30,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:30,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1011367078, now seen corresponding path program 33 times [2019-08-05 11:14:30,955 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:30,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:30,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 167 conjunts are in the unsatisfiable core [2019-08-05 11:14:30,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:31,576 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2019-08-05 11:14:31,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:31,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 11:14:31,577 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 11:14:31,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 11:14:31,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1158, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 11:14:31,578 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 36 states. [2019-08-05 11:14:33,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:33,397 INFO L93 Difference]: Finished difference Result 73 states and 74 transitions. [2019-08-05 11:14:33,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 11:14:33,398 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 70 [2019-08-05 11:14:33,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:33,399 INFO L225 Difference]: With dead ends: 73 [2019-08-05 11:14:33,399 INFO L226 Difference]: Without dead ends: 73 [2019-08-05 11:14:33,400 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=102, Invalid=1158, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 11:14:33,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-05 11:14:33,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-08-05 11:14:33,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 11:14:33,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2019-08-05 11:14:33,402 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 70 [2019-08-05 11:14:33,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:33,403 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2019-08-05 11:14:33,403 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 11:14:33,403 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2019-08-05 11:14:33,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-05 11:14:33,403 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:33,403 INFO L399 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1] [2019-08-05 11:14:33,404 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:33,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:33,404 INFO L82 PathProgramCache]: Analyzing trace with hash -366532241, now seen corresponding path program 34 times [2019-08-05 11:14:33,405 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:33,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:33,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 172 conjunts are in the unsatisfiable core [2019-08-05 11:14:33,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:34,372 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-08-05 11:14:34,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:34,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 11:14:34,373 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 11:14:34,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 11:14:34,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1227, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 11:14:34,373 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 37 states. [2019-08-05 11:14:36,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:36,118 INFO L93 Difference]: Finished difference Result 75 states and 76 transitions. [2019-08-05 11:14:36,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 11:14:36,118 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 72 [2019-08-05 11:14:36,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:36,119 INFO L225 Difference]: With dead ends: 75 [2019-08-05 11:14:36,119 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 11:14:36,120 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=105, Invalid=1227, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 11:14:36,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 11:14:36,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-08-05 11:14:36,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 11:14:36,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2019-08-05 11:14:36,123 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 72 [2019-08-05 11:14:36,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:36,123 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2019-08-05 11:14:36,123 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 11:14:36,123 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2019-08-05 11:14:36,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-05 11:14:36,124 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:36,124 INFO L399 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1, 1] [2019-08-05 11:14:36,124 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:36,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:36,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1906822266, now seen corresponding path program 35 times [2019-08-05 11:14:36,125 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:36,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:36,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 177 conjunts are in the unsatisfiable core [2019-08-05 11:14:36,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:37,044 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-08-05 11:14:37,044 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:37,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 11:14:37,045 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 11:14:37,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 11:14:37,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1298, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:14:37,045 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 38 states. [2019-08-05 11:14:39,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:39,030 INFO L93 Difference]: Finished difference Result 77 states and 78 transitions. [2019-08-05 11:14:39,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 11:14:39,031 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 74 [2019-08-05 11:14:39,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:39,032 INFO L225 Difference]: With dead ends: 77 [2019-08-05 11:14:39,032 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 11:14:39,033 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=108, Invalid=1298, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:14:39,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 11:14:39,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-08-05 11:14:39,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 11:14:39,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2019-08-05 11:14:39,035 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 74 [2019-08-05 11:14:39,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:39,035 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2019-08-05 11:14:39,035 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 11:14:39,036 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2019-08-05 11:14:39,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-05 11:14:39,036 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:39,036 INFO L399 BasicCegarLoop]: trace histogram [36, 36, 1, 1, 1, 1] [2019-08-05 11:14:39,036 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:39,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:39,037 INFO L82 PathProgramCache]: Analyzing trace with hash -964218545, now seen corresponding path program 36 times [2019-08-05 11:14:39,037 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:39,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:39,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 182 conjunts are in the unsatisfiable core [2019-08-05 11:14:39,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:39,696 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2019-08-05 11:14:39,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:39,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 11:14:39,697 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 11:14:39,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 11:14:39,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1371, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:14:39,697 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 39 states. [2019-08-05 11:14:41,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:41,639 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2019-08-05 11:14:41,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 11:14:41,640 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 76 [2019-08-05 11:14:41,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:41,641 INFO L225 Difference]: With dead ends: 79 [2019-08-05 11:14:41,641 INFO L226 Difference]: Without dead ends: 79 [2019-08-05 11:14:41,642 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=111, Invalid=1371, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:14:41,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-05 11:14:41,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-08-05 11:14:41,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 11:14:41,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2019-08-05 11:14:41,644 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 76 [2019-08-05 11:14:41,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:41,644 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2019-08-05 11:14:41,644 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 11:14:41,644 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2019-08-05 11:14:41,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-05 11:14:41,645 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:41,645 INFO L399 BasicCegarLoop]: trace histogram [37, 37, 1, 1, 1, 1] [2019-08-05 11:14:41,645 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:41,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:41,646 INFO L82 PathProgramCache]: Analyzing trace with hash 361786778, now seen corresponding path program 37 times [2019-08-05 11:14:41,646 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:41,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:41,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 187 conjunts are in the unsatisfiable core [2019-08-05 11:14:41,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:42,368 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2019-08-05 11:14:42,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:42,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 11:14:42,368 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 11:14:42,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 11:14:42,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1446, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 11:14:42,369 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 40 states. [2019-08-05 11:14:44,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:44,505 INFO L93 Difference]: Finished difference Result 81 states and 82 transitions. [2019-08-05 11:14:44,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 11:14:44,505 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 78 [2019-08-05 11:14:44,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:44,506 INFO L225 Difference]: With dead ends: 81 [2019-08-05 11:14:44,507 INFO L226 Difference]: Without dead ends: 81 [2019-08-05 11:14:44,508 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=114, Invalid=1446, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 11:14:44,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-08-05 11:14:44,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-08-05 11:14:44,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 11:14:44,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2019-08-05 11:14:44,510 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 78 [2019-08-05 11:14:44,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:44,510 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2019-08-05 11:14:44,510 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 11:14:44,511 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2019-08-05 11:14:44,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-08-05 11:14:44,511 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:44,511 INFO L399 BasicCegarLoop]: trace histogram [38, 38, 1, 1, 1, 1] [2019-08-05 11:14:44,512 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:44,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:44,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1597824721, now seen corresponding path program 38 times [2019-08-05 11:14:44,513 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:44,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:44,562 INFO L256 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 192 conjunts are in the unsatisfiable core [2019-08-05 11:14:44,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:45,392 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2019-08-05 11:14:45,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:45,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 11:14:45,393 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 11:14:45,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 11:14:45,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1523, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:14:45,393 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 41 states. [2019-08-05 11:14:47,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:47,566 INFO L93 Difference]: Finished difference Result 83 states and 84 transitions. [2019-08-05 11:14:47,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 11:14:47,566 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 80 [2019-08-05 11:14:47,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:47,567 INFO L225 Difference]: With dead ends: 83 [2019-08-05 11:14:47,567 INFO L226 Difference]: Without dead ends: 83 [2019-08-05 11:14:47,568 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=117, Invalid=1523, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:14:47,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-08-05 11:14:47,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-08-05 11:14:47,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-05 11:14:47,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2019-08-05 11:14:47,572 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 80 [2019-08-05 11:14:47,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:47,572 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2019-08-05 11:14:47,572 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 11:14:47,572 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2019-08-05 11:14:47,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-08-05 11:14:47,573 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:47,573 INFO L399 BasicCegarLoop]: trace histogram [39, 39, 1, 1, 1, 1] [2019-08-05 11:14:47,573 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:47,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:47,573 INFO L82 PathProgramCache]: Analyzing trace with hash -2122602822, now seen corresponding path program 39 times [2019-08-05 11:14:47,574 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:47,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:47,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 197 conjunts are in the unsatisfiable core [2019-08-05 11:14:47,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:48,777 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2019-08-05 11:14:48,778 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:48,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 11:14:48,778 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 11:14:48,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 11:14:48,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1602, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:14:48,779 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 42 states. [2019-08-05 11:14:51,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:51,071 INFO L93 Difference]: Finished difference Result 85 states and 86 transitions. [2019-08-05 11:14:51,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 11:14:51,072 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 82 [2019-08-05 11:14:51,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:51,073 INFO L225 Difference]: With dead ends: 85 [2019-08-05 11:14:51,073 INFO L226 Difference]: Without dead ends: 85 [2019-08-05 11:14:51,074 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=120, Invalid=1602, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:14:51,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-08-05 11:14:51,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-08-05 11:14:51,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-05 11:14:51,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2019-08-05 11:14:51,078 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 82 [2019-08-05 11:14:51,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:51,078 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2019-08-05 11:14:51,078 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 11:14:51,078 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2019-08-05 11:14:51,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-08-05 11:14:51,079 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:51,079 INFO L399 BasicCegarLoop]: trace histogram [40, 40, 1, 1, 1, 1] [2019-08-05 11:14:51,079 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:51,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:51,079 INFO L82 PathProgramCache]: Analyzing trace with hash -1420756721, now seen corresponding path program 40 times [2019-08-05 11:14:51,080 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:51,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:51,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 202 conjunts are in the unsatisfiable core [2019-08-05 11:14:51,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:52,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2019-08-05 11:14:52,375 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:52,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 11:14:52,375 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 11:14:52,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 11:14:52,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1683, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:14:52,376 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 43 states. [2019-08-05 11:14:54,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:54,903 INFO L93 Difference]: Finished difference Result 87 states and 88 transitions. [2019-08-05 11:14:54,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 11:14:54,904 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 84 [2019-08-05 11:14:54,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:54,905 INFO L225 Difference]: With dead ends: 87 [2019-08-05 11:14:54,905 INFO L226 Difference]: Without dead ends: 87 [2019-08-05 11:14:54,906 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=123, Invalid=1683, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:14:54,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-08-05 11:14:54,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-08-05 11:14:54,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-08-05 11:14:54,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2019-08-05 11:14:54,909 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 84 [2019-08-05 11:14:54,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:54,910 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2019-08-05 11:14:54,910 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 11:14:54,910 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2019-08-05 11:14:54,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-08-05 11:14:54,910 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:54,910 INFO L399 BasicCegarLoop]: trace histogram [41, 41, 1, 1, 1, 1] [2019-08-05 11:14:54,911 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:54,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:54,911 INFO L82 PathProgramCache]: Analyzing trace with hash -990677030, now seen corresponding path program 41 times [2019-08-05 11:14:54,912 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:54,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:54,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 207 conjunts are in the unsatisfiable core [2019-08-05 11:14:54,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:56,340 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2019-08-05 11:14:56,340 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:56,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 11:14:56,341 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 11:14:56,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 11:14:56,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1766, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 11:14:56,342 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 44 states. [2019-08-05 11:14:59,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:59,044 INFO L93 Difference]: Finished difference Result 89 states and 90 transitions. [2019-08-05 11:14:59,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 11:14:59,044 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 86 [2019-08-05 11:14:59,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:59,045 INFO L225 Difference]: With dead ends: 89 [2019-08-05 11:14:59,046 INFO L226 Difference]: Without dead ends: 89 [2019-08-05 11:14:59,047 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=126, Invalid=1766, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 11:14:59,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-08-05 11:14:59,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-08-05 11:14:59,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-08-05 11:14:59,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2019-08-05 11:14:59,049 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 86 [2019-08-05 11:14:59,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:59,050 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2019-08-05 11:14:59,050 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 11:14:59,050 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2019-08-05 11:14:59,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-08-05 11:14:59,050 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:59,050 INFO L399 BasicCegarLoop]: trace histogram [42, 42, 1, 1, 1, 1] [2019-08-05 11:14:59,051 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:59,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:59,051 INFO L82 PathProgramCache]: Analyzing trace with hash -349783825, now seen corresponding path program 42 times [2019-08-05 11:14:59,051 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:59,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:59,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 212 conjunts are in the unsatisfiable core [2019-08-05 11:14:59,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:00,302 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2019-08-05 11:15:00,302 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:00,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 11:15:00,303 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 11:15:00,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 11:15:00,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1851, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 11:15:00,304 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 45 states. [2019-08-05 11:15:03,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:03,006 INFO L93 Difference]: Finished difference Result 91 states and 92 transitions. [2019-08-05 11:15:03,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 11:15:03,006 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 88 [2019-08-05 11:15:03,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:03,007 INFO L225 Difference]: With dead ends: 91 [2019-08-05 11:15:03,008 INFO L226 Difference]: Without dead ends: 91 [2019-08-05 11:15:03,009 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=129, Invalid=1851, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 11:15:03,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-08-05 11:15:03,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-08-05 11:15:03,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-08-05 11:15:03,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2019-08-05 11:15:03,012 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 88 [2019-08-05 11:15:03,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:03,012 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2019-08-05 11:15:03,013 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 11:15:03,013 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2019-08-05 11:15:03,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-08-05 11:15:03,013 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:03,013 INFO L399 BasicCegarLoop]: trace histogram [43, 43, 1, 1, 1, 1] [2019-08-05 11:15:03,014 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:03,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:03,014 INFO L82 PathProgramCache]: Analyzing trace with hash -855514886, now seen corresponding path program 43 times [2019-08-05 11:15:03,015 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:03,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:03,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 217 conjunts are in the unsatisfiable core [2019-08-05 11:15:03,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:04,292 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2019-08-05 11:15:04,292 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:04,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 11:15:04,293 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 11:15:04,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 11:15:04,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1938, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 11:15:04,294 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 46 states. [2019-08-05 11:15:07,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:07,040 INFO L93 Difference]: Finished difference Result 93 states and 94 transitions. [2019-08-05 11:15:07,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 11:15:07,041 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 90 [2019-08-05 11:15:07,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:07,041 INFO L225 Difference]: With dead ends: 93 [2019-08-05 11:15:07,042 INFO L226 Difference]: Without dead ends: 93 [2019-08-05 11:15:07,042 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=132, Invalid=1938, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 11:15:07,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-08-05 11:15:07,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-08-05 11:15:07,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-08-05 11:15:07,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2019-08-05 11:15:07,044 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 90 [2019-08-05 11:15:07,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:07,045 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2019-08-05 11:15:07,045 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 11:15:07,045 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2019-08-05 11:15:07,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-08-05 11:15:07,045 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:07,045 INFO L399 BasicCegarLoop]: trace histogram [44, 44, 1, 1, 1, 1] [2019-08-05 11:15:07,045 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:07,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:07,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1749393201, now seen corresponding path program 44 times [2019-08-05 11:15:07,046 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:07,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:07,078 INFO L256 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 222 conjunts are in the unsatisfiable core [2019-08-05 11:15:07,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:08,001 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-08-05 11:15:08,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:08,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 11:15:08,002 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 11:15:08,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 11:15:08,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=2027, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 11:15:08,003 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand 47 states. [2019-08-05 11:15:11,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:11,034 INFO L93 Difference]: Finished difference Result 95 states and 96 transitions. [2019-08-05 11:15:11,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 11:15:11,035 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 92 [2019-08-05 11:15:11,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:11,036 INFO L225 Difference]: With dead ends: 95 [2019-08-05 11:15:11,036 INFO L226 Difference]: Without dead ends: 95 [2019-08-05 11:15:11,036 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=135, Invalid=2027, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 11:15:11,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-08-05 11:15:11,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-08-05 11:15:11,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-08-05 11:15:11,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2019-08-05 11:15:11,042 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 92 [2019-08-05 11:15:11,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:11,042 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2019-08-05 11:15:11,042 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 11:15:11,042 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2019-08-05 11:15:11,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-08-05 11:15:11,043 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:11,043 INFO L399 BasicCegarLoop]: trace histogram [45, 45, 1, 1, 1, 1] [2019-08-05 11:15:11,043 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:11,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:11,044 INFO L82 PathProgramCache]: Analyzing trace with hash 70312474, now seen corresponding path program 45 times [2019-08-05 11:15:11,044 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:11,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:11,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 549 conjuncts, 227 conjunts are in the unsatisfiable core [2019-08-05 11:15:11,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:12,084 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2019-08-05 11:15:12,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:12,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 11:15:12,085 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 11:15:12,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 11:15:12,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=2118, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 11:15:12,086 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 48 states. [2019-08-05 11:15:15,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:15,216 INFO L93 Difference]: Finished difference Result 97 states and 98 transitions. [2019-08-05 11:15:15,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 11:15:15,217 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 94 [2019-08-05 11:15:15,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:15,217 INFO L225 Difference]: With dead ends: 97 [2019-08-05 11:15:15,218 INFO L226 Difference]: Without dead ends: 97 [2019-08-05 11:15:15,218 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=138, Invalid=2118, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 11:15:15,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-08-05 11:15:15,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-08-05 11:15:15,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-08-05 11:15:15,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2019-08-05 11:15:15,221 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 94 [2019-08-05 11:15:15,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:15,221 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2019-08-05 11:15:15,221 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 11:15:15,222 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2019-08-05 11:15:15,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-08-05 11:15:15,222 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:15,222 INFO L399 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1] [2019-08-05 11:15:15,223 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:15,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:15,223 INFO L82 PathProgramCache]: Analyzing trace with hash 2063724719, now seen corresponding path program 46 times [2019-08-05 11:15:15,223 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:15,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:15,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 561 conjuncts, 232 conjunts are in the unsatisfiable core [2019-08-05 11:15:15,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:16,207 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-08-05 11:15:16,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:16,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 11:15:16,208 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 11:15:16,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 11:15:16,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=2211, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 11:15:16,209 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 49 states. [2019-08-05 11:15:19,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:19,481 INFO L93 Difference]: Finished difference Result 99 states and 100 transitions. [2019-08-05 11:15:19,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 11:15:19,482 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 96 [2019-08-05 11:15:19,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:19,483 INFO L225 Difference]: With dead ends: 99 [2019-08-05 11:15:19,483 INFO L226 Difference]: Without dead ends: 99 [2019-08-05 11:15:19,483 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=141, Invalid=2211, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 11:15:19,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-08-05 11:15:19,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-08-05 11:15:19,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 11:15:19,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2019-08-05 11:15:19,486 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 96 [2019-08-05 11:15:19,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:19,486 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2019-08-05 11:15:19,487 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 11:15:19,487 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2019-08-05 11:15:19,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-08-05 11:15:19,487 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:19,487 INFO L399 BasicCegarLoop]: trace histogram [47, 47, 1, 1, 1, 1] [2019-08-05 11:15:19,487 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:19,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:19,488 INFO L82 PathProgramCache]: Analyzing trace with hash -225805510, now seen corresponding path program 47 times [2019-08-05 11:15:19,488 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:19,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:19,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 237 conjunts are in the unsatisfiable core [2019-08-05 11:15:19,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:20,600 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2019-08-05 11:15:20,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:20,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 11:15:20,601 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 11:15:20,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 11:15:20,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=2306, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 11:15:20,602 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 50 states. [2019-08-05 11:15:23,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:23,911 INFO L93 Difference]: Finished difference Result 101 states and 102 transitions. [2019-08-05 11:15:23,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 11:15:23,912 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 98 [2019-08-05 11:15:23,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:23,912 INFO L225 Difference]: With dead ends: 101 [2019-08-05 11:15:23,913 INFO L226 Difference]: Without dead ends: 101 [2019-08-05 11:15:23,913 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=144, Invalid=2306, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 11:15:23,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-08-05 11:15:23,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-08-05 11:15:23,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-08-05 11:15:23,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 102 transitions. [2019-08-05 11:15:23,915 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 102 transitions. Word has length 98 [2019-08-05 11:15:23,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:23,916 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 102 transitions. [2019-08-05 11:15:23,916 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 11:15:23,916 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 102 transitions. [2019-08-05 11:15:23,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-08-05 11:15:23,916 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:23,916 INFO L399 BasicCegarLoop]: trace histogram [48, 48, 1, 1, 1, 1] [2019-08-05 11:15:23,916 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:23,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:23,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1366517903, now seen corresponding path program 48 times [2019-08-05 11:15:23,917 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:23,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:23,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 585 conjuncts, 242 conjunts are in the unsatisfiable core [2019-08-05 11:15:23,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:25,087 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2019-08-05 11:15:25,087 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:25,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 11:15:25,088 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 11:15:25,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 11:15:25,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=2403, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 11:15:25,088 INFO L87 Difference]: Start difference. First operand 101 states and 102 transitions. Second operand 51 states. [2019-08-05 11:15:28,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:28,476 INFO L93 Difference]: Finished difference Result 103 states and 104 transitions. [2019-08-05 11:15:28,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 11:15:28,477 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 100 [2019-08-05 11:15:28,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:28,478 INFO L225 Difference]: With dead ends: 103 [2019-08-05 11:15:28,478 INFO L226 Difference]: Without dead ends: 103 [2019-08-05 11:15:28,479 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=147, Invalid=2403, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 11:15:28,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-08-05 11:15:28,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-08-05 11:15:28,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-05 11:15:28,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2019-08-05 11:15:28,482 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 100 [2019-08-05 11:15:28,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:28,482 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2019-08-05 11:15:28,482 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 11:15:28,482 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2019-08-05 11:15:28,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-08-05 11:15:28,483 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:28,483 INFO L399 BasicCegarLoop]: trace histogram [49, 49, 1, 1, 1, 1] [2019-08-05 11:15:28,483 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:28,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:28,484 INFO L82 PathProgramCache]: Analyzing trace with hash -577196966, now seen corresponding path program 49 times [2019-08-05 11:15:28,484 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:28,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:28,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 597 conjuncts, 247 conjunts are in the unsatisfiable core [2019-08-05 11:15:28,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:29,883 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-08-05 11:15:29,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:29,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 11:15:29,884 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 11:15:29,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 11:15:29,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=2502, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 11:15:29,885 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 52 states. [2019-08-05 11:15:33,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:33,432 INFO L93 Difference]: Finished difference Result 105 states and 106 transitions. [2019-08-05 11:15:33,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 11:15:33,432 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 102 [2019-08-05 11:15:33,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:33,433 INFO L225 Difference]: With dead ends: 105 [2019-08-05 11:15:33,433 INFO L226 Difference]: Without dead ends: 105 [2019-08-05 11:15:33,434 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=150, Invalid=2502, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 11:15:33,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-08-05 11:15:33,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-08-05 11:15:33,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 11:15:33,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2019-08-05 11:15:33,437 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 102 [2019-08-05 11:15:33,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:33,437 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2019-08-05 11:15:33,438 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 11:15:33,438 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2019-08-05 11:15:33,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-08-05 11:15:33,438 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:33,439 INFO L399 BasicCegarLoop]: trace histogram [50, 50, 1, 1, 1, 1] [2019-08-05 11:15:33,439 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:33,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:33,439 INFO L82 PathProgramCache]: Analyzing trace with hash 704956527, now seen corresponding path program 50 times [2019-08-05 11:15:33,440 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:33,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:33,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 609 conjuncts, 252 conjunts are in the unsatisfiable core [2019-08-05 11:15:33,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:35,037 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2019-08-05 11:15:35,037 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:35,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 11:15:35,038 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 11:15:35,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 11:15:35,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=2603, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 11:15:35,039 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 53 states. [2019-08-05 11:15:39,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:39,841 INFO L93 Difference]: Finished difference Result 107 states and 108 transitions. [2019-08-05 11:15:39,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 11:15:39,841 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 104 [2019-08-05 11:15:39,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:39,843 INFO L225 Difference]: With dead ends: 107 [2019-08-05 11:15:39,843 INFO L226 Difference]: Without dead ends: 107 [2019-08-05 11:15:39,845 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=153, Invalid=2603, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 11:15:39,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-08-05 11:15:39,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-08-05 11:15:39,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-05 11:15:39,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2019-08-05 11:15:39,848 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 104 [2019-08-05 11:15:39,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:39,848 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2019-08-05 11:15:39,848 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 11:15:39,848 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2019-08-05 11:15:39,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-08-05 11:15:39,849 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:39,849 INFO L399 BasicCegarLoop]: trace histogram [51, 51, 1, 1, 1, 1] [2019-08-05 11:15:39,849 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:39,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:39,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1751479674, now seen corresponding path program 51 times [2019-08-05 11:15:39,850 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:39,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:39,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 621 conjuncts, 257 conjunts are in the unsatisfiable core [2019-08-05 11:15:39,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:41,079 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2019-08-05 11:15:41,079 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:41,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 11:15:41,080 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 11:15:41,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 11:15:41,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=2706, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 11:15:41,081 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 54 states. [2019-08-05 11:15:45,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:45,053 INFO L93 Difference]: Finished difference Result 109 states and 110 transitions. [2019-08-05 11:15:45,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 11:15:45,053 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 106 [2019-08-05 11:15:45,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:45,054 INFO L225 Difference]: With dead ends: 109 [2019-08-05 11:15:45,054 INFO L226 Difference]: Without dead ends: 109 [2019-08-05 11:15:45,055 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=156, Invalid=2706, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 11:15:45,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-08-05 11:15:45,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-08-05 11:15:45,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 11:15:45,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2019-08-05 11:15:45,059 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 106 [2019-08-05 11:15:45,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:45,059 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2019-08-05 11:15:45,059 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 11:15:45,059 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2019-08-05 11:15:45,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-08-05 11:15:45,060 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:45,060 INFO L399 BasicCegarLoop]: trace histogram [52, 52, 1, 1, 1, 1] [2019-08-05 11:15:45,060 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:45,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:45,061 INFO L82 PathProgramCache]: Analyzing trace with hash -970190769, now seen corresponding path program 52 times [2019-08-05 11:15:45,061 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:45,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:45,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 633 conjuncts, 262 conjunts are in the unsatisfiable core [2019-08-05 11:15:45,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:46,629 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2019-08-05 11:15:46,629 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:46,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 11:15:46,630 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 11:15:46,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 11:15:46,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=2811, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 11:15:46,630 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 55 states. [2019-08-05 11:15:50,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:50,800 INFO L93 Difference]: Finished difference Result 111 states and 112 transitions. [2019-08-05 11:15:50,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 11:15:50,805 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 108 [2019-08-05 11:15:50,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:50,805 INFO L225 Difference]: With dead ends: 111 [2019-08-05 11:15:50,805 INFO L226 Difference]: Without dead ends: 111 [2019-08-05 11:15:50,806 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=159, Invalid=2811, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 11:15:50,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-08-05 11:15:50,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-08-05 11:15:50,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-08-05 11:15:50,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2019-08-05 11:15:50,809 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 108 [2019-08-05 11:15:50,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:50,809 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2019-08-05 11:15:50,809 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 11:15:50,809 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2019-08-05 11:15:50,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-08-05 11:15:50,810 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:50,810 INFO L399 BasicCegarLoop]: trace histogram [53, 53, 1, 1, 1, 1] [2019-08-05 11:15:50,810 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:50,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:50,811 INFO L82 PathProgramCache]: Analyzing trace with hash 863688346, now seen corresponding path program 53 times [2019-08-05 11:15:50,811 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:50,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:50,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 645 conjuncts, 267 conjunts are in the unsatisfiable core [2019-08-05 11:15:50,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:52,122 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2019-08-05 11:15:52,122 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:52,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 11:15:52,122 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 11:15:52,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 11:15:52,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=2918, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 11:15:52,123 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand 56 states. [2019-08-05 11:15:56,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:56,425 INFO L93 Difference]: Finished difference Result 113 states and 114 transitions. [2019-08-05 11:15:56,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 11:15:56,426 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 110 [2019-08-05 11:15:56,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:56,427 INFO L225 Difference]: With dead ends: 113 [2019-08-05 11:15:56,427 INFO L226 Difference]: Without dead ends: 113 [2019-08-05 11:15:56,427 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=162, Invalid=2918, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 11:15:56,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-08-05 11:15:56,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-08-05 11:15:56,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 11:15:56,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 114 transitions. [2019-08-05 11:15:56,430 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 114 transitions. Word has length 110 [2019-08-05 11:15:56,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:56,430 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 114 transitions. [2019-08-05 11:15:56,430 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 11:15:56,430 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 114 transitions. [2019-08-05 11:15:56,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-08-05 11:15:56,431 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:56,431 INFO L399 BasicCegarLoop]: trace histogram [54, 54, 1, 1, 1, 1] [2019-08-05 11:15:56,431 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:56,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:56,431 INFO L82 PathProgramCache]: Analyzing trace with hash -102809553, now seen corresponding path program 54 times [2019-08-05 11:15:56,432 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:56,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:56,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 657 conjuncts, 272 conjunts are in the unsatisfiable core [2019-08-05 11:15:56,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:57,780 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2019-08-05 11:15:57,780 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:57,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 11:15:57,780 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 11:15:57,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 11:15:57,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=3027, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 11:15:57,781 INFO L87 Difference]: Start difference. First operand 113 states and 114 transitions. Second operand 57 states. [2019-08-05 11:16:02,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:02,341 INFO L93 Difference]: Finished difference Result 115 states and 116 transitions. [2019-08-05 11:16:02,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 11:16:02,342 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 112 [2019-08-05 11:16:02,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:02,343 INFO L225 Difference]: With dead ends: 115 [2019-08-05 11:16:02,343 INFO L226 Difference]: Without dead ends: 115 [2019-08-05 11:16:02,343 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=165, Invalid=3027, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 11:16:02,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-08-05 11:16:02,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2019-08-05 11:16:02,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 11:16:02,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2019-08-05 11:16:02,347 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 112 [2019-08-05 11:16:02,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:02,347 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2019-08-05 11:16:02,347 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 11:16:02,347 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2019-08-05 11:16:02,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-08-05 11:16:02,348 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:02,348 INFO L399 BasicCegarLoop]: trace histogram [55, 55, 1, 1, 1, 1] [2019-08-05 11:16:02,348 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:02,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:02,348 INFO L82 PathProgramCache]: Analyzing trace with hash 2095239098, now seen corresponding path program 55 times [2019-08-05 11:16:02,349 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:02,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:02,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 669 conjuncts, 277 conjunts are in the unsatisfiable core [2019-08-05 11:16:02,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:03,683 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2019-08-05 11:16:03,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:03,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 11:16:03,684 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 11:16:03,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 11:16:03,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=3138, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 11:16:03,685 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand 58 states. [2019-08-05 11:16:08,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:08,271 INFO L93 Difference]: Finished difference Result 117 states and 118 transitions. [2019-08-05 11:16:08,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 11:16:08,271 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 114 [2019-08-05 11:16:08,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:08,272 INFO L225 Difference]: With dead ends: 117 [2019-08-05 11:16:08,272 INFO L226 Difference]: Without dead ends: 117 [2019-08-05 11:16:08,273 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=168, Invalid=3138, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 11:16:08,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-08-05 11:16:08,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2019-08-05 11:16:08,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 11:16:08,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 118 transitions. [2019-08-05 11:16:08,276 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 118 transitions. Word has length 114 [2019-08-05 11:16:08,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:08,276 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 118 transitions. [2019-08-05 11:16:08,276 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 11:16:08,276 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 118 transitions. [2019-08-05 11:16:08,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-08-05 11:16:08,277 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:08,277 INFO L399 BasicCegarLoop]: trace histogram [56, 56, 1, 1, 1, 1] [2019-08-05 11:16:08,277 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:08,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:08,278 INFO L82 PathProgramCache]: Analyzing trace with hash 194271247, now seen corresponding path program 56 times [2019-08-05 11:16:08,278 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:08,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:08,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 681 conjuncts, 282 conjunts are in the unsatisfiable core [2019-08-05 11:16:08,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:09,667 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2019-08-05 11:16:09,668 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:09,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 11:16:09,668 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 11:16:09,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 11:16:09,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=3251, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 11:16:09,669 INFO L87 Difference]: Start difference. First operand 117 states and 118 transitions. Second operand 59 states. [2019-08-05 11:16:14,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:14,515 INFO L93 Difference]: Finished difference Result 119 states and 120 transitions. [2019-08-05 11:16:14,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 11:16:14,516 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 116 [2019-08-05 11:16:14,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:14,517 INFO L225 Difference]: With dead ends: 119 [2019-08-05 11:16:14,517 INFO L226 Difference]: Without dead ends: 119 [2019-08-05 11:16:14,517 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=171, Invalid=3251, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 11:16:14,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-08-05 11:16:14,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2019-08-05 11:16:14,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 11:16:14,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2019-08-05 11:16:14,520 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 116 [2019-08-05 11:16:14,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:14,520 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2019-08-05 11:16:14,520 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 11:16:14,520 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2019-08-05 11:16:14,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-08-05 11:16:14,520 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:14,521 INFO L399 BasicCegarLoop]: trace histogram [57, 57, 1, 1, 1, 1] [2019-08-05 11:16:14,521 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:14,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:14,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1071161126, now seen corresponding path program 57 times [2019-08-05 11:16:14,522 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:14,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:14,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 693 conjuncts, 287 conjunts are in the unsatisfiable core [2019-08-05 11:16:14,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:17,299 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2019-08-05 11:16:17,299 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:17,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 11:16:17,299 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 11:16:17,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 11:16:17,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=3366, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 11:16:17,300 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand 60 states. [2019-08-05 11:16:22,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:22,232 INFO L93 Difference]: Finished difference Result 121 states and 122 transitions. [2019-08-05 11:16:22,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 11:16:22,232 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 118 [2019-08-05 11:16:22,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:22,234 INFO L225 Difference]: With dead ends: 121 [2019-08-05 11:16:22,234 INFO L226 Difference]: Without dead ends: 121 [2019-08-05 11:16:22,234 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=174, Invalid=3366, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 11:16:22,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-08-05 11:16:22,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2019-08-05 11:16:22,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-05 11:16:22,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 122 transitions. [2019-08-05 11:16:22,237 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 122 transitions. Word has length 118 [2019-08-05 11:16:22,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:22,237 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 122 transitions. [2019-08-05 11:16:22,237 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 11:16:22,238 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2019-08-05 11:16:22,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-08-05 11:16:22,238 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:22,238 INFO L399 BasicCegarLoop]: trace histogram [58, 58, 1, 1, 1, 1] [2019-08-05 11:16:22,239 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:22,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:22,239 INFO L82 PathProgramCache]: Analyzing trace with hash 339826671, now seen corresponding path program 58 times [2019-08-05 11:16:22,240 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:22,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:22,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 705 conjuncts, 292 conjunts are in the unsatisfiable core [2019-08-05 11:16:22,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:23,729 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 1711 trivial. 0 not checked. [2019-08-05 11:16:23,729 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:23,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-05 11:16:23,729 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-05 11:16:23,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-05 11:16:23,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=3483, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 11:16:23,730 INFO L87 Difference]: Start difference. First operand 121 states and 122 transitions. Second operand 61 states. [2019-08-05 11:16:28,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:28,759 INFO L93 Difference]: Finished difference Result 123 states and 124 transitions. [2019-08-05 11:16:28,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 11:16:28,759 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 120 [2019-08-05 11:16:28,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:28,760 INFO L225 Difference]: With dead ends: 123 [2019-08-05 11:16:28,760 INFO L226 Difference]: Without dead ends: 123 [2019-08-05 11:16:28,761 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=177, Invalid=3483, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 11:16:28,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-08-05 11:16:28,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2019-08-05 11:16:28,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-08-05 11:16:28,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 124 transitions. [2019-08-05 11:16:28,764 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 124 transitions. Word has length 120 [2019-08-05 11:16:28,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:28,765 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 124 transitions. [2019-08-05 11:16:28,765 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-05 11:16:28,765 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 124 transitions. [2019-08-05 11:16:28,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-08-05 11:16:28,765 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:28,766 INFO L399 BasicCegarLoop]: trace histogram [59, 59, 1, 1, 1, 1] [2019-08-05 11:16:28,766 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:28,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:28,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1448249850, now seen corresponding path program 59 times [2019-08-05 11:16:28,767 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:28,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:28,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 717 conjuncts, 297 conjunts are in the unsatisfiable core [2019-08-05 11:16:28,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:30,800 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2019-08-05 11:16:30,801 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:30,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-05 11:16:30,801 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-05 11:16:30,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-05 11:16:30,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=3602, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 11:16:30,802 INFO L87 Difference]: Start difference. First operand 123 states and 124 transitions. Second operand 62 states. [2019-08-05 11:16:36,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:36,096 INFO L93 Difference]: Finished difference Result 125 states and 126 transitions. [2019-08-05 11:16:36,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 11:16:36,096 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 122 [2019-08-05 11:16:36,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:36,098 INFO L225 Difference]: With dead ends: 125 [2019-08-05 11:16:36,098 INFO L226 Difference]: Without dead ends: 125 [2019-08-05 11:16:36,098 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=180, Invalid=3602, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 11:16:36,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-08-05 11:16:36,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2019-08-05 11:16:36,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-08-05 11:16:36,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 126 transitions. [2019-08-05 11:16:36,101 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 126 transitions. Word has length 122 [2019-08-05 11:16:36,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:36,101 INFO L475 AbstractCegarLoop]: Abstraction has 125 states and 126 transitions. [2019-08-05 11:16:36,101 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-05 11:16:36,102 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 126 transitions. [2019-08-05 11:16:36,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-08-05 11:16:36,102 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:36,102 INFO L399 BasicCegarLoop]: trace histogram [60, 60, 1, 1, 1, 1] [2019-08-05 11:16:36,103 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:36,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:36,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1599881167, now seen corresponding path program 60 times [2019-08-05 11:16:36,104 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:36,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:36,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 729 conjuncts, 302 conjunts are in the unsatisfiable core [2019-08-05 11:16:36,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:38,663 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 1830 trivial. 0 not checked. [2019-08-05 11:16:38,663 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:38,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-05 11:16:38,664 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-05 11:16:38,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-05 11:16:38,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=3723, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 11:16:38,665 INFO L87 Difference]: Start difference. First operand 125 states and 126 transitions. Second operand 63 states. [2019-08-05 11:16:44,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:44,074 INFO L93 Difference]: Finished difference Result 127 states and 128 transitions. [2019-08-05 11:16:44,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 11:16:44,075 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 124 [2019-08-05 11:16:44,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:44,076 INFO L225 Difference]: With dead ends: 127 [2019-08-05 11:16:44,077 INFO L226 Difference]: Without dead ends: 127 [2019-08-05 11:16:44,077 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=183, Invalid=3723, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 11:16:44,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-08-05 11:16:44,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2019-08-05 11:16:44,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-08-05 11:16:44,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2019-08-05 11:16:44,080 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 124 [2019-08-05 11:16:44,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:44,080 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2019-08-05 11:16:44,080 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-05 11:16:44,081 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2019-08-05 11:16:44,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-08-05 11:16:44,081 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:44,081 INFO L399 BasicCegarLoop]: trace histogram [61, 61, 1, 1, 1, 1] [2019-08-05 11:16:44,082 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:44,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:44,082 INFO L82 PathProgramCache]: Analyzing trace with hash 367938330, now seen corresponding path program 61 times [2019-08-05 11:16:44,082 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:44,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:44,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 741 conjuncts, 307 conjunts are in the unsatisfiable core [2019-08-05 11:16:44,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:45,636 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2019-08-05 11:16:45,637 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:45,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-05 11:16:45,637 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-05 11:16:45,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-05 11:16:45,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=3846, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 11:16:45,638 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand 64 states. [2019-08-05 11:16:51,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:51,444 INFO L93 Difference]: Finished difference Result 129 states and 130 transitions. [2019-08-05 11:16:51,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-05 11:16:51,445 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 126 [2019-08-05 11:16:51,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:51,446 INFO L225 Difference]: With dead ends: 129 [2019-08-05 11:16:51,446 INFO L226 Difference]: Without dead ends: 129 [2019-08-05 11:16:51,446 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=186, Invalid=3846, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 11:16:51,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-08-05 11:16:51,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2019-08-05 11:16:51,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-08-05 11:16:51,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 130 transitions. [2019-08-05 11:16:51,450 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 130 transitions. Word has length 126 [2019-08-05 11:16:51,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:51,450 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 130 transitions. [2019-08-05 11:16:51,450 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-05 11:16:51,450 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2019-08-05 11:16:51,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-08-05 11:16:51,451 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:51,451 INFO L399 BasicCegarLoop]: trace histogram [62, 62, 1, 1, 1, 1] [2019-08-05 11:16:51,451 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:51,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:51,451 INFO L82 PathProgramCache]: Analyzing trace with hash -891613265, now seen corresponding path program 62 times [2019-08-05 11:16:51,452 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:51,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:51,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 753 conjuncts, 312 conjunts are in the unsatisfiable core [2019-08-05 11:16:51,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:53,796 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2019-08-05 11:16:53,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:53,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-05 11:16:53,797 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-05 11:16:53,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-05 11:16:53,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=3971, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 11:16:53,798 INFO L87 Difference]: Start difference. First operand 129 states and 130 transitions. Second operand 65 states. [2019-08-05 11:16:59,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:59,516 INFO L93 Difference]: Finished difference Result 131 states and 132 transitions. [2019-08-05 11:16:59,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-05 11:16:59,516 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 128 [2019-08-05 11:16:59,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:59,518 INFO L225 Difference]: With dead ends: 131 [2019-08-05 11:16:59,518 INFO L226 Difference]: Without dead ends: 131 [2019-08-05 11:16:59,518 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=189, Invalid=3971, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 11:16:59,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-08-05 11:16:59,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2019-08-05 11:16:59,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-08-05 11:16:59,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 132 transitions. [2019-08-05 11:16:59,522 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 132 transitions. Word has length 128 [2019-08-05 11:16:59,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:59,522 INFO L475 AbstractCegarLoop]: Abstraction has 131 states and 132 transitions. [2019-08-05 11:16:59,522 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-05 11:16:59,522 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 132 transitions. [2019-08-05 11:16:59,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-08-05 11:16:59,523 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:59,523 INFO L399 BasicCegarLoop]: trace histogram [63, 63, 1, 1, 1, 1] [2019-08-05 11:16:59,523 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:59,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:59,524 INFO L82 PathProgramCache]: Analyzing trace with hash -217799622, now seen corresponding path program 63 times [2019-08-05 11:16:59,524 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:59,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:59,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 765 conjuncts, 317 conjunts are in the unsatisfiable core [2019-08-05 11:16:59,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:01,299 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2019-08-05 11:17:01,299 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:01,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-05 11:17:01,300 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-05 11:17:01,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-05 11:17:01,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=4098, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 11:17:01,301 INFO L87 Difference]: Start difference. First operand 131 states and 132 transitions. Second operand 66 states. [2019-08-05 11:17:07,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:07,403 INFO L93 Difference]: Finished difference Result 133 states and 134 transitions. [2019-08-05 11:17:07,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 11:17:07,403 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 130 [2019-08-05 11:17:07,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:07,405 INFO L225 Difference]: With dead ends: 133 [2019-08-05 11:17:07,405 INFO L226 Difference]: Without dead ends: 133 [2019-08-05 11:17:07,405 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=192, Invalid=4098, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 11:17:07,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-08-05 11:17:07,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2019-08-05 11:17:07,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-08-05 11:17:07,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 134 transitions. [2019-08-05 11:17:07,409 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 134 transitions. Word has length 130 [2019-08-05 11:17:07,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:07,409 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 134 transitions. [2019-08-05 11:17:07,409 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-05 11:17:07,409 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 134 transitions. [2019-08-05 11:17:07,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-08-05 11:17:07,410 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:07,410 INFO L399 BasicCegarLoop]: trace histogram [64, 64, 1, 1, 1, 1] [2019-08-05 11:17:07,410 INFO L418 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:07,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:07,411 INFO L82 PathProgramCache]: Analyzing trace with hash 657704847, now seen corresponding path program 64 times [2019-08-05 11:17:07,411 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:07,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:07,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 777 conjuncts, 322 conjunts are in the unsatisfiable core [2019-08-05 11:17:07,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:09,209 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 2080 trivial. 0 not checked. [2019-08-05 11:17:09,209 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:09,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-05 11:17:09,209 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-05 11:17:09,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-05 11:17:09,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=4227, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 11:17:09,210 INFO L87 Difference]: Start difference. First operand 133 states and 134 transitions. Second operand 67 states. [2019-08-05 11:17:15,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:15,300 INFO L93 Difference]: Finished difference Result 135 states and 136 transitions. [2019-08-05 11:17:15,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 11:17:15,301 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 132 [2019-08-05 11:17:15,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:15,302 INFO L225 Difference]: With dead ends: 135 [2019-08-05 11:17:15,302 INFO L226 Difference]: Without dead ends: 135 [2019-08-05 11:17:15,303 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=195, Invalid=4227, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 11:17:15,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-08-05 11:17:15,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2019-08-05 11:17:15,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-08-05 11:17:15,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2019-08-05 11:17:15,305 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 132 [2019-08-05 11:17:15,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:15,306 INFO L475 AbstractCegarLoop]: Abstraction has 135 states and 136 transitions. [2019-08-05 11:17:15,306 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-05 11:17:15,306 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 136 transitions. [2019-08-05 11:17:15,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-08-05 11:17:15,307 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:15,307 INFO L399 BasicCegarLoop]: trace histogram [65, 65, 1, 1, 1, 1] [2019-08-05 11:17:15,307 INFO L418 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:15,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:15,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1625320102, now seen corresponding path program 65 times [2019-08-05 11:17:15,308 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:15,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:15,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 789 conjuncts, 327 conjunts are in the unsatisfiable core [2019-08-05 11:17:15,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:17,670 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2019-08-05 11:17:17,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:17,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-05 11:17:17,671 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-05 11:17:17,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-05 11:17:17,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=4358, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 11:17:17,672 INFO L87 Difference]: Start difference. First operand 135 states and 136 transitions. Second operand 68 states. [2019-08-05 11:17:26,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:26,229 INFO L93 Difference]: Finished difference Result 137 states and 138 transitions. [2019-08-05 11:17:26,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-05 11:17:26,229 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 134 [2019-08-05 11:17:26,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:26,230 INFO L225 Difference]: With dead ends: 137 [2019-08-05 11:17:26,230 INFO L226 Difference]: Without dead ends: 137 [2019-08-05 11:17:26,231 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=198, Invalid=4358, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 11:17:26,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-08-05 11:17:26,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2019-08-05 11:17:26,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-08-05 11:17:26,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 138 transitions. [2019-08-05 11:17:26,234 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 138 transitions. Word has length 134 [2019-08-05 11:17:26,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:26,234 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 138 transitions. [2019-08-05 11:17:26,234 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-05 11:17:26,234 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 138 transitions. [2019-08-05 11:17:26,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-08-05 11:17:26,235 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:26,235 INFO L399 BasicCegarLoop]: trace histogram [66, 66, 1, 1, 1, 1] [2019-08-05 11:17:26,235 INFO L418 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:26,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:26,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1755551889, now seen corresponding path program 66 times [2019-08-05 11:17:26,236 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:26,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:26,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 801 conjuncts, 332 conjunts are in the unsatisfiable core [2019-08-05 11:17:26,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:28,487 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 2211 trivial. 0 not checked. [2019-08-05 11:17:28,488 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:28,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-05 11:17:28,488 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-05 11:17:28,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-05 11:17:28,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=4491, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 11:17:28,489 INFO L87 Difference]: Start difference. First operand 137 states and 138 transitions. Second operand 69 states. [2019-08-05 11:17:35,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:35,010 INFO L93 Difference]: Finished difference Result 139 states and 140 transitions. [2019-08-05 11:17:35,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-05 11:17:35,010 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 136 [2019-08-05 11:17:35,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:35,011 INFO L225 Difference]: With dead ends: 139 [2019-08-05 11:17:35,012 INFO L226 Difference]: Without dead ends: 139 [2019-08-05 11:17:35,012 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=201, Invalid=4491, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 11:17:35,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-08-05 11:17:35,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2019-08-05 11:17:35,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-08-05 11:17:35,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2019-08-05 11:17:35,014 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 136 [2019-08-05 11:17:35,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:35,015 INFO L475 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2019-08-05 11:17:35,015 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-05 11:17:35,015 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2019-08-05 11:17:35,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-08-05 11:17:35,015 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:35,015 INFO L399 BasicCegarLoop]: trace histogram [67, 67, 1, 1, 1, 1] [2019-08-05 11:17:35,015 INFO L418 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:35,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:35,016 INFO L82 PathProgramCache]: Analyzing trace with hash 692657786, now seen corresponding path program 67 times [2019-08-05 11:17:35,016 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:35,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:35,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 813 conjuncts, 337 conjunts are in the unsatisfiable core [2019-08-05 11:17:35,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:36,915 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2019-08-05 11:17:36,916 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:36,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-05 11:17:36,916 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-05 11:17:36,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-05 11:17:36,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=4626, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 11:17:36,917 INFO L87 Difference]: Start difference. First operand 139 states and 140 transitions. Second operand 70 states. [2019-08-05 11:17:43,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:43,682 INFO L93 Difference]: Finished difference Result 141 states and 142 transitions. [2019-08-05 11:17:43,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-05 11:17:43,683 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 138 [2019-08-05 11:17:43,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:43,684 INFO L225 Difference]: With dead ends: 141 [2019-08-05 11:17:43,685 INFO L226 Difference]: Without dead ends: 141 [2019-08-05 11:17:43,685 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=204, Invalid=4626, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 11:17:43,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-08-05 11:17:43,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2019-08-05 11:17:43,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-08-05 11:17:43,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 142 transitions. [2019-08-05 11:17:43,688 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 142 transitions. Word has length 138 [2019-08-05 11:17:43,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:43,688 INFO L475 AbstractCegarLoop]: Abstraction has 141 states and 142 transitions. [2019-08-05 11:17:43,688 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-05 11:17:43,688 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 142 transitions. [2019-08-05 11:17:43,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-08-05 11:17:43,689 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:43,689 INFO L399 BasicCegarLoop]: trace histogram [68, 68, 1, 1, 1, 1] [2019-08-05 11:17:43,689 INFO L418 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:43,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:43,690 INFO L82 PathProgramCache]: Analyzing trace with hash -255135921, now seen corresponding path program 68 times [2019-08-05 11:17:43,690 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:43,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:43,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 825 conjuncts, 342 conjunts are in the unsatisfiable core [2019-08-05 11:17:43,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:45,748 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2019-08-05 11:17:45,748 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:45,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-05 11:17:45,748 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-05 11:17:45,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-05 11:17:45,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=4763, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 11:17:45,749 INFO L87 Difference]: Start difference. First operand 141 states and 142 transitions. Second operand 71 states. [2019-08-05 11:17:52,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:52,700 INFO L93 Difference]: Finished difference Result 143 states and 144 transitions. [2019-08-05 11:17:52,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-05 11:17:52,700 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 140 [2019-08-05 11:17:52,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:52,701 INFO L225 Difference]: With dead ends: 143 [2019-08-05 11:17:52,701 INFO L226 Difference]: Without dead ends: 143 [2019-08-05 11:17:52,701 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=207, Invalid=4763, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 11:17:52,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-08-05 11:17:52,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2019-08-05 11:17:52,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-08-05 11:17:52,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 144 transitions. [2019-08-05 11:17:52,703 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 144 transitions. Word has length 140 [2019-08-05 11:17:52,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:52,704 INFO L475 AbstractCegarLoop]: Abstraction has 143 states and 144 transitions. [2019-08-05 11:17:52,704 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-05 11:17:52,704 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 144 transitions. [2019-08-05 11:17:52,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-08-05 11:17:52,705 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:52,705 INFO L399 BasicCegarLoop]: trace histogram [69, 69, 1, 1, 1, 1] [2019-08-05 11:17:52,705 INFO L418 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:52,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:52,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1643429990, now seen corresponding path program 69 times [2019-08-05 11:17:52,706 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:52,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:52,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 837 conjuncts, 347 conjunts are in the unsatisfiable core [2019-08-05 11:17:52,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:54,727 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2019-08-05 11:17:54,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:54,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-05 11:17:54,728 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-05 11:17:54,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-05 11:17:54,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=4902, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 11:17:54,728 INFO L87 Difference]: Start difference. First operand 143 states and 144 transitions. Second operand 72 states. [2019-08-05 11:18:01,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:01,695 INFO L93 Difference]: Finished difference Result 145 states and 146 transitions. [2019-08-05 11:18:01,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-05 11:18:01,696 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 142 [2019-08-05 11:18:01,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:01,697 INFO L225 Difference]: With dead ends: 145 [2019-08-05 11:18:01,697 INFO L226 Difference]: Without dead ends: 145 [2019-08-05 11:18:01,697 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=210, Invalid=4902, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 11:18:01,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-08-05 11:18:01,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2019-08-05 11:18:01,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-08-05 11:18:01,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 146 transitions. [2019-08-05 11:18:01,699 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 146 transitions. Word has length 142 [2019-08-05 11:18:01,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:01,699 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 146 transitions. [2019-08-05 11:18:01,700 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-05 11:18:01,700 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 146 transitions. [2019-08-05 11:18:01,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-08-05 11:18:01,700 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:01,700 INFO L399 BasicCegarLoop]: trace histogram [70, 70, 1, 1, 1, 1] [2019-08-05 11:18:01,701 INFO L418 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:01,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:01,701 INFO L82 PathProgramCache]: Analyzing trace with hash 460676911, now seen corresponding path program 70 times [2019-08-05 11:18:01,702 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:01,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2019-08-05 11:18:01,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 849 conjuncts, 352 conjunts are in the unsatisfiable core [2019-08-05 11:18:01,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:01,782 WARN L196 SmtUtils]: Removed 1 from assertion stack [2019-08-05 11:18:01,782 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2019-08-05 11:18:01,783 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 11:18:01,786 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 11:18:01,786 INFO L202 PluginConnector]: Adding new model loop-procedure.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:18:01 BoogieIcfgContainer [2019-08-05 11:18:01,787 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:18:01,789 INFO L168 Benchmark]: Toolchain (without parser) took 242948.21 ms. Allocated memory was 141.0 MB in the beginning and 299.4 MB in the end (delta: 158.3 MB). Free memory was 110.7 MB in the beginning and 138.2 MB in the end (delta: -27.4 MB). Peak memory consumption was 130.9 MB. Max. memory is 7.1 GB. [2019-08-05 11:18:01,790 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 141.0 MB. Free memory was 112.0 MB in the beginning and 111.7 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-08-05 11:18:01,790 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.80 ms. Allocated memory is still 141.0 MB. Free memory was 110.7 MB in the beginning and 108.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-08-05 11:18:01,791 INFO L168 Benchmark]: Boogie Preprocessor took 21.81 ms. Allocated memory is still 141.0 MB. Free memory was 108.6 MB in the beginning and 107.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-05 11:18:01,792 INFO L168 Benchmark]: RCFGBuilder took 610.98 ms. Allocated memory is still 141.0 MB. Free memory was 107.4 MB in the beginning and 95.0 MB in the end (delta: 12.3 MB). Peak memory consumption was 12.3 MB. Max. memory is 7.1 GB. [2019-08-05 11:18:01,793 INFO L168 Benchmark]: TraceAbstraction took 242262.96 ms. Allocated memory was 141.0 MB in the beginning and 299.4 MB in the end (delta: 158.3 MB). Free memory was 94.6 MB in the beginning and 138.2 MB in the end (delta: -43.5 MB). Peak memory consumption was 114.8 MB. Max. memory is 7.1 GB. [2019-08-05 11:18:01,797 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 141.0 MB. Free memory was 112.0 MB in the beginning and 111.7 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 47.80 ms. Allocated memory is still 141.0 MB. Free memory was 110.7 MB in the beginning and 108.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 21.81 ms. Allocated memory is still 141.0 MB. Free memory was 108.6 MB in the beginning and 107.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 610.98 ms. Allocated memory is still 141.0 MB. Free memory was 107.4 MB in the beginning and 95.0 MB in the end (delta: 12.3 MB). Peak memory consumption was 12.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 242262.96 ms. Allocated memory was 141.0 MB in the beginning and 299.4 MB in the end (delta: 158.3 MB). Free memory was 94.6 MB in the beginning and 138.2 MB in the end (delta: -43.5 MB). Peak memory consumption was 114.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 19]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 19). Cancelled while BasicCegarLoop was analyzing trace of length 145 with TraceHistMax 70,while TraceCheckSpWp was constructing forward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 0ms.. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. TIMEOUT Result, 242.2s OverallTime, 71 OverallIterations, 70 TraceHistogramMax, 168.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 281 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 219289 SolverSat, 5733 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 137.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5040 GetRequests, 2555 SyntacticMatches, 0 SemanticMatches, 2485 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 68.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=145occurred in iteration=70, 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, 70 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 70.4s InterpolantComputationTime, 5110 NumberOfCodeBlocks, 5110 NumberOfCodeBlocksAsserted, 70 NumberOfCheckSat, 5040 ConstructedInterpolants, 0 QuantifiedInterpolants, 949340 SizeOfPredicates, 4830 NumberOfNonLiveVariables, 29610 ConjunctsInSsa, 11513 ConjunctsInUnsatCore, 70 InterpolantComputations, 1 PerfectInterpolantSequences, 57155/114310 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown