java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/seq.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-04 21:38:28,671 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-04 21:38:28,673 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-04 21:38:28,688 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-04 21:38:28,688 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-04 21:38:28,689 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-04 21:38:28,691 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-04 21:38:28,693 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-04 21:38:28,694 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-04 21:38:28,695 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-04 21:38:28,696 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-04 21:38:28,697 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-04 21:38:28,697 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-04 21:38:28,698 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-04 21:38:28,699 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-04 21:38:28,700 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-04 21:38:28,701 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-04 21:38:28,702 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-04 21:38:28,704 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-04 21:38:28,706 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-04 21:38:28,708 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-04 21:38:28,709 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-04 21:38:28,711 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-04 21:38:28,712 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-04 21:38:28,714 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-04 21:38:28,714 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-04 21:38:28,715 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-04 21:38:28,716 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-04 21:38:28,716 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-04 21:38:28,717 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-04 21:38:28,718 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-04 21:38:28,718 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-04 21:38:28,719 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-04 21:38:28,720 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-04 21:38:28,721 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-04 21:38:28,721 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-04 21:38:28,722 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-04 21:38:28,722 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-04 21:38:28,723 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-04 21:38:28,724 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-04 21:38:28,724 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-04 21:38:28,752 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-04 21:38:28,766 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-04 21:38:28,772 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-04 21:38:28,774 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-04 21:38:28,774 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-04 21:38:28,775 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/seq.i_4.bpl [2019-08-04 21:38:28,775 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/seq.i_4.bpl' [2019-08-04 21:38:28,831 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-04 21:38:28,833 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-04 21:38:28,834 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-04 21:38:28,834 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-04 21:38:28,834 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-04 21:38:28,852 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "seq.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:28" (1/1) ... [2019-08-04 21:38:28,863 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "seq.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:28" (1/1) ... [2019-08-04 21:38:28,873 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-04 21:38:28,874 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-04 21:38:28,874 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-04 21:38:28,874 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-04 21:38:28,885 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "seq.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:28" (1/1) ... [2019-08-04 21:38:28,886 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "seq.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:28" (1/1) ... [2019-08-04 21:38:28,887 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "seq.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:28" (1/1) ... [2019-08-04 21:38:28,887 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "seq.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:28" (1/1) ... [2019-08-04 21:38:28,894 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "seq.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:28" (1/1) ... [2019-08-04 21:38:28,897 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "seq.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:28" (1/1) ... [2019-08-04 21:38:28,899 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "seq.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:28" (1/1) ... [2019-08-04 21:38:28,900 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-04 21:38:28,904 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-04 21:38:28,904 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-04 21:38:28,904 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-04 21:38:28,905 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "seq.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:28" (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-04 21:38:28,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-04 21:38:28,971 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-04 21:38:29,183 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-04 21:38:29,183 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-08-04 21:38:29,184 INFO L202 PluginConnector]: Adding new model seq.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 09:38:29 BoogieIcfgContainer [2019-08-04 21:38:29,184 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-04 21:38:29,186 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-04 21:38:29,186 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-04 21:38:29,189 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-04 21:38:29,189 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "seq.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:28" (1/2) ... [2019-08-04 21:38:29,190 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66b5f882 and model type seq.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 09:38:29, skipping insertion in model container [2019-08-04 21:38:29,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "seq.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 09:38:29" (2/2) ... [2019-08-04 21:38:29,192 INFO L109 eAbstractionObserver]: Analyzing ICFG seq.i_4.bpl [2019-08-04 21:38:29,202 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-04 21:38:29,209 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-04 21:38:29,225 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-04 21:38:29,252 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-04 21:38:29,252 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-04 21:38:29,253 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-04 21:38:29,253 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-04 21:38:29,253 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-04 21:38:29,253 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-04 21:38:29,253 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-04 21:38:29,254 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-04 21:38:29,254 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-04 21:38:29,268 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-08-04 21:38:29,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-04 21:38:29,276 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:29,277 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-04 21:38:29,279 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:29,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:29,286 INFO L82 PathProgramCache]: Analyzing trace with hash 28787175, now seen corresponding path program 1 times [2019-08-04 21:38:29,334 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:29,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:29,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-04 21:38:29,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:29,605 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-04 21:38:29,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:38:29,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-04 21:38:29,612 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-04 21:38:29,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-04 21:38:29,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-04 21:38:29,624 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 4 states. [2019-08-04 21:38:29,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:29,758 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2019-08-04 21:38:29,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-04 21:38:29,760 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-08-04 21:38:29,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:29,770 INFO L225 Difference]: With dead ends: 8 [2019-08-04 21:38:29,770 INFO L226 Difference]: Without dead ends: 7 [2019-08-04 21:38:29,772 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-04 21:38:29,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-04 21:38:29,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-04 21:38:29,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-04 21:38:29,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-08-04 21:38:29,807 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 5 [2019-08-04 21:38:29,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:29,807 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-08-04 21:38:29,808 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-04 21:38:29,808 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-08-04 21:38:29,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-04 21:38:29,809 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:29,809 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-04 21:38:29,809 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:29,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:29,810 INFO L82 PathProgramCache]: Analyzing trace with hash 894126352, now seen corresponding path program 1 times [2019-08-04 21:38:29,811 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:29,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:29,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-04 21:38:29,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:29,915 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:38:29,935 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:29,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:38:29,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-04 21:38:29,938 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-04 21:38:29,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-04 21:38:29,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-08-04 21:38:29,939 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 5 states. [2019-08-04 21:38:30,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:30,077 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2019-08-04 21:38:30,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-04 21:38:30,078 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-08-04 21:38:30,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:30,080 INFO L225 Difference]: With dead ends: 13 [2019-08-04 21:38:30,080 INFO L226 Difference]: Without dead ends: 13 [2019-08-04 21:38:30,081 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:38:30,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-04 21:38:30,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 9. [2019-08-04 21:38:30,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-04 21:38:30,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-08-04 21:38:30,084 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2019-08-04 21:38:30,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:30,085 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-08-04 21:38:30,085 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-04 21:38:30,085 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2019-08-04 21:38:30,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-04 21:38:30,086 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:30,086 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-08-04 21:38:30,086 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:30,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:30,087 INFO L82 PathProgramCache]: Analyzing trace with hash 262017386, now seen corresponding path program 1 times [2019-08-04 21:38:30,088 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:30,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:30,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-04 21:38:30,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:30,399 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:30,399 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:30,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-04 21:38:30,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-04 21:38:30,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-04 21:38:30,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-08-04 21:38:30,401 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 6 states. [2019-08-04 21:38:30,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:30,549 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2019-08-04 21:38:30,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-04 21:38:30,549 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2019-08-04 21:38:30,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:30,550 INFO L225 Difference]: With dead ends: 13 [2019-08-04 21:38:30,551 INFO L226 Difference]: Without dead ends: 10 [2019-08-04 21:38:30,552 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:38:30,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-04 21:38:30,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-04 21:38:30,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-04 21:38:30,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2019-08-04 21:38:30,555 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 8 [2019-08-04 21:38:30,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:30,555 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2019-08-04 21:38:30,555 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-04 21:38:30,555 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2019-08-04 21:38:30,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-04 21:38:30,556 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:30,556 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2019-08-04 21:38:30,556 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:30,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:30,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1187728801, now seen corresponding path program 2 times [2019-08-04 21:38:30,558 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:30,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:30,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-04 21:38:30,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:30,640 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:38:30,666 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:30,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:30,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-04 21:38:30,667 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-04 21:38:30,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-04 21:38:30,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-08-04 21:38:30,668 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand 6 states. [2019-08-04 21:38:30,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:30,874 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2019-08-04 21:38:30,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-04 21:38:30,875 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-08-04 21:38:30,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:30,876 INFO L225 Difference]: With dead ends: 16 [2019-08-04 21:38:30,876 INFO L226 Difference]: Without dead ends: 16 [2019-08-04 21:38:30,876 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:38:30,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-04 21:38:30,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 12. [2019-08-04 21:38:30,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-04 21:38:30,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2019-08-04 21:38:30,880 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 9 [2019-08-04 21:38:30,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:30,880 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-08-04 21:38:30,880 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-04 21:38:30,880 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2019-08-04 21:38:30,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-04 21:38:30,881 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:30,881 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2019-08-04 21:38:30,882 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:30,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:30,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1053870661, now seen corresponding path program 3 times [2019-08-04 21:38:30,883 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:30,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:30,911 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-04 21:38:30,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:31,085 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:31,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:31,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-04 21:38:31,086 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-04 21:38:31,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-04 21:38:31,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:38:31,087 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand 8 states. [2019-08-04 21:38:31,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:31,508 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2019-08-04 21:38:31,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-04 21:38:31,509 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2019-08-04 21:38:31,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:31,510 INFO L225 Difference]: With dead ends: 18 [2019-08-04 21:38:31,510 INFO L226 Difference]: Without dead ends: 13 [2019-08-04 21:38:31,511 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-08-04 21:38:31,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-04 21:38:31,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-04 21:38:31,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-04 21:38:31,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-08-04 21:38:31,514 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2019-08-04 21:38:31,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:31,514 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-08-04 21:38:31,514 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-04 21:38:31,514 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-08-04 21:38:31,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-04 21:38:31,515 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:31,515 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1] [2019-08-04 21:38:31,515 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:31,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:31,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1170114012, now seen corresponding path program 4 times [2019-08-04 21:38:31,516 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:31,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:31,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-04 21:38:31,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:31,664 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:38:31,676 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:31,676 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:31,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-04 21:38:31,677 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-04 21:38:31,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-04 21:38:31,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:38:31,678 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 7 states. [2019-08-04 21:38:31,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:31,815 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2019-08-04 21:38:31,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-04 21:38:31,817 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-08-04 21:38:31,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:31,819 INFO L225 Difference]: With dead ends: 19 [2019-08-04 21:38:31,819 INFO L226 Difference]: Without dead ends: 19 [2019-08-04 21:38:31,819 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-08-04 21:38:31,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-04 21:38:31,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 15. [2019-08-04 21:38:31,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-04 21:38:31,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-08-04 21:38:31,823 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2019-08-04 21:38:31,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:31,824 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-08-04 21:38:31,824 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-04 21:38:31,824 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2019-08-04 21:38:31,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-04 21:38:31,824 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:31,825 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1] [2019-08-04 21:38:31,825 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:31,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:31,825 INFO L82 PathProgramCache]: Analyzing trace with hash 801918334, now seen corresponding path program 5 times [2019-08-04 21:38:31,826 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:31,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:31,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-04 21:38:31,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:32,026 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:32,027 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:32,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-04 21:38:32,027 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-04 21:38:32,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-04 21:38:32,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:38:32,028 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 10 states. [2019-08-04 21:38:32,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:32,187 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2019-08-04 21:38:32,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-04 21:38:32,188 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 14 [2019-08-04 21:38:32,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:32,189 INFO L225 Difference]: With dead ends: 23 [2019-08-04 21:38:32,189 INFO L226 Difference]: Without dead ends: 16 [2019-08-04 21:38:32,189 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-08-04 21:38:32,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-04 21:38:32,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-04 21:38:32,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-04 21:38:32,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2019-08-04 21:38:32,192 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 14 [2019-08-04 21:38:32,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:32,193 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2019-08-04 21:38:32,193 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-04 21:38:32,193 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2019-08-04 21:38:32,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-04 21:38:32,194 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:32,194 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1] [2019-08-04 21:38:32,194 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:32,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:32,195 INFO L82 PathProgramCache]: Analyzing trace with hash -460110731, now seen corresponding path program 6 times [2019-08-04 21:38:32,195 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:32,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:32,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-04 21:38:32,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:32,313 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:38:32,335 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:32,335 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:32,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-04 21:38:32,336 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-04 21:38:32,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-04 21:38:32,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:38:32,337 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 8 states. [2019-08-04 21:38:32,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:32,544 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2019-08-04 21:38:32,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-04 21:38:32,545 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2019-08-04 21:38:32,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:32,546 INFO L225 Difference]: With dead ends: 22 [2019-08-04 21:38:32,546 INFO L226 Difference]: Without dead ends: 22 [2019-08-04 21:38:32,547 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-08-04 21:38:32,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-04 21:38:32,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. [2019-08-04 21:38:32,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-04 21:38:32,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2019-08-04 21:38:32,550 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 15 [2019-08-04 21:38:32,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:32,550 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2019-08-04 21:38:32,550 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-04 21:38:32,551 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2019-08-04 21:38:32,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-04 21:38:32,551 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:32,551 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1] [2019-08-04 21:38:32,552 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:32,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:32,552 INFO L82 PathProgramCache]: Analyzing trace with hash 215271311, now seen corresponding path program 7 times [2019-08-04 21:38:32,553 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:32,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:32,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-04 21:38:32,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:32,763 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:32,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:32,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-04 21:38:32,764 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-04 21:38:32,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-04 21:38:32,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-08-04 21:38:32,765 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 12 states. [2019-08-04 21:38:32,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:32,939 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2019-08-04 21:38:32,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-04 21:38:32,939 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2019-08-04 21:38:32,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:32,941 INFO L225 Difference]: With dead ends: 28 [2019-08-04 21:38:32,941 INFO L226 Difference]: Without dead ends: 19 [2019-08-04 21:38:32,942 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2019-08-04 21:38:32,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-04 21:38:32,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-04 21:38:32,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-04 21:38:32,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2019-08-04 21:38:32,945 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 17 [2019-08-04 21:38:32,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:32,945 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-08-04 21:38:32,945 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-04 21:38:32,945 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2019-08-04 21:38:32,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-04 21:38:32,946 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:32,946 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1] [2019-08-04 21:38:32,946 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:32,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:32,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1251105080, now seen corresponding path program 8 times [2019-08-04 21:38:32,947 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:32,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:32,974 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-04 21:38:32,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:33,170 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:38:33,215 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 15 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:33,216 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:33,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-04 21:38:33,216 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-04 21:38:33,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-04 21:38:33,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:38:33,217 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 9 states. [2019-08-04 21:38:33,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:33,346 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2019-08-04 21:38:33,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-04 21:38:33,351 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-08-04 21:38:33,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:33,352 INFO L225 Difference]: With dead ends: 25 [2019-08-04 21:38:33,352 INFO L226 Difference]: Without dead ends: 25 [2019-08-04 21:38:33,352 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2019-08-04 21:38:33,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-04 21:38:33,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2019-08-04 21:38:33,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-04 21:38:33,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-08-04 21:38:33,355 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 18 [2019-08-04 21:38:33,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:33,355 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-08-04 21:38:33,355 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-04 21:38:33,356 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-08-04 21:38:33,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-04 21:38:33,356 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:33,356 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1] [2019-08-04 21:38:33,357 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:33,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:33,357 INFO L82 PathProgramCache]: Analyzing trace with hash -278808686, now seen corresponding path program 9 times [2019-08-04 21:38:33,358 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:33,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:33,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-04 21:38:33,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:33,750 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:33,751 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:33,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-04 21:38:33,751 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-04 21:38:33,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-04 21:38:33,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-08-04 21:38:33,752 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 14 states. [2019-08-04 21:38:34,022 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-08-04 21:38:34,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:34,194 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2019-08-04 21:38:34,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-04 21:38:34,194 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2019-08-04 21:38:34,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:34,195 INFO L225 Difference]: With dead ends: 33 [2019-08-04 21:38:34,196 INFO L226 Difference]: Without dead ends: 22 [2019-08-04 21:38:34,197 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2019-08-04 21:38:34,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-04 21:38:34,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-04 21:38:34,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-04 21:38:34,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2019-08-04 21:38:34,200 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 20 [2019-08-04 21:38:34,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:34,200 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2019-08-04 21:38:34,200 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-04 21:38:34,200 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2019-08-04 21:38:34,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-04 21:38:34,201 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:34,201 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 5, 1, 1, 1, 1] [2019-08-04 21:38:34,202 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:34,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:34,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1095018167, now seen corresponding path program 10 times [2019-08-04 21:38:34,203 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:34,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:34,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-04 21:38:34,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:34,383 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:38:34,404 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 21 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:34,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:34,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-04 21:38:34,405 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-04 21:38:34,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-04 21:38:34,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:38:34,406 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 10 states. [2019-08-04 21:38:34,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:34,816 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2019-08-04 21:38:34,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-04 21:38:34,816 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2019-08-04 21:38:34,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:34,817 INFO L225 Difference]: With dead ends: 28 [2019-08-04 21:38:34,817 INFO L226 Difference]: Without dead ends: 28 [2019-08-04 21:38:34,818 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=164, Unknown=0, NotChecked=0, Total=272 [2019-08-04 21:38:34,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-04 21:38:34,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2019-08-04 21:38:34,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-04 21:38:34,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2019-08-04 21:38:34,821 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 21 [2019-08-04 21:38:34,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:34,822 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2019-08-04 21:38:34,822 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-04 21:38:34,822 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2019-08-04 21:38:34,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-04 21:38:34,823 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:34,823 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1] [2019-08-04 21:38:34,823 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:34,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:34,824 INFO L82 PathProgramCache]: Analyzing trace with hash -45418653, now seen corresponding path program 11 times [2019-08-04 21:38:34,824 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:34,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:34,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-04 21:38:34,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:35,066 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 42 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:35,067 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:35,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-04 21:38:35,067 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-04 21:38:35,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-04 21:38:35,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2019-08-04 21:38:35,068 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 16 states. [2019-08-04 21:38:35,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:35,255 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2019-08-04 21:38:35,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-04 21:38:35,256 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 23 [2019-08-04 21:38:35,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:35,256 INFO L225 Difference]: With dead ends: 38 [2019-08-04 21:38:35,257 INFO L226 Difference]: Without dead ends: 25 [2019-08-04 21:38:35,257 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=365, Unknown=0, NotChecked=0, Total=506 [2019-08-04 21:38:35,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-04 21:38:35,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-04 21:38:35,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-04 21:38:35,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-08-04 21:38:35,260 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 23 [2019-08-04 21:38:35,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:35,261 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-08-04 21:38:35,261 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-04 21:38:35,261 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2019-08-04 21:38:35,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-04 21:38:35,261 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:35,262 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 6, 1, 1, 1, 1] [2019-08-04 21:38:35,262 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:35,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:35,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1932204468, now seen corresponding path program 12 times [2019-08-04 21:38:35,263 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:35,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:35,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-04 21:38:35,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:35,409 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:38:35,429 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 28 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:35,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:35,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-04 21:38:35,429 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-04 21:38:35,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-04 21:38:35,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-08-04 21:38:35,430 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 11 states. [2019-08-04 21:38:35,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:35,588 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2019-08-04 21:38:35,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-04 21:38:35,589 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2019-08-04 21:38:35,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:35,590 INFO L225 Difference]: With dead ends: 31 [2019-08-04 21:38:35,590 INFO L226 Difference]: Without dead ends: 31 [2019-08-04 21:38:35,591 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=135, Invalid=207, Unknown=0, NotChecked=0, Total=342 [2019-08-04 21:38:35,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-04 21:38:35,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2019-08-04 21:38:35,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-04 21:38:35,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-08-04 21:38:35,596 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2019-08-04 21:38:35,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:35,596 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-08-04 21:38:35,596 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-04 21:38:35,596 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-08-04 21:38:35,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-04 21:38:35,597 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:35,597 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1, 1] [2019-08-04 21:38:35,597 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:35,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:35,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1422569562, now seen corresponding path program 13 times [2019-08-04 21:38:35,598 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:35,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:35,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-04 21:38:35,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:36,115 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 56 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:36,116 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:36,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-04 21:38:36,116 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-04 21:38:36,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-04 21:38:36,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2019-08-04 21:38:36,117 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 18 states. [2019-08-04 21:38:36,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:36,367 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2019-08-04 21:38:36,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-04 21:38:36,367 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 26 [2019-08-04 21:38:36,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:36,368 INFO L225 Difference]: With dead ends: 43 [2019-08-04 21:38:36,368 INFO L226 Difference]: Without dead ends: 28 [2019-08-04 21:38:36,369 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=177, Invalid=473, Unknown=0, NotChecked=0, Total=650 [2019-08-04 21:38:36,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-04 21:38:36,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-04 21:38:36,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-04 21:38:36,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2019-08-04 21:38:36,372 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 26 [2019-08-04 21:38:36,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:36,372 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2019-08-04 21:38:36,372 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-04 21:38:36,372 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2019-08-04 21:38:36,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-04 21:38:36,373 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:36,373 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 7, 1, 1, 1, 1] [2019-08-04 21:38:36,373 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:36,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:36,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1873185821, now seen corresponding path program 14 times [2019-08-04 21:38:36,375 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:36,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:36,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-04 21:38:36,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:36,598 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:38:36,606 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 36 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:36,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:36,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-04 21:38:36,608 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-04 21:38:36,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-04 21:38:36,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2019-08-04 21:38:36,608 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 12 states. [2019-08-04 21:38:36,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:36,758 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2019-08-04 21:38:36,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-04 21:38:36,758 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2019-08-04 21:38:36,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:36,759 INFO L225 Difference]: With dead ends: 34 [2019-08-04 21:38:36,760 INFO L226 Difference]: Without dead ends: 34 [2019-08-04 21:38:36,761 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=255, Unknown=0, NotChecked=0, Total=420 [2019-08-04 21:38:36,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-04 21:38:36,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2019-08-04 21:38:36,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-04 21:38:36,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2019-08-04 21:38:36,764 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 27 [2019-08-04 21:38:36,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:36,764 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2019-08-04 21:38:36,764 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-04 21:38:36,764 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2019-08-04 21:38:36,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-04 21:38:36,765 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:36,765 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 8, 1, 1, 1, 1] [2019-08-04 21:38:36,765 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:36,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:36,766 INFO L82 PathProgramCache]: Analyzing trace with hash 540329271, now seen corresponding path program 15 times [2019-08-04 21:38:36,766 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:36,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:36,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-04 21:38:36,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:37,424 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 72 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:37,425 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:37,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-04 21:38:37,425 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-04 21:38:37,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-04 21:38:37,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2019-08-04 21:38:37,426 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 20 states. [2019-08-04 21:38:37,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:37,657 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2019-08-04 21:38:37,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-04 21:38:37,657 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 29 [2019-08-04 21:38:37,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:37,658 INFO L225 Difference]: With dead ends: 48 [2019-08-04 21:38:37,658 INFO L226 Difference]: Without dead ends: 31 [2019-08-04 21:38:37,658 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=217, Invalid=595, Unknown=0, NotChecked=0, Total=812 [2019-08-04 21:38:37,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-04 21:38:37,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-04 21:38:37,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-04 21:38:37,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2019-08-04 21:38:37,662 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 29 [2019-08-04 21:38:37,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:37,662 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2019-08-04 21:38:37,662 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-04 21:38:37,662 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2019-08-04 21:38:37,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-04 21:38:37,663 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:37,663 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 8, 1, 1, 1, 1] [2019-08-04 21:38:37,664 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:37,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:37,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1436557664, now seen corresponding path program 16 times [2019-08-04 21:38:37,665 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:37,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:37,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-04 21:38:37,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:38,073 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:38:38,081 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 45 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:38,082 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:38,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-04 21:38:38,082 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-04 21:38:38,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-04 21:38:38,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2019-08-04 21:38:38,083 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 13 states. [2019-08-04 21:38:38,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:38,288 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2019-08-04 21:38:38,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-04 21:38:38,289 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2019-08-04 21:38:38,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:38,290 INFO L225 Difference]: With dead ends: 37 [2019-08-04 21:38:38,290 INFO L226 Difference]: Without dead ends: 37 [2019-08-04 21:38:38,291 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=198, Invalid=308, Unknown=0, NotChecked=0, Total=506 [2019-08-04 21:38:38,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-04 21:38:38,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2019-08-04 21:38:38,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-04 21:38:38,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2019-08-04 21:38:38,295 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 30 [2019-08-04 21:38:38,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:38,295 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2019-08-04 21:38:38,296 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-04 21:38:38,296 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2019-08-04 21:38:38,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-04 21:38:38,296 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:38,297 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 9, 1, 1, 1, 1] [2019-08-04 21:38:38,297 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:38,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:38,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1847465402, now seen corresponding path program 17 times [2019-08-04 21:38:38,298 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:38,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:38,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-04 21:38:38,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:38,705 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 90 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:38,705 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:38,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-04 21:38:38,706 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-04 21:38:38,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-04 21:38:38,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2019-08-04 21:38:38,707 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 22 states. [2019-08-04 21:38:39,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:39,043 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2019-08-04 21:38:39,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-04 21:38:39,044 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 32 [2019-08-04 21:38:39,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:39,045 INFO L225 Difference]: With dead ends: 53 [2019-08-04 21:38:39,045 INFO L226 Difference]: Without dead ends: 34 [2019-08-04 21:38:39,045 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=261, Invalid=731, Unknown=0, NotChecked=0, Total=992 [2019-08-04 21:38:39,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-04 21:38:39,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-08-04 21:38:39,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-04 21:38:39,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2019-08-04 21:38:39,048 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 32 [2019-08-04 21:38:39,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:39,048 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2019-08-04 21:38:39,048 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-04 21:38:39,048 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2019-08-04 21:38:39,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-04 21:38:39,049 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:39,049 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 9, 1, 1, 1, 1] [2019-08-04 21:38:39,049 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:39,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:39,050 INFO L82 PathProgramCache]: Analyzing trace with hash -424157967, now seen corresponding path program 18 times [2019-08-04 21:38:39,051 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:39,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:39,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-04 21:38:39,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:39,205 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:38:39,273 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 55 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:39,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:39,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-04 21:38:39,274 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-04 21:38:39,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-04 21:38:39,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2019-08-04 21:38:39,275 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 14 states. [2019-08-04 21:38:39,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:39,456 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2019-08-04 21:38:39,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-04 21:38:39,457 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 33 [2019-08-04 21:38:39,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:39,457 INFO L225 Difference]: With dead ends: 40 [2019-08-04 21:38:39,458 INFO L226 Difference]: Without dead ends: 40 [2019-08-04 21:38:39,458 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=234, Invalid=366, Unknown=0, NotChecked=0, Total=600 [2019-08-04 21:38:39,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-04 21:38:39,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2019-08-04 21:38:39,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-04 21:38:39,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2019-08-04 21:38:39,461 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 33 [2019-08-04 21:38:39,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:39,461 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2019-08-04 21:38:39,462 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-04 21:38:39,462 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2019-08-04 21:38:39,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-04 21:38:39,462 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:39,462 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1] [2019-08-04 21:38:39,463 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:39,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:39,463 INFO L82 PathProgramCache]: Analyzing trace with hash 406139147, now seen corresponding path program 19 times [2019-08-04 21:38:39,464 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:39,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:39,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-04 21:38:39,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:39,931 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 110 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:39,931 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:39,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-04 21:38:39,932 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-04 21:38:39,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-04 21:38:39,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2019-08-04 21:38:39,933 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 24 states. [2019-08-04 21:38:40,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:40,229 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2019-08-04 21:38:40,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-04 21:38:40,229 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 35 [2019-08-04 21:38:40,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:40,230 INFO L225 Difference]: With dead ends: 58 [2019-08-04 21:38:40,230 INFO L226 Difference]: Without dead ends: 37 [2019-08-04 21:38:40,231 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=309, Invalid=881, Unknown=0, NotChecked=0, Total=1190 [2019-08-04 21:38:40,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-04 21:38:40,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-04 21:38:40,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-04 21:38:40,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2019-08-04 21:38:40,234 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 35 [2019-08-04 21:38:40,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:40,234 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2019-08-04 21:38:40,234 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-04 21:38:40,234 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2019-08-04 21:38:40,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-04 21:38:40,235 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:40,235 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 10, 1, 1, 1, 1] [2019-08-04 21:38:40,235 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:40,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:40,236 INFO L82 PathProgramCache]: Analyzing trace with hash -2020930956, now seen corresponding path program 20 times [2019-08-04 21:38:40,236 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:40,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:40,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-04 21:38:40,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:40,437 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:38:40,477 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 66 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:40,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:40,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-04 21:38:40,478 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-04 21:38:40,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-04 21:38:40,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2019-08-04 21:38:40,479 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 15 states. [2019-08-04 21:38:41,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:41,071 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2019-08-04 21:38:41,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-04 21:38:41,074 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 36 [2019-08-04 21:38:41,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:41,074 INFO L225 Difference]: With dead ends: 43 [2019-08-04 21:38:41,074 INFO L226 Difference]: Without dead ends: 43 [2019-08-04 21:38:41,075 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=273, Invalid=429, Unknown=0, NotChecked=0, Total=702 [2019-08-04 21:38:41,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-04 21:38:41,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2019-08-04 21:38:41,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-04 21:38:41,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2019-08-04 21:38:41,078 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 36 [2019-08-04 21:38:41,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:41,079 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2019-08-04 21:38:41,079 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-04 21:38:41,079 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2019-08-04 21:38:41,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-04 21:38:41,080 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:41,080 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 11, 1, 1, 1, 1] [2019-08-04 21:38:41,080 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:41,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:41,080 INFO L82 PathProgramCache]: Analyzing trace with hash -789378610, now seen corresponding path program 21 times [2019-08-04 21:38:41,081 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:41,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:41,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-04 21:38:41,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:41,622 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 132 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:41,622 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:41,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-04 21:38:41,623 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-04 21:38:41,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-04 21:38:41,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=469, Unknown=0, NotChecked=0, Total=650 [2019-08-04 21:38:41,624 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 26 states. [2019-08-04 21:38:42,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:42,164 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2019-08-04 21:38:42,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-04 21:38:42,165 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 38 [2019-08-04 21:38:42,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:42,165 INFO L225 Difference]: With dead ends: 63 [2019-08-04 21:38:42,166 INFO L226 Difference]: Without dead ends: 40 [2019-08-04 21:38:42,166 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=361, Invalid=1045, Unknown=0, NotChecked=0, Total=1406 [2019-08-04 21:38:42,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-04 21:38:42,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-08-04 21:38:42,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-04 21:38:42,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2019-08-04 21:38:42,169 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 38 [2019-08-04 21:38:42,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:42,169 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2019-08-04 21:38:42,169 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-04 21:38:42,169 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2019-08-04 21:38:42,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-04 21:38:42,170 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:42,170 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 11, 1, 1, 1, 1] [2019-08-04 21:38:42,170 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:42,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:42,171 INFO L82 PathProgramCache]: Analyzing trace with hash 139611077, now seen corresponding path program 22 times [2019-08-04 21:38:42,171 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:42,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:42,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-04 21:38:42,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:43,197 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:38:43,206 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 78 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:43,206 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:43,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-04 21:38:43,207 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-04 21:38:43,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-04 21:38:43,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=133, Unknown=0, NotChecked=0, Total=240 [2019-08-04 21:38:43,208 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 16 states. [2019-08-04 21:38:43,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:43,425 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2019-08-04 21:38:43,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-04 21:38:43,425 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 39 [2019-08-04 21:38:43,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:43,426 INFO L225 Difference]: With dead ends: 46 [2019-08-04 21:38:43,426 INFO L226 Difference]: Without dead ends: 46 [2019-08-04 21:38:43,427 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=315, Invalid=497, Unknown=0, NotChecked=0, Total=812 [2019-08-04 21:38:43,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-04 21:38:43,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2019-08-04 21:38:43,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-04 21:38:43,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2019-08-04 21:38:43,431 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 39 [2019-08-04 21:38:43,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:43,431 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2019-08-04 21:38:43,431 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-04 21:38:43,432 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2019-08-04 21:38:43,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-04 21:38:43,432 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:43,432 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 12, 1, 1, 1, 1] [2019-08-04 21:38:43,432 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:43,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:43,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1022311135, now seen corresponding path program 23 times [2019-08-04 21:38:43,433 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:43,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:43,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-04 21:38:43,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:44,092 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 156 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:44,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:44,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-04 21:38:44,093 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-04 21:38:44,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-04 21:38:44,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=547, Unknown=0, NotChecked=0, Total=756 [2019-08-04 21:38:44,093 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 28 states. [2019-08-04 21:38:44,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:44,614 INFO L93 Difference]: Finished difference Result 68 states and 69 transitions. [2019-08-04 21:38:44,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-04 21:38:44,615 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 41 [2019-08-04 21:38:44,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:44,615 INFO L225 Difference]: With dead ends: 68 [2019-08-04 21:38:44,616 INFO L226 Difference]: Without dead ends: 43 [2019-08-04 21:38:44,617 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=417, Invalid=1223, Unknown=0, NotChecked=0, Total=1640 [2019-08-04 21:38:44,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-04 21:38:44,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-04 21:38:44,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-04 21:38:44,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2019-08-04 21:38:44,619 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 41 [2019-08-04 21:38:44,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:44,619 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2019-08-04 21:38:44,619 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-04 21:38:44,620 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2019-08-04 21:38:44,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-04 21:38:44,620 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:44,620 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 12, 1, 1, 1, 1] [2019-08-04 21:38:44,620 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:44,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:44,621 INFO L82 PathProgramCache]: Analyzing trace with hash -215178872, now seen corresponding path program 24 times [2019-08-04 21:38:44,621 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:44,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:44,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-04 21:38:44,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:44,799 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:38:44,822 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 91 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:44,822 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:44,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-04 21:38:44,823 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-04 21:38:44,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-04 21:38:44,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=150, Unknown=0, NotChecked=0, Total=272 [2019-08-04 21:38:44,823 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 17 states. [2019-08-04 21:38:45,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:45,083 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2019-08-04 21:38:45,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-04 21:38:45,083 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 42 [2019-08-04 21:38:45,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:45,084 INFO L225 Difference]: With dead ends: 49 [2019-08-04 21:38:45,084 INFO L226 Difference]: Without dead ends: 49 [2019-08-04 21:38:45,085 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=360, Invalid=570, Unknown=0, NotChecked=0, Total=930 [2019-08-04 21:38:45,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-04 21:38:45,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2019-08-04 21:38:45,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-04 21:38:45,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2019-08-04 21:38:45,089 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 42 [2019-08-04 21:38:45,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:45,089 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2019-08-04 21:38:45,090 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-04 21:38:45,090 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2019-08-04 21:38:45,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-04 21:38:45,090 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:45,091 INFO L399 BasicCegarLoop]: trace histogram [14, 13, 13, 1, 1, 1, 1] [2019-08-04 21:38:45,091 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:45,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:45,091 INFO L82 PathProgramCache]: Analyzing trace with hash -628413470, now seen corresponding path program 25 times [2019-08-04 21:38:45,092 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:45,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:45,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-04 21:38:45,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:45,809 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 182 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:45,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:45,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-04 21:38:45,810 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-04 21:38:45,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-04 21:38:45,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=631, Unknown=0, NotChecked=0, Total=870 [2019-08-04 21:38:45,811 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 30 states. [2019-08-04 21:38:46,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:46,353 INFO L93 Difference]: Finished difference Result 73 states and 74 transitions. [2019-08-04 21:38:46,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-04 21:38:46,353 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 44 [2019-08-04 21:38:46,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:46,354 INFO L225 Difference]: With dead ends: 73 [2019-08-04 21:38:46,354 INFO L226 Difference]: Without dead ends: 46 [2019-08-04 21:38:46,355 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=477, Invalid=1415, Unknown=0, NotChecked=0, Total=1892 [2019-08-04 21:38:46,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-04 21:38:46,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-08-04 21:38:46,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-04 21:38:46,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2019-08-04 21:38:46,357 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 44 [2019-08-04 21:38:46,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:46,358 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2019-08-04 21:38:46,358 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-04 21:38:46,358 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2019-08-04 21:38:46,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-04 21:38:46,358 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:46,359 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 13, 1, 1, 1, 1] [2019-08-04 21:38:46,359 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:46,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:46,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1306056857, now seen corresponding path program 26 times [2019-08-04 21:38:46,360 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:46,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:46,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-04 21:38:46,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:46,894 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:38:46,912 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 105 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:46,912 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:46,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-04 21:38:46,913 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-04 21:38:46,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-04 21:38:46,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=168, Unknown=0, NotChecked=0, Total=306 [2019-08-04 21:38:46,913 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 18 states. [2019-08-04 21:38:47,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:47,259 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2019-08-04 21:38:47,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-04 21:38:47,260 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 45 [2019-08-04 21:38:47,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:47,260 INFO L225 Difference]: With dead ends: 52 [2019-08-04 21:38:47,260 INFO L226 Difference]: Without dead ends: 52 [2019-08-04 21:38:47,261 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=408, Invalid=648, Unknown=0, NotChecked=0, Total=1056 [2019-08-04 21:38:47,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-04 21:38:47,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2019-08-04 21:38:47,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-04 21:38:47,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2019-08-04 21:38:47,267 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 45 [2019-08-04 21:38:47,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:47,268 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2019-08-04 21:38:47,268 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-04 21:38:47,268 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2019-08-04 21:38:47,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-04 21:38:47,268 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:47,268 INFO L399 BasicCegarLoop]: trace histogram [15, 14, 14, 1, 1, 1, 1] [2019-08-04 21:38:47,268 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:47,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:47,269 INFO L82 PathProgramCache]: Analyzing trace with hash 990241459, now seen corresponding path program 27 times [2019-08-04 21:38:47,269 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:47,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:47,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-04 21:38:47,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:48,389 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 210 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:48,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:48,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-04 21:38:48,390 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-04 21:38:48,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-04 21:38:48,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=721, Unknown=0, NotChecked=0, Total=992 [2019-08-04 21:38:48,391 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 32 states. [2019-08-04 21:38:49,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:49,117 INFO L93 Difference]: Finished difference Result 78 states and 79 transitions. [2019-08-04 21:38:49,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-04 21:38:49,117 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 47 [2019-08-04 21:38:49,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:49,118 INFO L225 Difference]: With dead ends: 78 [2019-08-04 21:38:49,118 INFO L226 Difference]: Without dead ends: 49 [2019-08-04 21:38:49,119 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=541, Invalid=1621, Unknown=0, NotChecked=0, Total=2162 [2019-08-04 21:38:49,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-04 21:38:49,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-08-04 21:38:49,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-04 21:38:49,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2019-08-04 21:38:49,121 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 47 [2019-08-04 21:38:49,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:49,121 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2019-08-04 21:38:49,121 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-04 21:38:49,121 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2019-08-04 21:38:49,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-04 21:38:49,122 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:49,122 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 14, 1, 1, 1, 1] [2019-08-04 21:38:49,122 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:49,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:49,122 INFO L82 PathProgramCache]: Analyzing trace with hash 924575388, now seen corresponding path program 28 times [2019-08-04 21:38:49,123 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:49,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:49,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-04 21:38:49,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:49,296 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:38:49,307 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 120 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:49,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:49,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-04 21:38:49,307 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-04 21:38:49,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-04 21:38:49,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=187, Unknown=0, NotChecked=0, Total=342 [2019-08-04 21:38:49,308 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 19 states. [2019-08-04 21:38:49,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:49,576 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2019-08-04 21:38:49,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-04 21:38:49,576 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 48 [2019-08-04 21:38:49,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:49,577 INFO L225 Difference]: With dead ends: 55 [2019-08-04 21:38:49,578 INFO L226 Difference]: Without dead ends: 55 [2019-08-04 21:38:49,579 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=459, Invalid=731, Unknown=0, NotChecked=0, Total=1190 [2019-08-04 21:38:49,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-04 21:38:49,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 51. [2019-08-04 21:38:49,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-04 21:38:49,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2019-08-04 21:38:49,581 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 48 [2019-08-04 21:38:49,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:49,581 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2019-08-04 21:38:49,582 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-04 21:38:49,582 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2019-08-04 21:38:49,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-04 21:38:49,582 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:49,582 INFO L399 BasicCegarLoop]: trace histogram [16, 15, 15, 1, 1, 1, 1] [2019-08-04 21:38:49,583 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:49,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:49,583 INFO L82 PathProgramCache]: Analyzing trace with hash -541230090, now seen corresponding path program 29 times [2019-08-04 21:38:49,584 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:49,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:49,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-04 21:38:49,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:50,614 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 240 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:50,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:50,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-04 21:38:50,615 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-04 21:38:50,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-04 21:38:50,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=817, Unknown=0, NotChecked=0, Total=1122 [2019-08-04 21:38:50,616 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 34 states. [2019-08-04 21:38:51,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:51,411 INFO L93 Difference]: Finished difference Result 83 states and 84 transitions. [2019-08-04 21:38:51,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-04 21:38:51,411 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 50 [2019-08-04 21:38:51,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:51,412 INFO L225 Difference]: With dead ends: 83 [2019-08-04 21:38:51,412 INFO L226 Difference]: Without dead ends: 52 [2019-08-04 21:38:51,413 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=609, Invalid=1841, Unknown=0, NotChecked=0, Total=2450 [2019-08-04 21:38:51,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-04 21:38:51,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-04 21:38:51,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-04 21:38:51,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2019-08-04 21:38:51,415 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 50 [2019-08-04 21:38:51,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:51,415 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2019-08-04 21:38:51,415 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-04 21:38:51,415 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2019-08-04 21:38:51,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-04 21:38:51,415 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:51,415 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 15, 1, 1, 1, 1] [2019-08-04 21:38:51,416 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:51,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:51,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1705935725, now seen corresponding path program 30 times [2019-08-04 21:38:51,418 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:51,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:51,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-04 21:38:51,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:51,731 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:38:51,757 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 136 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:51,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:51,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-04 21:38:51,758 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-04 21:38:51,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-04 21:38:51,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=207, Unknown=0, NotChecked=0, Total=380 [2019-08-04 21:38:51,759 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand 20 states. [2019-08-04 21:38:52,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:52,164 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2019-08-04 21:38:52,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-04 21:38:52,164 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 51 [2019-08-04 21:38:52,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:52,165 INFO L225 Difference]: With dead ends: 58 [2019-08-04 21:38:52,165 INFO L226 Difference]: Without dead ends: 58 [2019-08-04 21:38:52,166 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=513, Invalid=819, Unknown=0, NotChecked=0, Total=1332 [2019-08-04 21:38:52,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-04 21:38:52,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2019-08-04 21:38:52,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-04 21:38:52,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2019-08-04 21:38:52,169 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 51 [2019-08-04 21:38:52,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:52,169 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2019-08-04 21:38:52,169 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-04 21:38:52,169 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2019-08-04 21:38:52,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-04 21:38:52,170 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:52,170 INFO L399 BasicCegarLoop]: trace histogram [17, 16, 16, 1, 1, 1, 1] [2019-08-04 21:38:52,170 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:52,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:52,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1273223033, now seen corresponding path program 31 times [2019-08-04 21:38:52,171 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:52,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:52,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-04 21:38:52,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:52,897 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 272 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:52,897 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:52,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-04 21:38:52,897 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-04 21:38:52,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-04 21:38:52,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=341, Invalid=919, Unknown=0, NotChecked=0, Total=1260 [2019-08-04 21:38:52,899 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 36 states. [2019-08-04 21:38:53,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:53,350 INFO L93 Difference]: Finished difference Result 88 states and 89 transitions. [2019-08-04 21:38:53,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-04 21:38:53,350 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 53 [2019-08-04 21:38:53,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:53,351 INFO L225 Difference]: With dead ends: 88 [2019-08-04 21:38:53,351 INFO L226 Difference]: Without dead ends: 55 [2019-08-04 21:38:53,353 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=681, Invalid=2075, Unknown=0, NotChecked=0, Total=2756 [2019-08-04 21:38:53,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-04 21:38:53,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-08-04 21:38:53,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-04 21:38:53,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2019-08-04 21:38:53,355 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 53 [2019-08-04 21:38:53,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:53,355 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2019-08-04 21:38:53,355 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-04 21:38:53,355 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2019-08-04 21:38:53,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-04 21:38:53,356 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:53,356 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 16, 1, 1, 1, 1] [2019-08-04 21:38:53,356 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:53,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:53,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1611671120, now seen corresponding path program 32 times [2019-08-04 21:38:53,357 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:53,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:53,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-04 21:38:53,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:53,693 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:38:53,706 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 153 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:53,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:53,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-04 21:38:53,707 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-04 21:38:53,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-04 21:38:53,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=228, Unknown=0, NotChecked=0, Total=420 [2019-08-04 21:38:53,707 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 21 states. [2019-08-04 21:38:54,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:54,007 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2019-08-04 21:38:54,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-04 21:38:54,007 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 54 [2019-08-04 21:38:54,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:54,008 INFO L225 Difference]: With dead ends: 61 [2019-08-04 21:38:54,008 INFO L226 Difference]: Without dead ends: 61 [2019-08-04 21:38:54,010 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=570, Invalid=912, Unknown=0, NotChecked=0, Total=1482 [2019-08-04 21:38:54,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-04 21:38:54,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 57. [2019-08-04 21:38:54,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-04 21:38:54,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2019-08-04 21:38:54,012 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 54 [2019-08-04 21:38:54,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:54,012 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2019-08-04 21:38:54,012 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-04 21:38:54,012 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2019-08-04 21:38:54,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-04 21:38:54,013 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:54,013 INFO L399 BasicCegarLoop]: trace histogram [18, 17, 17, 1, 1, 1, 1] [2019-08-04 21:38:54,013 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:54,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:54,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1667299850, now seen corresponding path program 33 times [2019-08-04 21:38:54,014 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:54,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:54,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-04 21:38:54,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:54,702 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 306 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:54,703 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:54,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-04 21:38:54,703 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-04 21:38:54,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-04 21:38:54,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=379, Invalid=1027, Unknown=0, NotChecked=0, Total=1406 [2019-08-04 21:38:54,704 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 38 states. [2019-08-04 21:38:55,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:55,312 INFO L93 Difference]: Finished difference Result 93 states and 94 transitions. [2019-08-04 21:38:55,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-04 21:38:55,312 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 56 [2019-08-04 21:38:55,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:55,313 INFO L225 Difference]: With dead ends: 93 [2019-08-04 21:38:55,313 INFO L226 Difference]: Without dead ends: 58 [2019-08-04 21:38:55,315 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=757, Invalid=2323, Unknown=0, NotChecked=0, Total=3080 [2019-08-04 21:38:55,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-04 21:38:55,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-08-04 21:38:55,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-04 21:38:55,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2019-08-04 21:38:55,317 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 56 [2019-08-04 21:38:55,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:55,317 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2019-08-04 21:38:55,318 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-04 21:38:55,318 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2019-08-04 21:38:55,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-04 21:38:55,318 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:55,318 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 17, 1, 1, 1, 1] [2019-08-04 21:38:55,319 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:55,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:55,319 INFO L82 PathProgramCache]: Analyzing trace with hash -751416255, now seen corresponding path program 34 times [2019-08-04 21:38:55,319 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:55,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:55,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-04 21:38:55,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:56,038 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:38:56,062 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 171 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:56,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:56,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-04 21:38:56,062 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-04 21:38:56,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-04 21:38:56,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=250, Unknown=0, NotChecked=0, Total=462 [2019-08-04 21:38:56,063 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand 22 states. [2019-08-04 21:38:56,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:56,432 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2019-08-04 21:38:56,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-04 21:38:56,433 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 57 [2019-08-04 21:38:56,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:56,433 INFO L225 Difference]: With dead ends: 64 [2019-08-04 21:38:56,434 INFO L226 Difference]: Without dead ends: 64 [2019-08-04 21:38:56,435 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=630, Invalid=1010, Unknown=0, NotChecked=0, Total=1640 [2019-08-04 21:38:56,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-04 21:38:56,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 60. [2019-08-04 21:38:56,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-04 21:38:56,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2019-08-04 21:38:56,437 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 57 [2019-08-04 21:38:56,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:56,437 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2019-08-04 21:38:56,437 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-04 21:38:56,437 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2019-08-04 21:38:56,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-04 21:38:56,437 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:56,437 INFO L399 BasicCegarLoop]: trace histogram [19, 18, 18, 1, 1, 1, 1] [2019-08-04 21:38:56,438 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:56,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:56,438 INFO L82 PathProgramCache]: Analyzing trace with hash -556463013, now seen corresponding path program 35 times [2019-08-04 21:38:56,439 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:56,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:56,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-04 21:38:56,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:57,746 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 342 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:57,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:57,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-04 21:38:57,746 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-04 21:38:57,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-04 21:38:57,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=419, Invalid=1141, Unknown=0, NotChecked=0, Total=1560 [2019-08-04 21:38:57,748 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 40 states. [2019-08-04 21:38:58,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:58,979 INFO L93 Difference]: Finished difference Result 98 states and 99 transitions. [2019-08-04 21:38:58,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-04 21:38:58,980 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 59 [2019-08-04 21:38:58,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:58,980 INFO L225 Difference]: With dead ends: 98 [2019-08-04 21:38:58,981 INFO L226 Difference]: Without dead ends: 61 [2019-08-04 21:38:58,983 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 495 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=837, Invalid=2585, Unknown=0, NotChecked=0, Total=3422 [2019-08-04 21:38:58,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-04 21:38:58,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-08-04 21:38:58,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-04 21:38:58,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2019-08-04 21:38:58,985 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 59 [2019-08-04 21:38:58,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:58,985 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2019-08-04 21:38:58,985 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-04 21:38:58,985 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2019-08-04 21:38:58,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-04 21:38:58,986 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:58,986 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 18, 1, 1, 1, 1] [2019-08-04 21:38:58,986 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:58,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:58,987 INFO L82 PathProgramCache]: Analyzing trace with hash 138377924, now seen corresponding path program 36 times [2019-08-04 21:38:58,987 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:59,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:59,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-04 21:38:59,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:59,249 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:38:59,260 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 190 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:59,261 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:59,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-04 21:38:59,261 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-04 21:38:59,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-04 21:38:59,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=273, Unknown=0, NotChecked=0, Total=506 [2019-08-04 21:38:59,262 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 23 states. [2019-08-04 21:38:59,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:59,598 INFO L93 Difference]: Finished difference Result 67 states and 68 transitions. [2019-08-04 21:38:59,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-04 21:38:59,598 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 60 [2019-08-04 21:38:59,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:59,599 INFO L225 Difference]: With dead ends: 67 [2019-08-04 21:38:59,599 INFO L226 Difference]: Without dead ends: 67 [2019-08-04 21:38:59,601 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=693, Invalid=1113, Unknown=0, NotChecked=0, Total=1806 [2019-08-04 21:38:59,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-04 21:38:59,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 63. [2019-08-04 21:38:59,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-04 21:38:59,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2019-08-04 21:38:59,603 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 60 [2019-08-04 21:38:59,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:59,603 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2019-08-04 21:38:59,603 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-04 21:38:59,603 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2019-08-04 21:38:59,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-04 21:38:59,604 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:59,604 INFO L399 BasicCegarLoop]: trace histogram [20, 19, 19, 1, 1, 1, 1] [2019-08-04 21:38:59,604 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:59,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:59,604 INFO L82 PathProgramCache]: Analyzing trace with hash -162748898, now seen corresponding path program 37 times [2019-08-04 21:38:59,605 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:59,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:59,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-04 21:38:59,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:00,448 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 380 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:00,449 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:00,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-04 21:39:00,449 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-04 21:39:00,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-04 21:39:00,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=461, Invalid=1261, Unknown=0, NotChecked=0, Total=1722 [2019-08-04 21:39:00,450 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 42 states. [2019-08-04 21:39:01,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:01,122 INFO L93 Difference]: Finished difference Result 103 states and 104 transitions. [2019-08-04 21:39:01,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-04 21:39:01,122 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 62 [2019-08-04 21:39:01,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:01,123 INFO L225 Difference]: With dead ends: 103 [2019-08-04 21:39:01,123 INFO L226 Difference]: Without dead ends: 64 [2019-08-04 21:39:01,125 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 551 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=921, Invalid=2861, Unknown=0, NotChecked=0, Total=3782 [2019-08-04 21:39:01,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-04 21:39:01,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-08-04 21:39:01,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-04 21:39:01,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2019-08-04 21:39:01,126 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 62 [2019-08-04 21:39:01,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:01,127 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2019-08-04 21:39:01,127 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-04 21:39:01,127 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2019-08-04 21:39:01,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-04 21:39:01,127 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:01,127 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 19, 1, 1, 1, 1] [2019-08-04 21:39:01,128 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:01,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:01,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1898761451, now seen corresponding path program 38 times [2019-08-04 21:39:01,129 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:01,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:01,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-04 21:39:01,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:01,722 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:01,739 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 210 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:01,740 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:01,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-04 21:39:01,740 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-04 21:39:01,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-04 21:39:01,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=297, Unknown=0, NotChecked=0, Total=552 [2019-08-04 21:39:01,741 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand 24 states. [2019-08-04 21:39:02,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:02,228 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2019-08-04 21:39:02,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-04 21:39:02,229 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 63 [2019-08-04 21:39:02,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:02,230 INFO L225 Difference]: With dead ends: 70 [2019-08-04 21:39:02,230 INFO L226 Difference]: Without dead ends: 70 [2019-08-04 21:39:02,231 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=759, Invalid=1221, Unknown=0, NotChecked=0, Total=1980 [2019-08-04 21:39:02,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-04 21:39:02,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 66. [2019-08-04 21:39:02,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-04 21:39:02,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2019-08-04 21:39:02,234 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 67 transitions. Word has length 63 [2019-08-04 21:39:02,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:02,234 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 67 transitions. [2019-08-04 21:39:02,234 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-04 21:39:02,234 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2019-08-04 21:39:02,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-08-04 21:39:02,234 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:02,234 INFO L399 BasicCegarLoop]: trace histogram [21, 20, 20, 1, 1, 1, 1] [2019-08-04 21:39:02,235 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:02,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:02,235 INFO L82 PathProgramCache]: Analyzing trace with hash 651398703, now seen corresponding path program 39 times [2019-08-04 21:39:02,235 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:02,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:02,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-04 21:39:02,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:03,071 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 420 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:03,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:03,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-04 21:39:03,071 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-04 21:39:03,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-04 21:39:03,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=505, Invalid=1387, Unknown=0, NotChecked=0, Total=1892 [2019-08-04 21:39:03,072 INFO L87 Difference]: Start difference. First operand 66 states and 67 transitions. Second operand 44 states. [2019-08-04 21:39:04,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:04,112 INFO L93 Difference]: Finished difference Result 108 states and 109 transitions. [2019-08-04 21:39:04,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-04 21:39:04,112 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 65 [2019-08-04 21:39:04,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:04,113 INFO L225 Difference]: With dead ends: 108 [2019-08-04 21:39:04,113 INFO L226 Difference]: Without dead ends: 67 [2019-08-04 21:39:04,114 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 610 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1009, Invalid=3151, Unknown=0, NotChecked=0, Total=4160 [2019-08-04 21:39:04,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-04 21:39:04,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-08-04 21:39:04,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-04 21:39:04,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2019-08-04 21:39:04,116 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 65 [2019-08-04 21:39:04,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:04,116 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2019-08-04 21:39:04,116 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-04 21:39:04,116 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2019-08-04 21:39:04,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-04 21:39:04,116 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:04,117 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 20, 1, 1, 1, 1] [2019-08-04 21:39:04,117 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:04,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:04,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1197356584, now seen corresponding path program 40 times [2019-08-04 21:39:04,118 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:04,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:04,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-04 21:39:04,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:04,407 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:04,452 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 231 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:04,452 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:04,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-04 21:39:04,452 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-04 21:39:04,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-04 21:39:04,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=322, Unknown=0, NotChecked=0, Total=600 [2019-08-04 21:39:04,453 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 25 states. [2019-08-04 21:39:04,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:04,836 INFO L93 Difference]: Finished difference Result 73 states and 74 transitions. [2019-08-04 21:39:04,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-04 21:39:04,837 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 66 [2019-08-04 21:39:04,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:04,838 INFO L225 Difference]: With dead ends: 73 [2019-08-04 21:39:04,838 INFO L226 Difference]: Without dead ends: 73 [2019-08-04 21:39:04,838 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=828, Invalid=1334, Unknown=0, NotChecked=0, Total=2162 [2019-08-04 21:39:04,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-04 21:39:04,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 69. [2019-08-04 21:39:04,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-04 21:39:04,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2019-08-04 21:39:04,841 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 66 [2019-08-04 21:39:04,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:04,841 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2019-08-04 21:39:04,841 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-04 21:39:04,841 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2019-08-04 21:39:04,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-04 21:39:04,841 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:04,842 INFO L399 BasicCegarLoop]: trace histogram [22, 21, 21, 1, 1, 1, 1] [2019-08-04 21:39:04,842 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:04,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:04,842 INFO L82 PathProgramCache]: Analyzing trace with hash 391610418, now seen corresponding path program 41 times [2019-08-04 21:39:04,843 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:04,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:04,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-04 21:39:04,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:05,704 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 462 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:05,705 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:05,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-04 21:39:05,705 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-04 21:39:05,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-04 21:39:05,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=551, Invalid=1519, Unknown=0, NotChecked=0, Total=2070 [2019-08-04 21:39:05,706 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 46 states. [2019-08-04 21:39:06,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:06,547 INFO L93 Difference]: Finished difference Result 113 states and 114 transitions. [2019-08-04 21:39:06,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-04 21:39:06,547 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 68 [2019-08-04 21:39:06,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:06,548 INFO L225 Difference]: With dead ends: 113 [2019-08-04 21:39:06,549 INFO L226 Difference]: Without dead ends: 70 [2019-08-04 21:39:06,549 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 672 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1101, Invalid=3455, Unknown=0, NotChecked=0, Total=4556 [2019-08-04 21:39:06,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-04 21:39:06,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-08-04 21:39:06,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-04 21:39:06,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2019-08-04 21:39:06,551 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 68 [2019-08-04 21:39:06,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:06,552 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2019-08-04 21:39:06,552 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-04 21:39:06,552 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2019-08-04 21:39:06,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-04 21:39:06,552 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:06,553 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 21, 1, 1, 1, 1] [2019-08-04 21:39:06,553 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:06,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:06,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1511507991, now seen corresponding path program 42 times [2019-08-04 21:39:06,554 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:06,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:06,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-04 21:39:06,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:06,876 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:06,889 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 253 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:06,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:06,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-04 21:39:06,890 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-04 21:39:06,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-04 21:39:06,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=302, Invalid=348, Unknown=0, NotChecked=0, Total=650 [2019-08-04 21:39:06,891 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand 26 states. [2019-08-04 21:39:07,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:07,344 INFO L93 Difference]: Finished difference Result 76 states and 77 transitions. [2019-08-04 21:39:07,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-04 21:39:07,351 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 69 [2019-08-04 21:39:07,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:07,351 INFO L225 Difference]: With dead ends: 76 [2019-08-04 21:39:07,351 INFO L226 Difference]: Without dead ends: 76 [2019-08-04 21:39:07,352 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 506 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=900, Invalid=1452, Unknown=0, NotChecked=0, Total=2352 [2019-08-04 21:39:07,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-04 21:39:07,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 72. [2019-08-04 21:39:07,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-08-04 21:39:07,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2019-08-04 21:39:07,354 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 69 [2019-08-04 21:39:07,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:07,354 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2019-08-04 21:39:07,354 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-04 21:39:07,354 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2019-08-04 21:39:07,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-04 21:39:07,355 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:07,355 INFO L399 BasicCegarLoop]: trace histogram [23, 22, 22, 1, 1, 1, 1] [2019-08-04 21:39:07,355 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:07,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:07,355 INFO L82 PathProgramCache]: Analyzing trace with hash -860180989, now seen corresponding path program 43 times [2019-08-04 21:39:07,356 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:07,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:07,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-04 21:39:07,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:08,323 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 506 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:08,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:08,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-04 21:39:08,324 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-04 21:39:08,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-04 21:39:08,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=599, Invalid=1657, Unknown=0, NotChecked=0, Total=2256 [2019-08-04 21:39:08,325 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 48 states. [2019-08-04 21:39:09,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:09,260 INFO L93 Difference]: Finished difference Result 118 states and 119 transitions. [2019-08-04 21:39:09,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-04 21:39:09,261 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 71 [2019-08-04 21:39:09,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:09,261 INFO L225 Difference]: With dead ends: 118 [2019-08-04 21:39:09,262 INFO L226 Difference]: Without dead ends: 73 [2019-08-04 21:39:09,262 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 737 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1197, Invalid=3773, Unknown=0, NotChecked=0, Total=4970 [2019-08-04 21:39:09,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-04 21:39:09,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-08-04 21:39:09,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-04 21:39:09,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2019-08-04 21:39:09,264 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 71 [2019-08-04 21:39:09,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:09,264 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2019-08-04 21:39:09,264 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-04 21:39:09,265 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2019-08-04 21:39:09,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-04 21:39:09,265 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:09,265 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 22, 1, 1, 1, 1] [2019-08-04 21:39:09,265 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:09,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:09,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1202570988, now seen corresponding path program 44 times [2019-08-04 21:39:09,266 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:09,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:09,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-04 21:39:09,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:09,658 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:09,684 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 276 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:09,685 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:09,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-04 21:39:09,685 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-04 21:39:09,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-04 21:39:09,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=327, Invalid=375, Unknown=0, NotChecked=0, Total=702 [2019-08-04 21:39:09,686 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 27 states. [2019-08-04 21:39:10,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:10,107 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2019-08-04 21:39:10,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-04 21:39:10,108 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 72 [2019-08-04 21:39:10,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:10,109 INFO L225 Difference]: With dead ends: 79 [2019-08-04 21:39:10,109 INFO L226 Difference]: Without dead ends: 79 [2019-08-04 21:39:10,110 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=975, Invalid=1575, Unknown=0, NotChecked=0, Total=2550 [2019-08-04 21:39:10,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-04 21:39:10,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 75. [2019-08-04 21:39:10,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-04 21:39:10,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2019-08-04 21:39:10,113 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 72 [2019-08-04 21:39:10,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:10,113 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2019-08-04 21:39:10,113 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-04 21:39:10,113 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2019-08-04 21:39:10,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-04 21:39:10,114 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:10,114 INFO L399 BasicCegarLoop]: trace histogram [24, 23, 23, 1, 1, 1, 1] [2019-08-04 21:39:10,114 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:10,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:10,114 INFO L82 PathProgramCache]: Analyzing trace with hash 324569158, now seen corresponding path program 45 times [2019-08-04 21:39:10,115 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:10,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:10,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-04 21:39:10,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:11,224 INFO L134 CoverageAnalysis]: Checked inductivity of 828 backedges. 552 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:11,225 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:11,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-04 21:39:11,225 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-04 21:39:11,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-04 21:39:11,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=649, Invalid=1801, Unknown=0, NotChecked=0, Total=2450 [2019-08-04 21:39:11,226 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 50 states. [2019-08-04 21:39:12,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:12,052 INFO L93 Difference]: Finished difference Result 123 states and 124 transitions. [2019-08-04 21:39:12,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-04 21:39:12,053 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 74 [2019-08-04 21:39:12,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:12,053 INFO L225 Difference]: With dead ends: 123 [2019-08-04 21:39:12,054 INFO L226 Difference]: Without dead ends: 76 [2019-08-04 21:39:12,054 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 805 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1297, Invalid=4105, Unknown=0, NotChecked=0, Total=5402 [2019-08-04 21:39:12,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-04 21:39:12,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-08-04 21:39:12,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-04 21:39:12,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 77 transitions. [2019-08-04 21:39:12,056 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 77 transitions. Word has length 74 [2019-08-04 21:39:12,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:12,056 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 77 transitions. [2019-08-04 21:39:12,056 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-04 21:39:12,056 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2019-08-04 21:39:12,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-04 21:39:12,057 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:12,057 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 23, 1, 1, 1, 1] [2019-08-04 21:39:12,057 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:12,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:12,057 INFO L82 PathProgramCache]: Analyzing trace with hash -623355203, now seen corresponding path program 46 times [2019-08-04 21:39:12,058 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:12,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:12,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-04 21:39:12,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:12,668 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:12,772 INFO L134 CoverageAnalysis]: Checked inductivity of 852 backedges. 300 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:12,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:12,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-04 21:39:12,773 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-04 21:39:12,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-04 21:39:12,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=353, Invalid=403, Unknown=0, NotChecked=0, Total=756 [2019-08-04 21:39:12,773 INFO L87 Difference]: Start difference. First operand 76 states and 77 transitions. Second operand 28 states. [2019-08-04 21:39:13,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:13,238 INFO L93 Difference]: Finished difference Result 82 states and 83 transitions. [2019-08-04 21:39:13,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-04 21:39:13,238 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 75 [2019-08-04 21:39:13,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:13,239 INFO L225 Difference]: With dead ends: 82 [2019-08-04 21:39:13,239 INFO L226 Difference]: Without dead ends: 82 [2019-08-04 21:39:13,240 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 600 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1053, Invalid=1703, Unknown=0, NotChecked=0, Total=2756 [2019-08-04 21:39:13,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-04 21:39:13,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 78. [2019-08-04 21:39:13,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-08-04 21:39:13,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2019-08-04 21:39:13,243 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 75 [2019-08-04 21:39:13,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:13,243 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2019-08-04 21:39:13,243 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-04 21:39:13,243 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2019-08-04 21:39:13,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-04 21:39:13,244 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:13,244 INFO L399 BasicCegarLoop]: trace histogram [25, 24, 24, 1, 1, 1, 1] [2019-08-04 21:39:13,244 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:13,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:13,244 INFO L82 PathProgramCache]: Analyzing trace with hash -2043843625, now seen corresponding path program 47 times [2019-08-04 21:39:13,245 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:13,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:13,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-04 21:39:13,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:14,701 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 600 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:14,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:14,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-04 21:39:14,702 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-04 21:39:14,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-04 21:39:14,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=701, Invalid=1951, Unknown=0, NotChecked=0, Total=2652 [2019-08-04 21:39:14,703 INFO L87 Difference]: Start difference. First operand 78 states and 79 transitions. Second operand 52 states. [2019-08-04 21:39:16,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:16,282 INFO L93 Difference]: Finished difference Result 128 states and 129 transitions. [2019-08-04 21:39:16,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-04 21:39:16,282 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 77 [2019-08-04 21:39:16,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:16,283 INFO L225 Difference]: With dead ends: 128 [2019-08-04 21:39:16,283 INFO L226 Difference]: Without dead ends: 79 [2019-08-04 21:39:16,284 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 876 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1401, Invalid=4451, Unknown=0, NotChecked=0, Total=5852 [2019-08-04 21:39:16,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-04 21:39:16,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-08-04 21:39:16,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-04 21:39:16,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2019-08-04 21:39:16,286 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 77 [2019-08-04 21:39:16,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:16,286 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2019-08-04 21:39:16,286 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-04 21:39:16,286 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2019-08-04 21:39:16,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-04 21:39:16,287 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:16,287 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 24, 1, 1, 1, 1] [2019-08-04 21:39:16,287 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:16,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:16,287 INFO L82 PathProgramCache]: Analyzing trace with hash 2046456320, now seen corresponding path program 48 times [2019-08-04 21:39:16,288 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:16,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:16,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-04 21:39:16,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:16,602 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:16,683 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 325 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:16,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:16,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-04 21:39:16,684 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-04 21:39:16,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-04 21:39:16,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=380, Invalid=432, Unknown=0, NotChecked=0, Total=812 [2019-08-04 21:39:16,685 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 29 states. [2019-08-04 21:39:17,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:17,735 INFO L93 Difference]: Finished difference Result 85 states and 86 transitions. [2019-08-04 21:39:17,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-04 21:39:17,736 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 78 [2019-08-04 21:39:17,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:17,736 INFO L225 Difference]: With dead ends: 85 [2019-08-04 21:39:17,737 INFO L226 Difference]: Without dead ends: 85 [2019-08-04 21:39:17,737 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 650 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1134, Invalid=1836, Unknown=0, NotChecked=0, Total=2970 [2019-08-04 21:39:17,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-08-04 21:39:17,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2019-08-04 21:39:17,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-04 21:39:17,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2019-08-04 21:39:17,740 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 78 [2019-08-04 21:39:17,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:17,741 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2019-08-04 21:39:17,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-04 21:39:17,741 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2019-08-04 21:39:17,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-08-04 21:39:17,741 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:17,741 INFO L399 BasicCegarLoop]: trace histogram [26, 25, 25, 1, 1, 1, 1] [2019-08-04 21:39:17,742 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:17,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:17,742 INFO L82 PathProgramCache]: Analyzing trace with hash -450445734, now seen corresponding path program 49 times [2019-08-04 21:39:17,742 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:17,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:17,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-04 21:39:17,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:18,830 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 650 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:18,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:18,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-04 21:39:18,831 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-04 21:39:18,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-04 21:39:18,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=755, Invalid=2107, Unknown=0, NotChecked=0, Total=2862 [2019-08-04 21:39:18,832 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 54 states. [2019-08-04 21:39:20,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:20,440 INFO L93 Difference]: Finished difference Result 133 states and 134 transitions. [2019-08-04 21:39:20,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-04 21:39:20,440 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 80 [2019-08-04 21:39:20,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:20,441 INFO L225 Difference]: With dead ends: 133 [2019-08-04 21:39:20,442 INFO L226 Difference]: Without dead ends: 82 [2019-08-04 21:39:20,442 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 950 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1509, Invalid=4811, Unknown=0, NotChecked=0, Total=6320 [2019-08-04 21:39:20,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-04 21:39:20,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-08-04 21:39:20,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-08-04 21:39:20,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 83 transitions. [2019-08-04 21:39:20,444 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 83 transitions. Word has length 80 [2019-08-04 21:39:20,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:20,444 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 83 transitions. [2019-08-04 21:39:20,444 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-04 21:39:20,445 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 83 transitions. [2019-08-04 21:39:20,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-08-04 21:39:20,445 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:20,445 INFO L399 BasicCegarLoop]: trace histogram [26, 26, 25, 1, 1, 1, 1] [2019-08-04 21:39:20,445 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:20,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:20,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1158060945, now seen corresponding path program 50 times [2019-08-04 21:39:20,446 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:20,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:20,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-04 21:39:20,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:20,887 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:20,985 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 351 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:20,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:20,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-04 21:39:20,985 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-04 21:39:20,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-04 21:39:20,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=408, Invalid=462, Unknown=0, NotChecked=0, Total=870 [2019-08-04 21:39:20,986 INFO L87 Difference]: Start difference. First operand 82 states and 83 transitions. Second operand 30 states. [2019-08-04 21:39:21,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:21,506 INFO L93 Difference]: Finished difference Result 88 states and 89 transitions. [2019-08-04 21:39:21,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-04 21:39:21,506 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 81 [2019-08-04 21:39:21,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:21,507 INFO L225 Difference]: With dead ends: 88 [2019-08-04 21:39:21,507 INFO L226 Difference]: Without dead ends: 88 [2019-08-04 21:39:21,508 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 702 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1218, Invalid=1974, Unknown=0, NotChecked=0, Total=3192 [2019-08-04 21:39:21,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-08-04 21:39:21,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 84. [2019-08-04 21:39:21,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-08-04 21:39:21,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 85 transitions. [2019-08-04 21:39:21,511 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 85 transitions. Word has length 81 [2019-08-04 21:39:21,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:21,512 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 85 transitions. [2019-08-04 21:39:21,512 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-04 21:39:21,512 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2019-08-04 21:39:21,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-08-04 21:39:21,512 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:21,512 INFO L399 BasicCegarLoop]: trace histogram [27, 26, 26, 1, 1, 1, 1] [2019-08-04 21:39:21,513 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:21,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:21,513 INFO L82 PathProgramCache]: Analyzing trace with hash 500090795, now seen corresponding path program 51 times [2019-08-04 21:39:21,514 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:21,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:21,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-04 21:39:21,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:23,168 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 702 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:23,169 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:23,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-04 21:39:23,169 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-04 21:39:23,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-04 21:39:23,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=811, Invalid=2269, Unknown=0, NotChecked=0, Total=3080 [2019-08-04 21:39:23,170 INFO L87 Difference]: Start difference. First operand 84 states and 85 transitions. Second operand 56 states. [2019-08-04 21:39:24,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:24,944 INFO L93 Difference]: Finished difference Result 138 states and 139 transitions. [2019-08-04 21:39:24,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-04 21:39:24,944 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 83 [2019-08-04 21:39:24,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:24,945 INFO L225 Difference]: With dead ends: 138 [2019-08-04 21:39:24,945 INFO L226 Difference]: Without dead ends: 85 [2019-08-04 21:39:24,946 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1027 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1621, Invalid=5185, Unknown=0, NotChecked=0, Total=6806 [2019-08-04 21:39:24,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-08-04 21:39:24,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-08-04 21:39:24,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-04 21:39:24,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2019-08-04 21:39:24,948 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 83 [2019-08-04 21:39:24,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:24,949 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2019-08-04 21:39:24,949 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-04 21:39:24,949 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2019-08-04 21:39:24,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-08-04 21:39:24,949 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:24,949 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 26, 1, 1, 1, 1] [2019-08-04 21:39:24,950 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:24,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:24,950 INFO L82 PathProgramCache]: Analyzing trace with hash 572443412, now seen corresponding path program 52 times [2019-08-04 21:39:24,950 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:24,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:24,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-04 21:39:24,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:25,351 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:25,414 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 378 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:25,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:25,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-04 21:39:25,415 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-04 21:39:25,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-04 21:39:25,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=437, Invalid=493, Unknown=0, NotChecked=0, Total=930 [2019-08-04 21:39:25,415 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 31 states. [2019-08-04 21:39:26,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:26,063 INFO L93 Difference]: Finished difference Result 91 states and 92 transitions. [2019-08-04 21:39:26,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-04 21:39:26,064 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 84 [2019-08-04 21:39:26,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:26,065 INFO L225 Difference]: With dead ends: 91 [2019-08-04 21:39:26,065 INFO L226 Difference]: Without dead ends: 91 [2019-08-04 21:39:26,066 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 756 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1305, Invalid=2117, Unknown=0, NotChecked=0, Total=3422 [2019-08-04 21:39:26,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-08-04 21:39:26,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 87. [2019-08-04 21:39:26,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-08-04 21:39:26,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2019-08-04 21:39:26,068 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 84 [2019-08-04 21:39:26,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:26,069 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2019-08-04 21:39:26,069 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-04 21:39:26,069 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2019-08-04 21:39:26,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-08-04 21:39:26,069 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:26,069 INFO L399 BasicCegarLoop]: trace histogram [28, 27, 27, 1, 1, 1, 1] [2019-08-04 21:39:26,069 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:26,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:26,070 INFO L82 PathProgramCache]: Analyzing trace with hash 362357358, now seen corresponding path program 53 times [2019-08-04 21:39:26,071 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:26,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:26,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-04 21:39:26,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:28,765 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 756 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:28,766 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:28,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-04 21:39:28,766 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-04 21:39:28,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-04 21:39:28,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=869, Invalid=2437, Unknown=0, NotChecked=0, Total=3306 [2019-08-04 21:39:28,767 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 58 states. [2019-08-04 21:39:30,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:30,395 INFO L93 Difference]: Finished difference Result 143 states and 144 transitions. [2019-08-04 21:39:30,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-04 21:39:30,395 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 86 [2019-08-04 21:39:30,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:30,396 INFO L225 Difference]: With dead ends: 143 [2019-08-04 21:39:30,396 INFO L226 Difference]: Without dead ends: 88 [2019-08-04 21:39:30,397 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1107 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1737, Invalid=5573, Unknown=0, NotChecked=0, Total=7310 [2019-08-04 21:39:30,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-08-04 21:39:30,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-08-04 21:39:30,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-08-04 21:39:30,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 89 transitions. [2019-08-04 21:39:30,399 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 89 transitions. Word has length 86 [2019-08-04 21:39:30,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:30,400 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 89 transitions. [2019-08-04 21:39:30,400 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-04 21:39:30,400 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 89 transitions. [2019-08-04 21:39:30,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-08-04 21:39:30,400 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:30,400 INFO L399 BasicCegarLoop]: trace histogram [28, 28, 27, 1, 1, 1, 1] [2019-08-04 21:39:30,401 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:30,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:30,401 INFO L82 PathProgramCache]: Analyzing trace with hash -254412187, now seen corresponding path program 54 times [2019-08-04 21:39:30,402 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:30,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:30,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-04 21:39:30,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:30,831 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:30,848 INFO L134 CoverageAnalysis]: Checked inductivity of 1162 backedges. 406 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:30,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:30,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-04 21:39:30,849 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-04 21:39:30,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-04 21:39:30,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=467, Invalid=525, Unknown=0, NotChecked=0, Total=992 [2019-08-04 21:39:30,850 INFO L87 Difference]: Start difference. First operand 88 states and 89 transitions. Second operand 32 states. [2019-08-04 21:39:31,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:31,390 INFO L93 Difference]: Finished difference Result 94 states and 95 transitions. [2019-08-04 21:39:31,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-04 21:39:31,390 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 87 [2019-08-04 21:39:31,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:31,391 INFO L225 Difference]: With dead ends: 94 [2019-08-04 21:39:31,391 INFO L226 Difference]: Without dead ends: 94 [2019-08-04 21:39:31,392 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 812 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1395, Invalid=2265, Unknown=0, NotChecked=0, Total=3660 [2019-08-04 21:39:31,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-08-04 21:39:31,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2019-08-04 21:39:31,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-08-04 21:39:31,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 91 transitions. [2019-08-04 21:39:31,395 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 91 transitions. Word has length 87 [2019-08-04 21:39:31,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:31,396 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 91 transitions. [2019-08-04 21:39:31,396 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-04 21:39:31,396 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 91 transitions. [2019-08-04 21:39:31,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-08-04 21:39:31,396 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:31,396 INFO L399 BasicCegarLoop]: trace histogram [29, 28, 28, 1, 1, 1, 1] [2019-08-04 21:39:31,397 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:31,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:31,397 INFO L82 PathProgramCache]: Analyzing trace with hash 323076479, now seen corresponding path program 55 times [2019-08-04 21:39:31,398 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:31,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:31,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-04 21:39:31,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:32,955 INFO L134 CoverageAnalysis]: Checked inductivity of 1218 backedges. 812 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:32,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:32,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-04 21:39:32,956 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-04 21:39:32,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-04 21:39:32,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=929, Invalid=2611, Unknown=0, NotChecked=0, Total=3540 [2019-08-04 21:39:32,956 INFO L87 Difference]: Start difference. First operand 90 states and 91 transitions. Second operand 60 states. [2019-08-04 21:39:34,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:34,537 INFO L93 Difference]: Finished difference Result 148 states and 149 transitions. [2019-08-04 21:39:34,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-04 21:39:34,537 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 89 [2019-08-04 21:39:34,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:34,539 INFO L225 Difference]: With dead ends: 148 [2019-08-04 21:39:34,539 INFO L226 Difference]: Without dead ends: 91 [2019-08-04 21:39:34,540 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1190 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1857, Invalid=5975, Unknown=0, NotChecked=0, Total=7832 [2019-08-04 21:39:34,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-08-04 21:39:34,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-08-04 21:39:34,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-08-04 21:39:34,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2019-08-04 21:39:34,542 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 89 [2019-08-04 21:39:34,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:34,542 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2019-08-04 21:39:34,542 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-04 21:39:34,542 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2019-08-04 21:39:34,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-08-04 21:39:34,543 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:34,543 INFO L399 BasicCegarLoop]: trace histogram [29, 29, 28, 1, 1, 1, 1] [2019-08-04 21:39:34,543 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:34,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:34,543 INFO L82 PathProgramCache]: Analyzing trace with hash 11653672, now seen corresponding path program 56 times [2019-08-04 21:39:34,544 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:34,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:34,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-04 21:39:34,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:34,988 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:35,037 INFO L134 CoverageAnalysis]: Checked inductivity of 1247 backedges. 435 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:35,038 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:35,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-04 21:39:35,038 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-04 21:39:35,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-04 21:39:35,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=498, Invalid=558, Unknown=0, NotChecked=0, Total=1056 [2019-08-04 21:39:35,039 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 33 states. [2019-08-04 21:39:35,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:35,664 INFO L93 Difference]: Finished difference Result 97 states and 98 transitions. [2019-08-04 21:39:35,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-04 21:39:35,665 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 90 [2019-08-04 21:39:35,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:35,666 INFO L225 Difference]: With dead ends: 97 [2019-08-04 21:39:35,666 INFO L226 Difference]: Without dead ends: 97 [2019-08-04 21:39:35,667 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 870 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1488, Invalid=2418, Unknown=0, NotChecked=0, Total=3906 [2019-08-04 21:39:35,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-08-04 21:39:35,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2019-08-04 21:39:35,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-08-04 21:39:35,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2019-08-04 21:39:35,668 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 90 [2019-08-04 21:39:35,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:35,668 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2019-08-04 21:39:35,669 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-04 21:39:35,669 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2019-08-04 21:39:35,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-08-04 21:39:35,669 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:35,674 INFO L399 BasicCegarLoop]: trace histogram [30, 29, 29, 1, 1, 1, 1] [2019-08-04 21:39:35,674 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:35,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:35,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1685670782, now seen corresponding path program 57 times [2019-08-04 21:39:35,675 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:35,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:35,711 INFO L256 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-04 21:39:35,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:37,170 INFO L134 CoverageAnalysis]: Checked inductivity of 1305 backedges. 870 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:37,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:37,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-04 21:39:37,171 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-04 21:39:37,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-04 21:39:37,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=991, Invalid=2791, Unknown=0, NotChecked=0, Total=3782 [2019-08-04 21:39:37,171 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand 62 states. [2019-08-04 21:39:39,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:39,217 INFO L93 Difference]: Finished difference Result 153 states and 154 transitions. [2019-08-04 21:39:39,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-04 21:39:39,217 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 92 [2019-08-04 21:39:39,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:39,218 INFO L225 Difference]: With dead ends: 153 [2019-08-04 21:39:39,218 INFO L226 Difference]: Without dead ends: 94 [2019-08-04 21:39:39,219 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1276 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1981, Invalid=6391, Unknown=0, NotChecked=0, Total=8372 [2019-08-04 21:39:39,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-08-04 21:39:39,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-08-04 21:39:39,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-08-04 21:39:39,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 95 transitions. [2019-08-04 21:39:39,221 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 95 transitions. Word has length 92 [2019-08-04 21:39:39,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:39,221 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 95 transitions. [2019-08-04 21:39:39,221 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-04 21:39:39,221 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 95 transitions. [2019-08-04 21:39:39,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-04 21:39:39,222 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:39,222 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 29, 1, 1, 1, 1] [2019-08-04 21:39:39,222 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:39,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:39,222 INFO L82 PathProgramCache]: Analyzing trace with hash 2141812537, now seen corresponding path program 58 times [2019-08-04 21:39:39,223 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:39,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:39,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-04 21:39:39,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:39,636 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:39,658 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 465 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:39,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:39,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-04 21:39:39,658 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-04 21:39:39,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-04 21:39:39,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=530, Invalid=592, Unknown=0, NotChecked=0, Total=1122 [2019-08-04 21:39:39,659 INFO L87 Difference]: Start difference. First operand 94 states and 95 transitions. Second operand 34 states. [2019-08-04 21:39:40,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:40,284 INFO L93 Difference]: Finished difference Result 100 states and 101 transitions. [2019-08-04 21:39:40,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-04 21:39:40,285 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 93 [2019-08-04 21:39:40,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:40,285 INFO L225 Difference]: With dead ends: 100 [2019-08-04 21:39:40,286 INFO L226 Difference]: Without dead ends: 100 [2019-08-04 21:39:40,286 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 930 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1584, Invalid=2576, Unknown=0, NotChecked=0, Total=4160 [2019-08-04 21:39:40,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-08-04 21:39:40,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 96. [2019-08-04 21:39:40,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-08-04 21:39:40,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 97 transitions. [2019-08-04 21:39:40,288 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 97 transitions. Word has length 93 [2019-08-04 21:39:40,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:40,289 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 97 transitions. [2019-08-04 21:39:40,289 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-04 21:39:40,289 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 97 transitions. [2019-08-04 21:39:40,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-08-04 21:39:40,289 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:40,289 INFO L399 BasicCegarLoop]: trace histogram [31, 30, 30, 1, 1, 1, 1] [2019-08-04 21:39:40,290 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:40,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:40,290 INFO L82 PathProgramCache]: Analyzing trace with hash 992565587, now seen corresponding path program 59 times [2019-08-04 21:39:40,290 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:40,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:40,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-04 21:39:40,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:42,326 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 930 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:42,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:42,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-04 21:39:42,327 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-04 21:39:42,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-04 21:39:42,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1055, Invalid=2977, Unknown=0, NotChecked=0, Total=4032 [2019-08-04 21:39:42,327 INFO L87 Difference]: Start difference. First operand 96 states and 97 transitions. Second operand 64 states. [2019-08-04 21:39:43,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:43,785 INFO L93 Difference]: Finished difference Result 158 states and 159 transitions. [2019-08-04 21:39:43,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-04 21:39:43,785 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 95 [2019-08-04 21:39:43,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:43,786 INFO L225 Difference]: With dead ends: 158 [2019-08-04 21:39:43,786 INFO L226 Difference]: Without dead ends: 97 [2019-08-04 21:39:43,786 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1365 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=2109, Invalid=6821, Unknown=0, NotChecked=0, Total=8930 [2019-08-04 21:39:43,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-08-04 21:39:43,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-08-04 21:39:43,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-08-04 21:39:43,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2019-08-04 21:39:43,788 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 95 [2019-08-04 21:39:43,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:43,788 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2019-08-04 21:39:43,788 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-04 21:39:43,788 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2019-08-04 21:39:43,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-08-04 21:39:43,789 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:43,789 INFO L399 BasicCegarLoop]: trace histogram [31, 31, 30, 1, 1, 1, 1] [2019-08-04 21:39:43,789 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:43,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:43,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1538619588, now seen corresponding path program 60 times [2019-08-04 21:39:43,790 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:43,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:43,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-04 21:39:43,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:44,593 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:44,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 496 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:44,613 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:44,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-04 21:39:44,613 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-04 21:39:44,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-04 21:39:44,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=563, Invalid=627, Unknown=0, NotChecked=0, Total=1190 [2019-08-04 21:39:44,613 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 35 states. [2019-08-04 21:39:45,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:45,301 INFO L93 Difference]: Finished difference Result 103 states and 104 transitions. [2019-08-04 21:39:45,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-04 21:39:45,301 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 96 [2019-08-04 21:39:45,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:45,302 INFO L225 Difference]: With dead ends: 103 [2019-08-04 21:39:45,302 INFO L226 Difference]: Without dead ends: 103 [2019-08-04 21:39:45,303 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 992 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1683, Invalid=2739, Unknown=0, NotChecked=0, Total=4422 [2019-08-04 21:39:45,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-08-04 21:39:45,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 99. [2019-08-04 21:39:45,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-04 21:39:45,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2019-08-04 21:39:45,305 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 96 [2019-08-04 21:39:45,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:45,305 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2019-08-04 21:39:45,305 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-04 21:39:45,305 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2019-08-04 21:39:45,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-08-04 21:39:45,306 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:45,306 INFO L399 BasicCegarLoop]: trace histogram [32, 31, 31, 1, 1, 1, 1] [2019-08-04 21:39:45,306 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:45,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:45,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1144621930, now seen corresponding path program 61 times [2019-08-04 21:39:45,307 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:45,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:45,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-04 21:39:45,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:46,940 INFO L134 CoverageAnalysis]: Checked inductivity of 1488 backedges. 992 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:46,940 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:46,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-04 21:39:46,941 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-04 21:39:46,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-04 21:39:46,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1121, Invalid=3169, Unknown=0, NotChecked=0, Total=4290 [2019-08-04 21:39:46,942 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 66 states. [2019-08-04 21:39:49,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:49,450 INFO L93 Difference]: Finished difference Result 163 states and 164 transitions. [2019-08-04 21:39:49,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-04 21:39:49,450 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 98 [2019-08-04 21:39:49,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:49,451 INFO L225 Difference]: With dead ends: 163 [2019-08-04 21:39:49,451 INFO L226 Difference]: Without dead ends: 100 [2019-08-04 21:39:49,452 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1457 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2241, Invalid=7265, Unknown=0, NotChecked=0, Total=9506 [2019-08-04 21:39:49,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-08-04 21:39:49,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-08-04 21:39:49,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-08-04 21:39:49,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2019-08-04 21:39:49,454 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 98 [2019-08-04 21:39:49,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:49,454 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2019-08-04 21:39:49,454 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-04 21:39:49,454 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2019-08-04 21:39:49,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-08-04 21:39:49,455 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:49,455 INFO L399 BasicCegarLoop]: trace histogram [32, 32, 31, 1, 1, 1, 1] [2019-08-04 21:39:49,455 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:49,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:49,455 INFO L82 PathProgramCache]: Analyzing trace with hash -941354483, now seen corresponding path program 62 times [2019-08-04 21:39:49,456 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:49,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:49,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-04 21:39:49,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:50,130 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:50,363 INFO L134 CoverageAnalysis]: Checked inductivity of 1520 backedges. 528 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:50,363 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:50,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-04 21:39:50,364 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-04 21:39:50,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-04 21:39:50,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=597, Invalid=663, Unknown=0, NotChecked=0, Total=1260 [2019-08-04 21:39:50,364 INFO L87 Difference]: Start difference. First operand 100 states and 101 transitions. Second operand 36 states. [2019-08-04 21:39:51,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:51,036 INFO L93 Difference]: Finished difference Result 106 states and 107 transitions. [2019-08-04 21:39:51,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-04 21:39:51,036 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 99 [2019-08-04 21:39:51,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:51,038 INFO L225 Difference]: With dead ends: 106 [2019-08-04 21:39:51,038 INFO L226 Difference]: Without dead ends: 106 [2019-08-04 21:39:51,039 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1056 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1785, Invalid=2907, Unknown=0, NotChecked=0, Total=4692 [2019-08-04 21:39:51,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-08-04 21:39:51,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 102. [2019-08-04 21:39:51,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-08-04 21:39:51,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 103 transitions. [2019-08-04 21:39:51,041 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 103 transitions. Word has length 99 [2019-08-04 21:39:51,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:51,041 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 103 transitions. [2019-08-04 21:39:51,041 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-04 21:39:51,041 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 103 transitions. [2019-08-04 21:39:51,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-04 21:39:51,042 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:51,042 INFO L399 BasicCegarLoop]: trace histogram [33, 32, 32, 1, 1, 1, 1] [2019-08-04 21:39:51,042 INFO L418 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:51,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:51,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1596493607, now seen corresponding path program 63 times [2019-08-04 21:39:51,043 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:51,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:51,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-04 21:39:51,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:52,757 INFO L134 CoverageAnalysis]: Checked inductivity of 1584 backedges. 1056 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:52,757 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:52,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-04 21:39:52,758 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-04 21:39:52,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-04 21:39:52,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1189, Invalid=3367, Unknown=0, NotChecked=0, Total=4556 [2019-08-04 21:39:52,758 INFO L87 Difference]: Start difference. First operand 102 states and 103 transitions. Second operand 68 states. [2019-08-04 21:39:55,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:55,585 INFO L93 Difference]: Finished difference Result 168 states and 169 transitions. [2019-08-04 21:39:55,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-04 21:39:55,586 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 101 [2019-08-04 21:39:55,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:55,587 INFO L225 Difference]: With dead ends: 168 [2019-08-04 21:39:55,587 INFO L226 Difference]: Without dead ends: 103 [2019-08-04 21:39:55,588 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1552 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2377, Invalid=7723, Unknown=0, NotChecked=0, Total=10100 [2019-08-04 21:39:55,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-08-04 21:39:55,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-08-04 21:39:55,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-04 21:39:55,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2019-08-04 21:39:55,589 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 101 [2019-08-04 21:39:55,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:55,589 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2019-08-04 21:39:55,590 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-04 21:39:55,590 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2019-08-04 21:39:55,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-08-04 21:39:55,590 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:55,590 INFO L399 BasicCegarLoop]: trace histogram [33, 33, 32, 1, 1, 1, 1] [2019-08-04 21:39:55,590 INFO L418 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:55,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:55,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1233119824, now seen corresponding path program 64 times [2019-08-04 21:39:55,591 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:55,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:55,637 INFO L256 TraceCheckSpWp]: Trace formula consists of 517 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-04 21:39:55,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:56,165 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:39:56,186 INFO L134 CoverageAnalysis]: Checked inductivity of 1617 backedges. 561 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:56,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:56,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-04 21:39:56,187 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-04 21:39:56,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-04 21:39:56,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=632, Invalid=700, Unknown=0, NotChecked=0, Total=1332 [2019-08-04 21:39:56,187 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 37 states. [2019-08-04 21:39:56,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:56,862 INFO L93 Difference]: Finished difference Result 109 states and 110 transitions. [2019-08-04 21:39:56,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-04 21:39:56,863 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 102 [2019-08-04 21:39:56,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:56,864 INFO L225 Difference]: With dead ends: 109 [2019-08-04 21:39:56,864 INFO L226 Difference]: Without dead ends: 109 [2019-08-04 21:39:56,864 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1122 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1890, Invalid=3080, Unknown=0, NotChecked=0, Total=4970 [2019-08-04 21:39:56,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-08-04 21:39:56,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 105. [2019-08-04 21:39:56,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-04 21:39:56,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2019-08-04 21:39:56,867 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 102 [2019-08-04 21:39:56,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:56,867 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2019-08-04 21:39:56,867 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-04 21:39:56,867 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2019-08-04 21:39:56,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-08-04 21:39:56,868 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:56,868 INFO L399 BasicCegarLoop]: trace histogram [34, 33, 33, 1, 1, 1, 1] [2019-08-04 21:39:56,868 INFO L418 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:56,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:56,868 INFO L82 PathProgramCache]: Analyzing trace with hash -382770518, now seen corresponding path program 65 times [2019-08-04 21:39:56,869 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:56,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:56,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 72 conjunts are in the unsatisfiable core [2019-08-04 21:39:56,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:59,022 INFO L134 CoverageAnalysis]: Checked inductivity of 1683 backedges. 1122 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:59,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:59,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-04 21:39:59,022 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-04 21:39:59,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-04 21:39:59,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1259, Invalid=3571, Unknown=0, NotChecked=0, Total=4830 [2019-08-04 21:39:59,023 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 70 states. [2019-08-04 21:40:00,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:40:00,854 INFO L93 Difference]: Finished difference Result 173 states and 174 transitions. [2019-08-04 21:40:00,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-04 21:40:00,854 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 104 [2019-08-04 21:40:00,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:40:00,855 INFO L225 Difference]: With dead ends: 173 [2019-08-04 21:40:00,855 INFO L226 Difference]: Without dead ends: 106 [2019-08-04 21:40:00,856 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1650 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=2517, Invalid=8195, Unknown=0, NotChecked=0, Total=10712 [2019-08-04 21:40:00,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-08-04 21:40:00,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-08-04 21:40:00,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-08-04 21:40:00,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 107 transitions. [2019-08-04 21:40:00,857 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 107 transitions. Word has length 104 [2019-08-04 21:40:00,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:40:00,858 INFO L475 AbstractCegarLoop]: Abstraction has 106 states and 107 transitions. [2019-08-04 21:40:00,858 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-04 21:40:00,858 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 107 transitions. [2019-08-04 21:40:00,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-08-04 21:40:00,858 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:40:00,859 INFO L399 BasicCegarLoop]: trace histogram [34, 34, 33, 1, 1, 1, 1] [2019-08-04 21:40:00,859 INFO L418 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:40:00,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:40:00,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1961413345, now seen corresponding path program 66 times [2019-08-04 21:40:00,860 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:40:00,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:40:00,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 72 conjunts are in the unsatisfiable core [2019-08-04 21:40:00,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:40:01,368 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:01,412 INFO L134 CoverageAnalysis]: Checked inductivity of 1717 backedges. 595 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:40:01,412 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:40:01,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-04 21:40:01,412 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-04 21:40:01,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-04 21:40:01,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=668, Invalid=738, Unknown=0, NotChecked=0, Total=1406 [2019-08-04 21:40:01,413 INFO L87 Difference]: Start difference. First operand 106 states and 107 transitions. Second operand 38 states. [2019-08-04 21:40:02,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:40:02,138 INFO L93 Difference]: Finished difference Result 112 states and 113 transitions. [2019-08-04 21:40:02,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-04 21:40:02,139 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 105 [2019-08-04 21:40:02,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:40:02,140 INFO L225 Difference]: With dead ends: 112 [2019-08-04 21:40:02,140 INFO L226 Difference]: Without dead ends: 112 [2019-08-04 21:40:02,141 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1190 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1998, Invalid=3258, Unknown=0, NotChecked=0, Total=5256 [2019-08-04 21:40:02,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-08-04 21:40:02,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 108. [2019-08-04 21:40:02,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-08-04 21:40:02,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 109 transitions. [2019-08-04 21:40:02,143 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 109 transitions. Word has length 105 [2019-08-04 21:40:02,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:40:02,143 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 109 transitions. [2019-08-04 21:40:02,143 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-04 21:40:02,143 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 109 transitions. [2019-08-04 21:40:02,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-08-04 21:40:02,144 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:40:02,144 INFO L399 BasicCegarLoop]: trace histogram [35, 34, 34, 1, 1, 1, 1] [2019-08-04 21:40:02,144 INFO L418 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:40:02,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:40:02,144 INFO L82 PathProgramCache]: Analyzing trace with hash -572366085, now seen corresponding path program 67 times [2019-08-04 21:40:02,145 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:40:02,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:40:02,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-04 21:40:02,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:40:04,273 INFO L134 CoverageAnalysis]: Checked inductivity of 1785 backedges. 1190 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:40:04,273 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:40:04,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-04 21:40:04,274 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-04 21:40:04,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-04 21:40:04,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1331, Invalid=3781, Unknown=0, NotChecked=0, Total=5112 [2019-08-04 21:40:04,275 INFO L87 Difference]: Start difference. First operand 108 states and 109 transitions. Second operand 72 states. [2019-08-04 21:40:05,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:40:05,772 INFO L93 Difference]: Finished difference Result 178 states and 179 transitions. [2019-08-04 21:40:05,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-04 21:40:05,772 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 107 [2019-08-04 21:40:05,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:40:05,773 INFO L225 Difference]: With dead ends: 178 [2019-08-04 21:40:05,773 INFO L226 Difference]: Without dead ends: 109 [2019-08-04 21:40:05,774 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1751 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=2661, Invalid=8681, Unknown=0, NotChecked=0, Total=11342 [2019-08-04 21:40:05,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-08-04 21:40:05,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-08-04 21:40:05,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-04 21:40:05,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2019-08-04 21:40:05,776 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 107 [2019-08-04 21:40:05,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:40:05,776 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2019-08-04 21:40:05,776 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-04 21:40:05,776 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2019-08-04 21:40:05,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-08-04 21:40:05,776 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:40:05,776 INFO L399 BasicCegarLoop]: trace histogram [35, 35, 34, 1, 1, 1, 1] [2019-08-04 21:40:05,777 INFO L418 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:40:05,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:40:05,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1159136412, now seen corresponding path program 68 times [2019-08-04 21:40:05,777 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:40:05,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:40:05,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-04 21:40:05,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:40:06,313 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:06,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1820 backedges. 630 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:40:06,336 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:40:06,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-04 21:40:06,337 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-04 21:40:06,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-04 21:40:06,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=705, Invalid=777, Unknown=0, NotChecked=0, Total=1482 [2019-08-04 21:40:06,337 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 39 states. [2019-08-04 21:40:07,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:40:07,078 INFO L93 Difference]: Finished difference Result 115 states and 116 transitions. [2019-08-04 21:40:07,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-04 21:40:07,078 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 108 [2019-08-04 21:40:07,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:40:07,079 INFO L225 Difference]: With dead ends: 115 [2019-08-04 21:40:07,079 INFO L226 Difference]: Without dead ends: 115 [2019-08-04 21:40:07,080 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1260 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=2109, Invalid=3441, Unknown=0, NotChecked=0, Total=5550 [2019-08-04 21:40:07,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-08-04 21:40:07,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 111. [2019-08-04 21:40:07,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-08-04 21:40:07,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2019-08-04 21:40:07,082 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 108 [2019-08-04 21:40:07,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:40:07,083 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2019-08-04 21:40:07,083 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-04 21:40:07,083 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2019-08-04 21:40:07,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-08-04 21:40:07,083 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:40:07,084 INFO L399 BasicCegarLoop]: trace histogram [36, 35, 35, 1, 1, 1, 1] [2019-08-04 21:40:07,084 INFO L418 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:40:07,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:40:07,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1533509954, now seen corresponding path program 69 times [2019-08-04 21:40:07,084 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:40:07,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:40:07,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-04 21:40:07,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:40:09,317 INFO L134 CoverageAnalysis]: Checked inductivity of 1890 backedges. 1260 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:40:09,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:40:09,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-04 21:40:09,317 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-04 21:40:09,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-04 21:40:09,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1405, Invalid=3997, Unknown=0, NotChecked=0, Total=5402 [2019-08-04 21:40:09,318 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand 74 states. [2019-08-04 21:40:10,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:40:10,978 INFO L93 Difference]: Finished difference Result 183 states and 184 transitions. [2019-08-04 21:40:10,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-04 21:40:10,979 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 110 [2019-08-04 21:40:10,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:40:10,980 INFO L225 Difference]: With dead ends: 183 [2019-08-04 21:40:10,980 INFO L226 Difference]: Without dead ends: 112 [2019-08-04 21:40:10,981 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1855 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=2809, Invalid=9181, Unknown=0, NotChecked=0, Total=11990 [2019-08-04 21:40:10,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-08-04 21:40:10,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-08-04 21:40:10,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-08-04 21:40:10,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 113 transitions. [2019-08-04 21:40:10,984 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 113 transitions. Word has length 110 [2019-08-04 21:40:10,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:40:10,985 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 113 transitions. [2019-08-04 21:40:10,985 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-04 21:40:10,985 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 113 transitions. [2019-08-04 21:40:10,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-08-04 21:40:10,986 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:40:10,986 INFO L399 BasicCegarLoop]: trace histogram [36, 36, 35, 1, 1, 1, 1] [2019-08-04 21:40:10,987 INFO L418 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:40:10,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:40:10,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1491426891, now seen corresponding path program 70 times [2019-08-04 21:40:10,988 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:40:11,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:40:11,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 562 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-04 21:40:11,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:40:11,775 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:11,856 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 666 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:40:11,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:40:11,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-04 21:40:11,856 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-04 21:40:11,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-04 21:40:11,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=743, Invalid=817, Unknown=0, NotChecked=0, Total=1560 [2019-08-04 21:40:11,857 INFO L87 Difference]: Start difference. First operand 112 states and 113 transitions. Second operand 40 states. [2019-08-04 21:40:12,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:40:12,626 INFO L93 Difference]: Finished difference Result 118 states and 119 transitions. [2019-08-04 21:40:12,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-04 21:40:12,626 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 111 [2019-08-04 21:40:12,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:40:12,627 INFO L225 Difference]: With dead ends: 118 [2019-08-04 21:40:12,627 INFO L226 Difference]: Without dead ends: 118 [2019-08-04 21:40:12,628 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1332 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2223, Invalid=3629, Unknown=0, NotChecked=0, Total=5852 [2019-08-04 21:40:12,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-08-04 21:40:12,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 114. [2019-08-04 21:40:12,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-08-04 21:40:12,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 115 transitions. [2019-08-04 21:40:12,631 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 115 transitions. Word has length 111 [2019-08-04 21:40:12,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:40:12,631 INFO L475 AbstractCegarLoop]: Abstraction has 114 states and 115 transitions. [2019-08-04 21:40:12,631 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-04 21:40:12,631 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 115 transitions. [2019-08-04 21:40:12,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-08-04 21:40:12,632 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:40:12,632 INFO L399 BasicCegarLoop]: trace histogram [37, 36, 36, 1, 1, 1, 1] [2019-08-04 21:40:12,632 INFO L418 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:40:12,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:40:12,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1257886927, now seen corresponding path program 71 times [2019-08-04 21:40:12,633 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:40:12,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:40:12,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 572 conjuncts, 78 conjunts are in the unsatisfiable core [2019-08-04 21:40:12,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:40:14,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1998 backedges. 1332 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:40:14,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:40:14,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-04 21:40:14,978 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-04 21:40:14,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-04 21:40:14,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1481, Invalid=4219, Unknown=0, NotChecked=0, Total=5700 [2019-08-04 21:40:14,979 INFO L87 Difference]: Start difference. First operand 114 states and 115 transitions. Second operand 76 states. [2019-08-04 21:40:17,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:40:17,104 INFO L93 Difference]: Finished difference Result 188 states and 189 transitions. [2019-08-04 21:40:17,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-04 21:40:17,104 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 113 [2019-08-04 21:40:17,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:40:17,105 INFO L225 Difference]: With dead ends: 188 [2019-08-04 21:40:17,105 INFO L226 Difference]: Without dead ends: 115 [2019-08-04 21:40:17,106 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1962 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=2961, Invalid=9695, Unknown=0, NotChecked=0, Total=12656 [2019-08-04 21:40:17,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-08-04 21:40:17,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2019-08-04 21:40:17,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-04 21:40:17,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2019-08-04 21:40:17,108 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 113 [2019-08-04 21:40:17,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:40:17,109 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2019-08-04 21:40:17,109 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-04 21:40:17,109 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2019-08-04 21:40:17,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-08-04 21:40:17,110 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:40:17,110 INFO L399 BasicCegarLoop]: trace histogram [37, 37, 36, 1, 1, 1, 1] [2019-08-04 21:40:17,110 INFO L418 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:40:17,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:40:17,110 INFO L82 PathProgramCache]: Analyzing trace with hash 823966328, now seen corresponding path program 72 times [2019-08-04 21:40:17,111 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:40:17,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:40:17,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 577 conjuncts, 78 conjunts are in the unsatisfiable core [2019-08-04 21:40:17,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:40:17,753 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:17,778 INFO L134 CoverageAnalysis]: Checked inductivity of 2035 backedges. 703 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:40:17,778 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:40:17,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-04 21:40:17,779 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-04 21:40:17,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-04 21:40:17,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=782, Invalid=858, Unknown=0, NotChecked=0, Total=1640 [2019-08-04 21:40:17,779 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand 41 states. [2019-08-04 21:40:18,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:40:18,587 INFO L93 Difference]: Finished difference Result 121 states and 122 transitions. [2019-08-04 21:40:18,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-04 21:40:18,587 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 114 [2019-08-04 21:40:18,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:40:18,588 INFO L225 Difference]: With dead ends: 121 [2019-08-04 21:40:18,588 INFO L226 Difference]: Without dead ends: 121 [2019-08-04 21:40:18,589 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1406 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=2340, Invalid=3822, Unknown=0, NotChecked=0, Total=6162 [2019-08-04 21:40:18,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-08-04 21:40:18,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 117. [2019-08-04 21:40:18,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-04 21:40:18,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 118 transitions. [2019-08-04 21:40:18,591 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 118 transitions. Word has length 114 [2019-08-04 21:40:18,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:40:18,592 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 118 transitions. [2019-08-04 21:40:18,592 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-04 21:40:18,592 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 118 transitions. [2019-08-04 21:40:18,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-08-04 21:40:18,592 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:40:18,593 INFO L399 BasicCegarLoop]: trace histogram [38, 37, 37, 1, 1, 1, 1] [2019-08-04 21:40:18,593 INFO L418 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:40:18,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:40:18,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1557711058, now seen corresponding path program 73 times [2019-08-04 21:40:18,593 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:40:18,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:40:18,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 587 conjuncts, 80 conjunts are in the unsatisfiable core [2019-08-04 21:40:18,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:40:21,054 INFO L134 CoverageAnalysis]: Checked inductivity of 2109 backedges. 1406 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:40:21,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:40:21,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-04 21:40:21,055 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-04 21:40:21,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-04 21:40:21,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1559, Invalid=4447, Unknown=0, NotChecked=0, Total=6006 [2019-08-04 21:40:21,056 INFO L87 Difference]: Start difference. First operand 117 states and 118 transitions. Second operand 78 states. [2019-08-04 21:40:22,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:40:22,752 INFO L93 Difference]: Finished difference Result 193 states and 194 transitions. [2019-08-04 21:40:22,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-04 21:40:22,752 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 116 [2019-08-04 21:40:22,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:40:22,753 INFO L225 Difference]: With dead ends: 193 [2019-08-04 21:40:22,753 INFO L226 Difference]: Without dead ends: 118 [2019-08-04 21:40:22,754 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2072 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=3117, Invalid=10223, Unknown=0, NotChecked=0, Total=13340 [2019-08-04 21:40:22,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-08-04 21:40:22,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2019-08-04 21:40:22,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-08-04 21:40:22,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 119 transitions. [2019-08-04 21:40:22,756 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 119 transitions. Word has length 116 [2019-08-04 21:40:22,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:40:22,756 INFO L475 AbstractCegarLoop]: Abstraction has 118 states and 119 transitions. [2019-08-04 21:40:22,756 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-04 21:40:22,756 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 119 transitions. [2019-08-04 21:40:22,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-08-04 21:40:22,757 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:40:22,757 INFO L399 BasicCegarLoop]: trace histogram [38, 38, 37, 1, 1, 1, 1] [2019-08-04 21:40:22,757 INFO L418 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:40:22,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:40:22,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1814260087, now seen corresponding path program 74 times [2019-08-04 21:40:22,758 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:40:22,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:40:22,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 592 conjuncts, 80 conjunts are in the unsatisfiable core [2019-08-04 21:40:22,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:40:23,404 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:23,432 INFO L134 CoverageAnalysis]: Checked inductivity of 2147 backedges. 741 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:40:23,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:40:23,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-04 21:40:23,433 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-04 21:40:23,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-04 21:40:23,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=822, Invalid=900, Unknown=0, NotChecked=0, Total=1722 [2019-08-04 21:40:23,434 INFO L87 Difference]: Start difference. First operand 118 states and 119 transitions. Second operand 42 states. [2019-08-04 21:40:24,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:40:24,582 INFO L93 Difference]: Finished difference Result 124 states and 125 transitions. [2019-08-04 21:40:24,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-08-04 21:40:24,582 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 117 [2019-08-04 21:40:24,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:40:24,583 INFO L225 Difference]: With dead ends: 124 [2019-08-04 21:40:24,583 INFO L226 Difference]: Without dead ends: 124 [2019-08-04 21:40:24,584 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1482 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2460, Invalid=4020, Unknown=0, NotChecked=0, Total=6480 [2019-08-04 21:40:24,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-08-04 21:40:24,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 120. [2019-08-04 21:40:24,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-08-04 21:40:24,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 121 transitions. [2019-08-04 21:40:24,586 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 121 transitions. Word has length 117 [2019-08-04 21:40:24,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:40:24,587 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 121 transitions. [2019-08-04 21:40:24,587 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-04 21:40:24,587 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 121 transitions. [2019-08-04 21:40:24,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-08-04 21:40:24,587 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:40:24,588 INFO L399 BasicCegarLoop]: trace histogram [39, 38, 38, 1, 1, 1, 1] [2019-08-04 21:40:24,588 INFO L418 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:40:24,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:40:24,588 INFO L82 PathProgramCache]: Analyzing trace with hash 252830883, now seen corresponding path program 75 times [2019-08-04 21:40:24,589 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:40:24,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:40:24,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 602 conjuncts, 82 conjunts are in the unsatisfiable core [2019-08-04 21:40:24,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:40:26,868 INFO L134 CoverageAnalysis]: Checked inductivity of 2223 backedges. 1482 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:40:26,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:40:26,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-08-04 21:40:26,869 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-08-04 21:40:26,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-08-04 21:40:26,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1639, Invalid=4681, Unknown=0, NotChecked=0, Total=6320 [2019-08-04 21:40:26,870 INFO L87 Difference]: Start difference. First operand 120 states and 121 transitions. Second operand 80 states. [2019-08-04 21:40:30,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:40:30,315 INFO L93 Difference]: Finished difference Result 198 states and 199 transitions. [2019-08-04 21:40:30,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-08-04 21:40:30,315 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 119 [2019-08-04 21:40:30,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:40:30,316 INFO L225 Difference]: With dead ends: 198 [2019-08-04 21:40:30,316 INFO L226 Difference]: Without dead ends: 121 [2019-08-04 21:40:30,317 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2185 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=3277, Invalid=10765, Unknown=0, NotChecked=0, Total=14042 [2019-08-04 21:40:30,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-08-04 21:40:30,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2019-08-04 21:40:30,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-04 21:40:30,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 122 transitions. [2019-08-04 21:40:30,319 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 122 transitions. Word has length 119 [2019-08-04 21:40:30,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:40:30,319 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 122 transitions. [2019-08-04 21:40:30,319 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-08-04 21:40:30,319 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2019-08-04 21:40:30,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-08-04 21:40:30,320 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:40:30,320 INFO L399 BasicCegarLoop]: trace histogram [39, 39, 38, 1, 1, 1, 1] [2019-08-04 21:40:30,320 INFO L418 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:40:30,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:40:30,320 INFO L82 PathProgramCache]: Analyzing trace with hash 850536332, now seen corresponding path program 76 times [2019-08-04 21:40:30,321 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:40:30,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:40:30,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 607 conjuncts, 82 conjunts are in the unsatisfiable core [2019-08-04 21:40:30,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:40:31,032 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:31,060 INFO L134 CoverageAnalysis]: Checked inductivity of 2262 backedges. 780 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:40:31,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:40:31,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-04 21:40:31,061 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-04 21:40:31,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-04 21:40:31,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=863, Invalid=943, Unknown=0, NotChecked=0, Total=1806 [2019-08-04 21:40:31,062 INFO L87 Difference]: Start difference. First operand 121 states and 122 transitions. Second operand 43 states. [2019-08-04 21:40:31,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:40:31,932 INFO L93 Difference]: Finished difference Result 127 states and 128 transitions. [2019-08-04 21:40:31,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-08-04 21:40:31,932 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 120 [2019-08-04 21:40:31,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:40:31,933 INFO L225 Difference]: With dead ends: 127 [2019-08-04 21:40:31,933 INFO L226 Difference]: Without dead ends: 127 [2019-08-04 21:40:31,934 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1560 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2583, Invalid=4223, Unknown=0, NotChecked=0, Total=6806 [2019-08-04 21:40:31,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-08-04 21:40:31,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 123. [2019-08-04 21:40:31,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-08-04 21:40:31,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 124 transitions. [2019-08-04 21:40:31,937 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 124 transitions. Word has length 120 [2019-08-04 21:40:31,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:40:31,938 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 124 transitions. [2019-08-04 21:40:31,938 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-04 21:40:31,938 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 124 transitions. [2019-08-04 21:40:31,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-08-04 21:40:31,938 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:40:31,939 INFO L399 BasicCegarLoop]: trace histogram [40, 39, 39, 1, 1, 1, 1] [2019-08-04 21:40:31,939 INFO L418 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:40:31,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:40:31,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1321681126, now seen corresponding path program 77 times [2019-08-04 21:40:31,940 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:40:31,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:40:32,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 617 conjuncts, 84 conjunts are in the unsatisfiable core [2019-08-04 21:40:32,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:40:34,678 INFO L134 CoverageAnalysis]: Checked inductivity of 2340 backedges. 1560 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:40:34,679 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:40:34,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2019-08-04 21:40:34,679 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-08-04 21:40:34,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-08-04 21:40:34,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1721, Invalid=4921, Unknown=0, NotChecked=0, Total=6642 [2019-08-04 21:40:34,680 INFO L87 Difference]: Start difference. First operand 123 states and 124 transitions. Second operand 82 states. [2019-08-04 21:40:36,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:40:36,698 INFO L93 Difference]: Finished difference Result 203 states and 204 transitions. [2019-08-04 21:40:36,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-08-04 21:40:36,698 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 122 [2019-08-04 21:40:36,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:40:36,699 INFO L225 Difference]: With dead ends: 203 [2019-08-04 21:40:36,699 INFO L226 Difference]: Without dead ends: 124 [2019-08-04 21:40:36,700 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2301 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=3441, Invalid=11321, Unknown=0, NotChecked=0, Total=14762 [2019-08-04 21:40:36,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-08-04 21:40:36,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2019-08-04 21:40:36,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-08-04 21:40:36,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 125 transitions. [2019-08-04 21:40:36,702 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 125 transitions. Word has length 122 [2019-08-04 21:40:36,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:40:36,702 INFO L475 AbstractCegarLoop]: Abstraction has 124 states and 125 transitions. [2019-08-04 21:40:36,702 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-08-04 21:40:36,702 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 125 transitions. [2019-08-04 21:40:36,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-08-04 21:40:36,703 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:40:36,703 INFO L399 BasicCegarLoop]: trace histogram [40, 40, 39, 1, 1, 1, 1] [2019-08-04 21:40:36,703 INFO L418 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:40:36,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:40:36,704 INFO L82 PathProgramCache]: Analyzing trace with hash 630303069, now seen corresponding path program 78 times [2019-08-04 21:40:36,704 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:40:36,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:40:36,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 622 conjuncts, 84 conjunts are in the unsatisfiable core [2019-08-04 21:40:36,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:40:37,501 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:37,531 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 820 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:40:37,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:40:37,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-04 21:40:37,532 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-04 21:40:37,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-04 21:40:37,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=905, Invalid=987, Unknown=0, NotChecked=0, Total=1892 [2019-08-04 21:40:37,533 INFO L87 Difference]: Start difference. First operand 124 states and 125 transitions. Second operand 44 states. [2019-08-04 21:40:38,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:40:38,462 INFO L93 Difference]: Finished difference Result 130 states and 131 transitions. [2019-08-04 21:40:38,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-08-04 21:40:38,462 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 123 [2019-08-04 21:40:38,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:40:38,463 INFO L225 Difference]: With dead ends: 130 [2019-08-04 21:40:38,463 INFO L226 Difference]: Without dead ends: 130 [2019-08-04 21:40:38,464 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1640 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2709, Invalid=4431, Unknown=0, NotChecked=0, Total=7140 [2019-08-04 21:40:38,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-08-04 21:40:38,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 126. [2019-08-04 21:40:38,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-08-04 21:40:38,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 127 transitions. [2019-08-04 21:40:38,466 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 127 transitions. Word has length 123 [2019-08-04 21:40:38,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:40:38,467 INFO L475 AbstractCegarLoop]: Abstraction has 126 states and 127 transitions. [2019-08-04 21:40:38,467 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-04 21:40:38,467 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 127 transitions. [2019-08-04 21:40:38,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-08-04 21:40:38,467 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:40:38,468 INFO L399 BasicCegarLoop]: trace histogram [41, 40, 40, 1, 1, 1, 1] [2019-08-04 21:40:38,468 INFO L418 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:40:38,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:40:38,468 INFO L82 PathProgramCache]: Analyzing trace with hash 130912887, now seen corresponding path program 79 times [2019-08-04 21:40:38,468 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:40:38,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:40:38,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 632 conjuncts, 86 conjunts are in the unsatisfiable core [2019-08-04 21:40:38,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:40:41,414 INFO L134 CoverageAnalysis]: Checked inductivity of 2460 backedges. 1640 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:40:41,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:40:41,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2019-08-04 21:40:41,425 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-08-04 21:40:41,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-08-04 21:40:41,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1805, Invalid=5167, Unknown=0, NotChecked=0, Total=6972 [2019-08-04 21:40:41,426 INFO L87 Difference]: Start difference. First operand 126 states and 127 transitions. Second operand 84 states. [2019-08-04 21:40:44,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:40:44,521 INFO L93 Difference]: Finished difference Result 208 states and 209 transitions. [2019-08-04 21:40:44,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-08-04 21:40:44,521 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 125 [2019-08-04 21:40:44,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:40:44,522 INFO L225 Difference]: With dead ends: 208 [2019-08-04 21:40:44,522 INFO L226 Difference]: Without dead ends: 127 [2019-08-04 21:40:44,523 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2420 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=3609, Invalid=11891, Unknown=0, NotChecked=0, Total=15500 [2019-08-04 21:40:44,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-08-04 21:40:44,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2019-08-04 21:40:44,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-08-04 21:40:44,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2019-08-04 21:40:44,525 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 125 [2019-08-04 21:40:44,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:40:44,525 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2019-08-04 21:40:44,525 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-08-04 21:40:44,525 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2019-08-04 21:40:44,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-08-04 21:40:44,526 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:40:44,526 INFO L399 BasicCegarLoop]: trace histogram [41, 41, 40, 1, 1, 1, 1] [2019-08-04 21:40:44,526 INFO L418 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:40:44,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:40:44,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1950368416, now seen corresponding path program 80 times [2019-08-04 21:40:44,527 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:40:44,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:40:44,590 INFO L256 TraceCheckSpWp]: Trace formula consists of 637 conjuncts, 86 conjunts are in the unsatisfiable core [2019-08-04 21:40:44,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:40:45,277 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:45,306 INFO L134 CoverageAnalysis]: Checked inductivity of 2501 backedges. 861 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:40:45,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:40:45,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-04 21:40:45,306 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-04 21:40:45,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-04 21:40:45,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=948, Invalid=1032, Unknown=0, NotChecked=0, Total=1980 [2019-08-04 21:40:45,307 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand 45 states. [2019-08-04 21:40:46,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:40:46,260 INFO L93 Difference]: Finished difference Result 133 states and 134 transitions. [2019-08-04 21:40:46,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-08-04 21:40:46,261 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 126 [2019-08-04 21:40:46,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:40:46,262 INFO L225 Difference]: With dead ends: 133 [2019-08-04 21:40:46,262 INFO L226 Difference]: Without dead ends: 133 [2019-08-04 21:40:46,262 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1722 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2838, Invalid=4644, Unknown=0, NotChecked=0, Total=7482 [2019-08-04 21:40:46,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-08-04 21:40:46,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 129. [2019-08-04 21:40:46,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-08-04 21:40:46,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 130 transitions. [2019-08-04 21:40:46,265 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 130 transitions. Word has length 126 [2019-08-04 21:40:46,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:40:46,265 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 130 transitions. [2019-08-04 21:40:46,265 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-04 21:40:46,265 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2019-08-04 21:40:46,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-08-04 21:40:46,266 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:40:46,266 INFO L399 BasicCegarLoop]: trace histogram [42, 41, 41, 1, 1, 1, 1] [2019-08-04 21:40:46,266 INFO L418 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:40:46,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:40:46,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1698359034, now seen corresponding path program 81 times [2019-08-04 21:40:46,267 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:40:46,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:40:46,318 INFO L256 TraceCheckSpWp]: Trace formula consists of 647 conjuncts, 88 conjunts are in the unsatisfiable core [2019-08-04 21:40:46,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:40:48,870 INFO L134 CoverageAnalysis]: Checked inductivity of 2583 backedges. 1722 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:40:48,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:40:48,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2019-08-04 21:40:48,871 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-08-04 21:40:48,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-08-04 21:40:48,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=5419, Unknown=0, NotChecked=0, Total=7310 [2019-08-04 21:40:48,872 INFO L87 Difference]: Start difference. First operand 129 states and 130 transitions. Second operand 86 states. [2019-08-04 21:40:51,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:40:51,862 INFO L93 Difference]: Finished difference Result 213 states and 214 transitions. [2019-08-04 21:40:51,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-08-04 21:40:51,863 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 128 [2019-08-04 21:40:51,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:40:51,864 INFO L225 Difference]: With dead ends: 213 [2019-08-04 21:40:51,864 INFO L226 Difference]: Without dead ends: 130 [2019-08-04 21:40:51,865 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2542 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=3781, Invalid=12475, Unknown=0, NotChecked=0, Total=16256 [2019-08-04 21:40:51,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-08-04 21:40:51,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2019-08-04 21:40:51,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-08-04 21:40:51,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 131 transitions. [2019-08-04 21:40:51,867 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 131 transitions. Word has length 128 [2019-08-04 21:40:51,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:40:51,868 INFO L475 AbstractCegarLoop]: Abstraction has 130 states and 131 transitions. [2019-08-04 21:40:51,868 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-08-04 21:40:51,868 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 131 transitions. [2019-08-04 21:40:51,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-08-04 21:40:51,868 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:40:51,869 INFO L399 BasicCegarLoop]: trace histogram [42, 42, 41, 1, 1, 1, 1] [2019-08-04 21:40:51,869 INFO L418 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:40:51,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:40:51,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1684219343, now seen corresponding path program 82 times [2019-08-04 21:40:51,870 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:40:51,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:40:51,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 652 conjuncts, 88 conjunts are in the unsatisfiable core [2019-08-04 21:40:51,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:40:52,658 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:40:53,079 INFO L134 CoverageAnalysis]: Checked inductivity of 2625 backedges. 903 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:40:53,079 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:40:53,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-04 21:40:53,079 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-04 21:40:53,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-04 21:40:53,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=992, Invalid=1078, Unknown=0, NotChecked=0, Total=2070 [2019-08-04 21:40:53,080 INFO L87 Difference]: Start difference. First operand 130 states and 131 transitions. Second operand 46 states. [2019-08-04 21:40:54,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:40:54,069 INFO L93 Difference]: Finished difference Result 136 states and 137 transitions. [2019-08-04 21:40:54,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-08-04 21:40:54,070 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 129 [2019-08-04 21:40:54,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:40:54,071 INFO L225 Difference]: With dead ends: 136 [2019-08-04 21:40:54,071 INFO L226 Difference]: Without dead ends: 136 [2019-08-04 21:40:54,072 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1806 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2970, Invalid=4862, Unknown=0, NotChecked=0, Total=7832 [2019-08-04 21:40:54,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-08-04 21:40:54,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 132. [2019-08-04 21:40:54,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-08-04 21:40:54,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 133 transitions. [2019-08-04 21:40:54,074 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 133 transitions. Word has length 129 [2019-08-04 21:40:54,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:40:54,074 INFO L475 AbstractCegarLoop]: Abstraction has 132 states and 133 transitions. [2019-08-04 21:40:54,074 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-04 21:40:54,074 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 133 transitions. [2019-08-04 21:40:54,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-08-04 21:40:54,075 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:40:54,075 INFO L399 BasicCegarLoop]: trace histogram [43, 42, 42, 1, 1, 1, 1] [2019-08-04 21:40:54,075 INFO L418 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:40:54,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:40:54,075 INFO L82 PathProgramCache]: Analyzing trace with hash 667934283, now seen corresponding path program 83 times [2019-08-04 21:40:54,076 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:40:54,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:40:54,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 662 conjuncts, 90 conjunts are in the unsatisfiable core [2019-08-04 21:40:54,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:40:56,956 INFO L134 CoverageAnalysis]: Checked inductivity of 2709 backedges. 1806 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:40:56,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:40:56,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2019-08-04 21:40:56,957 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-08-04 21:40:56,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-08-04 21:40:56,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1979, Invalid=5677, Unknown=0, NotChecked=0, Total=7656 [2019-08-04 21:40:56,958 INFO L87 Difference]: Start difference. First operand 132 states and 133 transitions. Second operand 88 states. [2019-08-04 21:41:00,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:41:00,302 INFO L93 Difference]: Finished difference Result 218 states and 219 transitions. [2019-08-04 21:41:00,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-08-04 21:41:00,302 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 131 [2019-08-04 21:41:00,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:41:00,303 INFO L225 Difference]: With dead ends: 218 [2019-08-04 21:41:00,304 INFO L226 Difference]: Without dead ends: 133 [2019-08-04 21:41:00,304 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2667 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=3957, Invalid=13073, Unknown=0, NotChecked=0, Total=17030 [2019-08-04 21:41:00,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-08-04 21:41:00,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2019-08-04 21:41:00,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-08-04 21:41:00,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 134 transitions. [2019-08-04 21:41:00,306 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 134 transitions. Word has length 131 [2019-08-04 21:41:00,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:41:00,306 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 134 transitions. [2019-08-04 21:41:00,307 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-08-04 21:41:00,307 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 134 transitions. [2019-08-04 21:41:00,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-08-04 21:41:00,308 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:41:00,308 INFO L399 BasicCegarLoop]: trace histogram [43, 43, 42, 1, 1, 1, 1] [2019-08-04 21:41:00,308 INFO L418 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:41:00,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:41:00,308 INFO L82 PathProgramCache]: Analyzing trace with hash -1201796172, now seen corresponding path program 84 times [2019-08-04 21:41:00,309 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:41:00,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:41:00,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 667 conjuncts, 90 conjunts are in the unsatisfiable core [2019-08-04 21:41:00,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:41:01,762 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:41:01,793 INFO L134 CoverageAnalysis]: Checked inductivity of 2752 backedges. 946 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:41:01,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:41:01,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-04 21:41:01,794 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-04 21:41:01,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-04 21:41:01,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1037, Invalid=1125, Unknown=0, NotChecked=0, Total=2162 [2019-08-04 21:41:01,795 INFO L87 Difference]: Start difference. First operand 133 states and 134 transitions. Second operand 47 states. [2019-08-04 21:41:02,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:41:02,812 INFO L93 Difference]: Finished difference Result 139 states and 140 transitions. [2019-08-04 21:41:02,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-08-04 21:41:02,812 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 132 [2019-08-04 21:41:02,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:41:02,813 INFO L225 Difference]: With dead ends: 139 [2019-08-04 21:41:02,813 INFO L226 Difference]: Without dead ends: 139 [2019-08-04 21:41:02,814 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1892 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3105, Invalid=5085, Unknown=0, NotChecked=0, Total=8190 [2019-08-04 21:41:02,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-08-04 21:41:02,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 135. [2019-08-04 21:41:02,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-08-04 21:41:02,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2019-08-04 21:41:02,817 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 132 [2019-08-04 21:41:02,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:41:02,817 INFO L475 AbstractCegarLoop]: Abstraction has 135 states and 136 transitions. [2019-08-04 21:41:02,817 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-04 21:41:02,817 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 136 transitions. [2019-08-04 21:41:02,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-08-04 21:41:02,818 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:41:02,818 INFO L399 BasicCegarLoop]: trace histogram [44, 43, 43, 1, 1, 1, 1] [2019-08-04 21:41:02,818 INFO L418 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:41:02,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:41:02,819 INFO L82 PathProgramCache]: Analyzing trace with hash 420133646, now seen corresponding path program 85 times [2019-08-04 21:41:02,819 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:41:02,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:41:02,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 677 conjuncts, 92 conjunts are in the unsatisfiable core [2019-08-04 21:41:02,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:41:05,966 INFO L134 CoverageAnalysis]: Checked inductivity of 2838 backedges. 1892 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:41:05,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:41:05,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2019-08-04 21:41:05,967 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-08-04 21:41:05,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-08-04 21:41:05,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2069, Invalid=5941, Unknown=0, NotChecked=0, Total=8010 [2019-08-04 21:41:05,968 INFO L87 Difference]: Start difference. First operand 135 states and 136 transitions. Second operand 90 states. [2019-08-04 21:41:08,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:41:08,252 INFO L93 Difference]: Finished difference Result 223 states and 224 transitions. [2019-08-04 21:41:08,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-08-04 21:41:08,252 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 134 [2019-08-04 21:41:08,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:41:08,253 INFO L225 Difference]: With dead ends: 223 [2019-08-04 21:41:08,253 INFO L226 Difference]: Without dead ends: 136 [2019-08-04 21:41:08,254 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2795 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=4137, Invalid=13685, Unknown=0, NotChecked=0, Total=17822 [2019-08-04 21:41:08,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-08-04 21:41:08,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2019-08-04 21:41:08,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-08-04 21:41:08,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 137 transitions. [2019-08-04 21:41:08,255 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 137 transitions. Word has length 134 [2019-08-04 21:41:08,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:41:08,256 INFO L475 AbstractCegarLoop]: Abstraction has 136 states and 137 transitions. [2019-08-04 21:41:08,256 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-08-04 21:41:08,256 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 137 transitions. [2019-08-04 21:41:08,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-08-04 21:41:08,256 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:41:08,256 INFO L399 BasicCegarLoop]: trace histogram [44, 44, 43, 1, 1, 1, 1] [2019-08-04 21:41:08,257 INFO L418 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:41:08,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:41:08,257 INFO L82 PathProgramCache]: Analyzing trace with hash 711010565, now seen corresponding path program 86 times [2019-08-04 21:41:08,258 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:41:08,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:41:08,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 682 conjuncts, 92 conjunts are in the unsatisfiable core [2019-08-04 21:41:08,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:41:09,115 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:41:09,156 INFO L134 CoverageAnalysis]: Checked inductivity of 2882 backedges. 990 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:41:09,156 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:41:09,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-04 21:41:09,157 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-04 21:41:09,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-04 21:41:09,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1083, Invalid=1173, Unknown=0, NotChecked=0, Total=2256 [2019-08-04 21:41:09,157 INFO L87 Difference]: Start difference. First operand 136 states and 137 transitions. Second operand 48 states. [2019-08-04 21:41:10,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:41:10,443 INFO L93 Difference]: Finished difference Result 142 states and 143 transitions. [2019-08-04 21:41:10,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-08-04 21:41:10,444 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 135 [2019-08-04 21:41:10,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:41:10,445 INFO L225 Difference]: With dead ends: 142 [2019-08-04 21:41:10,445 INFO L226 Difference]: Without dead ends: 142 [2019-08-04 21:41:10,446 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1980 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=3243, Invalid=5313, Unknown=0, NotChecked=0, Total=8556 [2019-08-04 21:41:10,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-08-04 21:41:10,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 138. [2019-08-04 21:41:10,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-08-04 21:41:10,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 139 transitions. [2019-08-04 21:41:10,449 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 139 transitions. Word has length 135 [2019-08-04 21:41:10,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:41:10,449 INFO L475 AbstractCegarLoop]: Abstraction has 138 states and 139 transitions. [2019-08-04 21:41:10,449 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-04 21:41:10,449 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 139 transitions. [2019-08-04 21:41:10,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-08-04 21:41:10,450 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:41:10,450 INFO L399 BasicCegarLoop]: trace histogram [45, 44, 44, 1, 1, 1, 1] [2019-08-04 21:41:10,450 INFO L418 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:41:10,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:41:10,451 INFO L82 PathProgramCache]: Analyzing trace with hash 381405215, now seen corresponding path program 87 times [2019-08-04 21:41:10,451 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:41:10,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:41:10,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 692 conjuncts, 94 conjunts are in the unsatisfiable core [2019-08-04 21:41:10,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:41:13,416 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 1980 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:41:13,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:41:13,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2019-08-04 21:41:13,416 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-08-04 21:41:13,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-08-04 21:41:13,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2161, Invalid=6211, Unknown=0, NotChecked=0, Total=8372 [2019-08-04 21:41:13,417 INFO L87 Difference]: Start difference. First operand 138 states and 139 transitions. Second operand 92 states. [2019-08-04 21:41:17,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:41:17,396 INFO L93 Difference]: Finished difference Result 228 states and 229 transitions. [2019-08-04 21:41:17,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-08-04 21:41:17,396 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 137 [2019-08-04 21:41:17,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:41:17,397 INFO L225 Difference]: With dead ends: 228 [2019-08-04 21:41:17,398 INFO L226 Difference]: Without dead ends: 139 [2019-08-04 21:41:17,399 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2926 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=4321, Invalid=14311, Unknown=0, NotChecked=0, Total=18632 [2019-08-04 21:41:17,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-08-04 21:41:17,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2019-08-04 21:41:17,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-08-04 21:41:17,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2019-08-04 21:41:17,401 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 137 [2019-08-04 21:41:17,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:41:17,401 INFO L475 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2019-08-04 21:41:17,401 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-08-04 21:41:17,401 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2019-08-04 21:41:17,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-08-04 21:41:17,402 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:41:17,402 INFO L399 BasicCegarLoop]: trace histogram [45, 45, 44, 1, 1, 1, 1] [2019-08-04 21:41:17,402 INFO L418 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:41:17,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:41:17,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1348304184, now seen corresponding path program 88 times [2019-08-04 21:41:17,403 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:41:17,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:41:17,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 697 conjuncts, 94 conjunts are in the unsatisfiable core [2019-08-04 21:41:17,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:41:18,327 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:41:18,359 INFO L134 CoverageAnalysis]: Checked inductivity of 3015 backedges. 1035 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:41:18,359 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:41:18,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-04 21:41:18,359 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-04 21:41:18,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-04 21:41:18,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1130, Invalid=1222, Unknown=0, NotChecked=0, Total=2352 [2019-08-04 21:41:18,360 INFO L87 Difference]: Start difference. First operand 139 states and 140 transitions. Second operand 49 states. [2019-08-04 21:41:19,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:41:19,458 INFO L93 Difference]: Finished difference Result 145 states and 146 transitions. [2019-08-04 21:41:19,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-08-04 21:41:19,458 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 138 [2019-08-04 21:41:19,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:41:19,459 INFO L225 Difference]: With dead ends: 145 [2019-08-04 21:41:19,459 INFO L226 Difference]: Without dead ends: 145 [2019-08-04 21:41:19,460 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2070 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=3384, Invalid=5546, Unknown=0, NotChecked=0, Total=8930 [2019-08-04 21:41:19,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-08-04 21:41:19,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 141. [2019-08-04 21:41:19,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-08-04 21:41:19,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 142 transitions. [2019-08-04 21:41:19,463 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 142 transitions. Word has length 138 [2019-08-04 21:41:19,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:41:19,463 INFO L475 AbstractCegarLoop]: Abstraction has 141 states and 142 transitions. [2019-08-04 21:41:19,464 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-04 21:41:19,464 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 142 transitions. [2019-08-04 21:41:19,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-08-04 21:41:19,472 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:41:19,472 INFO L399 BasicCegarLoop]: trace histogram [46, 45, 45, 1, 1, 1, 1] [2019-08-04 21:41:19,472 INFO L418 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:41:19,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:41:19,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1359854882, now seen corresponding path program 89 times [2019-08-04 21:41:19,473 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:41:19,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:41:19,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 707 conjuncts, 96 conjunts are in the unsatisfiable core [2019-08-04 21:41:19,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:41:22,850 INFO L134 CoverageAnalysis]: Checked inductivity of 3105 backedges. 2070 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:41:22,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:41:22,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2019-08-04 21:41:22,851 INFO L454 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-08-04 21:41:22,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-08-04 21:41:22,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2255, Invalid=6487, Unknown=0, NotChecked=0, Total=8742 [2019-08-04 21:41:22,852 INFO L87 Difference]: Start difference. First operand 141 states and 142 transitions. Second operand 94 states. [2019-08-04 21:41:27,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:41:27,114 INFO L93 Difference]: Finished difference Result 233 states and 234 transitions. [2019-08-04 21:41:27,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-08-04 21:41:27,115 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 140 [2019-08-04 21:41:27,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:41:27,116 INFO L225 Difference]: With dead ends: 233 [2019-08-04 21:41:27,116 INFO L226 Difference]: Without dead ends: 142 [2019-08-04 21:41:27,116 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3060 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=4509, Invalid=14951, Unknown=0, NotChecked=0, Total=19460 [2019-08-04 21:41:27,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-08-04 21:41:27,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2019-08-04 21:41:27,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-08-04 21:41:27,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 143 transitions. [2019-08-04 21:41:27,118 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 143 transitions. Word has length 140 [2019-08-04 21:41:27,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:41:27,119 INFO L475 AbstractCegarLoop]: Abstraction has 142 states and 143 transitions. [2019-08-04 21:41:27,119 INFO L476 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-08-04 21:41:27,119 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 143 transitions. [2019-08-04 21:41:27,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-08-04 21:41:27,120 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:41:27,120 INFO L399 BasicCegarLoop]: trace histogram [46, 46, 45, 1, 1, 1, 1] [2019-08-04 21:41:27,120 INFO L418 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:41:27,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:41:27,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1690200615, now seen corresponding path program 90 times [2019-08-04 21:41:27,121 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:41:27,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:41:27,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 712 conjuncts, 96 conjunts are in the unsatisfiable core [2019-08-04 21:41:27,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:41:28,030 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:41:28,064 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 1081 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:41:28,064 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:41:28,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-04 21:41:28,065 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-04 21:41:28,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-04 21:41:28,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1178, Invalid=1272, Unknown=0, NotChecked=0, Total=2450 [2019-08-04 21:41:28,065 INFO L87 Difference]: Start difference. First operand 142 states and 143 transitions. Second operand 50 states. [2019-08-04 21:41:29,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:41:29,198 INFO L93 Difference]: Finished difference Result 148 states and 149 transitions. [2019-08-04 21:41:29,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-08-04 21:41:29,198 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 141 [2019-08-04 21:41:29,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:41:29,199 INFO L225 Difference]: With dead ends: 148 [2019-08-04 21:41:29,199 INFO L226 Difference]: Without dead ends: 148 [2019-08-04 21:41:29,200 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2162 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=3528, Invalid=5784, Unknown=0, NotChecked=0, Total=9312 [2019-08-04 21:41:29,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-08-04 21:41:29,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 144. [2019-08-04 21:41:29,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-08-04 21:41:29,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 145 transitions. [2019-08-04 21:41:29,203 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 145 transitions. Word has length 141 [2019-08-04 21:41:29,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:41:29,203 INFO L475 AbstractCegarLoop]: Abstraction has 144 states and 145 transitions. [2019-08-04 21:41:29,203 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-04 21:41:29,203 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 145 transitions. [2019-08-04 21:41:29,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-08-04 21:41:29,203 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:41:29,204 INFO L399 BasicCegarLoop]: trace histogram [47, 46, 46, 1, 1, 1, 1] [2019-08-04 21:41:29,204 INFO L418 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:41:29,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:41:29,204 INFO L82 PathProgramCache]: Analyzing trace with hash -785100813, now seen corresponding path program 91 times [2019-08-04 21:41:29,204 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:41:29,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:41:29,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 722 conjuncts, 98 conjunts are in the unsatisfiable core [2019-08-04 21:41:29,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:41:32,692 INFO L134 CoverageAnalysis]: Checked inductivity of 3243 backedges. 2162 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:41:32,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:41:32,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2019-08-04 21:41:32,693 INFO L454 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-08-04 21:41:32,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-08-04 21:41:32,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2351, Invalid=6769, Unknown=0, NotChecked=0, Total=9120 [2019-08-04 21:41:32,694 INFO L87 Difference]: Start difference. First operand 144 states and 145 transitions. Second operand 96 states. [2019-08-04 21:41:35,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:41:35,905 INFO L93 Difference]: Finished difference Result 238 states and 239 transitions. [2019-08-04 21:41:35,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-08-04 21:41:35,905 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 143 [2019-08-04 21:41:35,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:41:35,906 INFO L225 Difference]: With dead ends: 238 [2019-08-04 21:41:35,906 INFO L226 Difference]: Without dead ends: 145 [2019-08-04 21:41:35,906 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3197 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=4701, Invalid=15605, Unknown=0, NotChecked=0, Total=20306 [2019-08-04 21:41:35,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-08-04 21:41:35,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2019-08-04 21:41:35,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-08-04 21:41:35,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 146 transitions. [2019-08-04 21:41:35,908 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 146 transitions. Word has length 143 [2019-08-04 21:41:35,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:41:35,908 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 146 transitions. [2019-08-04 21:41:35,908 INFO L476 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-08-04 21:41:35,908 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 146 transitions. [2019-08-04 21:41:35,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-08-04 21:41:35,909 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:41:35,909 INFO L399 BasicCegarLoop]: trace histogram [47, 47, 46, 1, 1, 1, 1] [2019-08-04 21:41:35,909 INFO L418 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:41:35,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:41:35,909 INFO L82 PathProgramCache]: Analyzing trace with hash -660297764, now seen corresponding path program 92 times [2019-08-04 21:41:35,910 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:41:35,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:41:35,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 727 conjuncts, 98 conjunts are in the unsatisfiable core [2019-08-04 21:41:35,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:41:36,839 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:41:36,872 INFO L134 CoverageAnalysis]: Checked inductivity of 3290 backedges. 1128 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:41:36,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:41:36,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-04 21:41:36,873 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-04 21:41:36,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-04 21:41:36,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1227, Invalid=1323, Unknown=0, NotChecked=0, Total=2550 [2019-08-04 21:41:36,873 INFO L87 Difference]: Start difference. First operand 145 states and 146 transitions. Second operand 51 states. [2019-08-04 21:41:38,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:41:38,028 INFO L93 Difference]: Finished difference Result 151 states and 152 transitions. [2019-08-04 21:41:38,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-08-04 21:41:38,029 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 144 [2019-08-04 21:41:38,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:41:38,030 INFO L225 Difference]: With dead ends: 151 [2019-08-04 21:41:38,030 INFO L226 Difference]: Without dead ends: 151 [2019-08-04 21:41:38,030 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2256 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=3675, Invalid=6027, Unknown=0, NotChecked=0, Total=9702 [2019-08-04 21:41:38,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-08-04 21:41:38,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 147. [2019-08-04 21:41:38,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-08-04 21:41:38,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 148 transitions. [2019-08-04 21:41:38,033 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 148 transitions. Word has length 144 [2019-08-04 21:41:38,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:41:38,033 INFO L475 AbstractCegarLoop]: Abstraction has 147 states and 148 transitions. [2019-08-04 21:41:38,033 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-04 21:41:38,033 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 148 transitions. [2019-08-04 21:41:38,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-08-04 21:41:38,034 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:41:38,034 INFO L399 BasicCegarLoop]: trace histogram [48, 47, 47, 1, 1, 1, 1] [2019-08-04 21:41:38,034 INFO L418 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:41:38,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:41:38,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1109060918, now seen corresponding path program 93 times [2019-08-04 21:41:38,035 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:41:38,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:41:38,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 737 conjuncts, 100 conjunts are in the unsatisfiable core [2019-08-04 21:41:38,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:41:41,580 INFO L134 CoverageAnalysis]: Checked inductivity of 3384 backedges. 2256 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:41:41,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:41:41,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2019-08-04 21:41:41,581 INFO L454 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-08-04 21:41:41,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-08-04 21:41:41,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2449, Invalid=7057, Unknown=0, NotChecked=0, Total=9506 [2019-08-04 21:41:41,582 INFO L87 Difference]: Start difference. First operand 147 states and 148 transitions. Second operand 98 states. [2019-08-04 21:41:45,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:41:45,966 INFO L93 Difference]: Finished difference Result 243 states and 244 transitions. [2019-08-04 21:41:45,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-08-04 21:41:45,966 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 146 [2019-08-04 21:41:45,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:41:45,967 INFO L225 Difference]: With dead ends: 243 [2019-08-04 21:41:45,967 INFO L226 Difference]: Without dead ends: 148 [2019-08-04 21:41:45,968 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3337 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=4897, Invalid=16273, Unknown=0, NotChecked=0, Total=21170 [2019-08-04 21:41:45,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-08-04 21:41:45,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2019-08-04 21:41:45,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-08-04 21:41:45,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 149 transitions. [2019-08-04 21:41:45,970 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 149 transitions. Word has length 146 [2019-08-04 21:41:45,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:41:45,970 INFO L475 AbstractCegarLoop]: Abstraction has 148 states and 149 transitions. [2019-08-04 21:41:45,970 INFO L476 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-08-04 21:41:45,970 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 149 transitions. [2019-08-04 21:41:45,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-08-04 21:41:45,971 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:41:45,971 INFO L399 BasicCegarLoop]: trace histogram [48, 48, 47, 1, 1, 1, 1] [2019-08-04 21:41:45,971 INFO L418 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:41:45,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:41:45,972 INFO L82 PathProgramCache]: Analyzing trace with hash -324984659, now seen corresponding path program 94 times [2019-08-04 21:41:45,972 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:41:46,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:41:46,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 742 conjuncts, 100 conjunts are in the unsatisfiable core [2019-08-04 21:41:46,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:41:46,956 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:41:46,995 INFO L134 CoverageAnalysis]: Checked inductivity of 3432 backedges. 1176 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:41:46,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:41:46,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-04 21:41:46,995 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-04 21:41:46,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-04 21:41:46,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1277, Invalid=1375, Unknown=0, NotChecked=0, Total=2652 [2019-08-04 21:41:46,996 INFO L87 Difference]: Start difference. First operand 148 states and 149 transitions. Second operand 52 states. [2019-08-04 21:41:48,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:41:48,153 INFO L93 Difference]: Finished difference Result 154 states and 155 transitions. [2019-08-04 21:41:48,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-08-04 21:41:48,153 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 147 [2019-08-04 21:41:48,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:41:48,154 INFO L225 Difference]: With dead ends: 154 [2019-08-04 21:41:48,154 INFO L226 Difference]: Without dead ends: 154 [2019-08-04 21:41:48,155 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2352 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=3825, Invalid=6275, Unknown=0, NotChecked=0, Total=10100 [2019-08-04 21:41:48,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-08-04 21:41:48,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 150. [2019-08-04 21:41:48,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-08-04 21:41:48,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 151 transitions. [2019-08-04 21:41:48,157 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 151 transitions. Word has length 147 [2019-08-04 21:41:48,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:41:48,158 INFO L475 AbstractCegarLoop]: Abstraction has 150 states and 151 transitions. [2019-08-04 21:41:48,158 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-04 21:41:48,158 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 151 transitions. [2019-08-04 21:41:48,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-08-04 21:41:48,159 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:41:48,159 INFO L399 BasicCegarLoop]: trace histogram [49, 48, 48, 1, 1, 1, 1] [2019-08-04 21:41:48,159 INFO L418 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:41:48,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:41:48,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1222407623, now seen corresponding path program 95 times [2019-08-04 21:41:48,160 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:41:48,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:41:48,244 INFO L256 TraceCheckSpWp]: Trace formula consists of 752 conjuncts, 102 conjunts are in the unsatisfiable core [2019-08-04 21:41:48,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:41:51,901 INFO L134 CoverageAnalysis]: Checked inductivity of 3528 backedges. 2352 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:41:51,901 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:41:51,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2019-08-04 21:41:51,901 INFO L454 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-08-04 21:41:51,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-08-04 21:41:51,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2549, Invalid=7351, Unknown=0, NotChecked=0, Total=9900 [2019-08-04 21:41:51,902 INFO L87 Difference]: Start difference. First operand 150 states and 151 transitions. Second operand 100 states. [2019-08-04 21:41:56,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:41:56,441 INFO L93 Difference]: Finished difference Result 248 states and 249 transitions. [2019-08-04 21:41:56,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-08-04 21:41:56,442 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 149 [2019-08-04 21:41:56,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:41:56,443 INFO L225 Difference]: With dead ends: 248 [2019-08-04 21:41:56,443 INFO L226 Difference]: Without dead ends: 151 [2019-08-04 21:41:56,444 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3480 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=5097, Invalid=16955, Unknown=0, NotChecked=0, Total=22052 [2019-08-04 21:41:56,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-08-04 21:41:56,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2019-08-04 21:41:56,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-08-04 21:41:56,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 152 transitions. [2019-08-04 21:41:56,446 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 152 transitions. Word has length 149 [2019-08-04 21:41:56,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:41:56,446 INFO L475 AbstractCegarLoop]: Abstraction has 151 states and 152 transitions. [2019-08-04 21:41:56,446 INFO L476 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-08-04 21:41:56,447 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 152 transitions. [2019-08-04 21:41:56,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-08-04 21:41:56,447 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:41:56,447 INFO L399 BasicCegarLoop]: trace histogram [49, 49, 48, 1, 1, 1, 1] [2019-08-04 21:41:56,448 INFO L418 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:41:56,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:41:56,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1610316528, now seen corresponding path program 96 times [2019-08-04 21:41:56,448 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:41:56,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:41:56,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 757 conjuncts, 102 conjunts are in the unsatisfiable core [2019-08-04 21:41:56,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:41:57,492 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:41:57,536 INFO L134 CoverageAnalysis]: Checked inductivity of 3577 backedges. 1225 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:41:57,536 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:41:57,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-04 21:41:57,537 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-04 21:41:57,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-04 21:41:57,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1328, Invalid=1428, Unknown=0, NotChecked=0, Total=2756 [2019-08-04 21:41:57,537 INFO L87 Difference]: Start difference. First operand 151 states and 152 transitions. Second operand 53 states. [2019-08-04 21:41:58,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:41:58,733 INFO L93 Difference]: Finished difference Result 157 states and 158 transitions. [2019-08-04 21:41:58,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-08-04 21:41:58,757 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 150 [2019-08-04 21:41:58,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:41:58,758 INFO L225 Difference]: With dead ends: 157 [2019-08-04 21:41:58,758 INFO L226 Difference]: Without dead ends: 157 [2019-08-04 21:41:58,759 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2450 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=3978, Invalid=6528, Unknown=0, NotChecked=0, Total=10506 [2019-08-04 21:41:58,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-08-04 21:41:58,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 153. [2019-08-04 21:41:58,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-08-04 21:41:58,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 154 transitions. [2019-08-04 21:41:58,760 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 154 transitions. Word has length 150 [2019-08-04 21:41:58,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:41:58,760 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 154 transitions. [2019-08-04 21:41:58,760 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-04 21:41:58,760 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 154 transitions. [2019-08-04 21:41:58,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-08-04 21:41:58,761 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:41:58,761 INFO L399 BasicCegarLoop]: trace histogram [50, 49, 49, 1, 1, 1, 1] [2019-08-04 21:41:58,761 INFO L418 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:41:58,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:41:58,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1326009162, now seen corresponding path program 97 times [2019-08-04 21:41:58,762 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:41:58,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:41:58,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 767 conjuncts, 104 conjunts are in the unsatisfiable core [2019-08-04 21:41:58,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:42:02,678 INFO L134 CoverageAnalysis]: Checked inductivity of 3675 backedges. 2450 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:42:02,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:42:02,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2019-08-04 21:42:02,679 INFO L454 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-08-04 21:42:02,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-08-04 21:42:02,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2651, Invalid=7651, Unknown=0, NotChecked=0, Total=10302 [2019-08-04 21:42:02,680 INFO L87 Difference]: Start difference. First operand 153 states and 154 transitions. Second operand 102 states. [2019-08-04 21:42:05,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:42:05,471 INFO L93 Difference]: Finished difference Result 253 states and 254 transitions. [2019-08-04 21:42:05,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-08-04 21:42:05,471 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 152 [2019-08-04 21:42:05,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:42:05,472 INFO L225 Difference]: With dead ends: 253 [2019-08-04 21:42:05,472 INFO L226 Difference]: Without dead ends: 154 [2019-08-04 21:42:05,473 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3626 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=5301, Invalid=17651, Unknown=0, NotChecked=0, Total=22952 [2019-08-04 21:42:05,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-08-04 21:42:05,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2019-08-04 21:42:05,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-08-04 21:42:05,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 155 transitions. [2019-08-04 21:42:05,474 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 155 transitions. Word has length 152 [2019-08-04 21:42:05,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:42:05,475 INFO L475 AbstractCegarLoop]: Abstraction has 154 states and 155 transitions. [2019-08-04 21:42:05,475 INFO L476 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-08-04 21:42:05,475 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 155 transitions. [2019-08-04 21:42:05,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-08-04 21:42:05,475 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:42:05,475 INFO L399 BasicCegarLoop]: trace histogram [50, 50, 49, 1, 1, 1, 1] [2019-08-04 21:42:05,476 INFO L418 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:42:05,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:42:05,476 INFO L82 PathProgramCache]: Analyzing trace with hash -236795519, now seen corresponding path program 98 times [2019-08-04 21:42:05,476 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:42:05,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:42:05,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 772 conjuncts, 104 conjunts are in the unsatisfiable core [2019-08-04 21:42:05,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:42:06,646 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:42:06,716 INFO L134 CoverageAnalysis]: Checked inductivity of 3725 backedges. 1275 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:42:06,716 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:42:06,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-04 21:42:06,716 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-04 21:42:06,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-04 21:42:06,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1380, Invalid=1482, Unknown=0, NotChecked=0, Total=2862 [2019-08-04 21:42:06,717 INFO L87 Difference]: Start difference. First operand 154 states and 155 transitions. Second operand 54 states. [2019-08-04 21:42:07,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:42:07,941 INFO L93 Difference]: Finished difference Result 160 states and 161 transitions. [2019-08-04 21:42:07,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-08-04 21:42:07,942 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 153 [2019-08-04 21:42:07,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:42:07,943 INFO L225 Difference]: With dead ends: 160 [2019-08-04 21:42:07,943 INFO L226 Difference]: Without dead ends: 160 [2019-08-04 21:42:07,943 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2550 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=4134, Invalid=6786, Unknown=0, NotChecked=0, Total=10920 [2019-08-04 21:42:07,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-08-04 21:42:07,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 156. [2019-08-04 21:42:07,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-08-04 21:42:07,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 157 transitions. [2019-08-04 21:42:07,946 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 157 transitions. Word has length 153 [2019-08-04 21:42:07,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:42:07,946 INFO L475 AbstractCegarLoop]: Abstraction has 156 states and 157 transitions. [2019-08-04 21:42:07,946 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-04 21:42:07,946 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 157 transitions. [2019-08-04 21:42:07,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-08-04 21:42:07,947 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:42:07,947 INFO L399 BasicCegarLoop]: trace histogram [51, 50, 50, 1, 1, 1, 1] [2019-08-04 21:42:07,947 INFO L418 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:42:07,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:42:07,948 INFO L82 PathProgramCache]: Analyzing trace with hash 72825243, now seen corresponding path program 99 times [2019-08-04 21:42:07,948 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:42:08,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:42:08,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 782 conjuncts, 106 conjunts are in the unsatisfiable core [2019-08-04 21:42:08,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:42:11,856 INFO L134 CoverageAnalysis]: Checked inductivity of 3825 backedges. 2550 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:42:11,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:42:11,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2019-08-04 21:42:11,857 INFO L454 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-08-04 21:42:11,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-08-04 21:42:11,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2755, Invalid=7957, Unknown=0, NotChecked=0, Total=10712 [2019-08-04 21:42:11,858 INFO L87 Difference]: Start difference. First operand 156 states and 157 transitions. Second operand 104 states. [2019-08-04 21:42:17,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:42:17,993 INFO L93 Difference]: Finished difference Result 258 states and 259 transitions. [2019-08-04 21:42:17,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-08-04 21:42:17,993 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 155 [2019-08-04 21:42:17,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:42:17,994 INFO L225 Difference]: With dead ends: 258 [2019-08-04 21:42:17,994 INFO L226 Difference]: Without dead ends: 157 [2019-08-04 21:42:17,995 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3775 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=5509, Invalid=18361, Unknown=0, NotChecked=0, Total=23870 [2019-08-04 21:42:17,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-08-04 21:42:17,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2019-08-04 21:42:17,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-08-04 21:42:17,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 158 transitions. [2019-08-04 21:42:17,997 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 158 transitions. Word has length 155 [2019-08-04 21:42:17,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:42:17,997 INFO L475 AbstractCegarLoop]: Abstraction has 157 states and 158 transitions. [2019-08-04 21:42:17,997 INFO L476 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-08-04 21:42:17,997 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 158 transitions. [2019-08-04 21:42:17,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-08-04 21:42:17,998 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:42:17,998 INFO L399 BasicCegarLoop]: trace histogram [51, 51, 50, 1, 1, 1, 1] [2019-08-04 21:42:17,999 INFO L418 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:42:17,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:42:17,999 INFO L82 PathProgramCache]: Analyzing trace with hash 4062212, now seen corresponding path program 100 times [2019-08-04 21:42:17,999 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:42:18,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:42:18,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 787 conjuncts, 106 conjunts are in the unsatisfiable core [2019-08-04 21:42:18,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:42:19,178 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:42:19,216 INFO L134 CoverageAnalysis]: Checked inductivity of 3876 backedges. 1326 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:42:19,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:42:19,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-04 21:42:19,217 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-04 21:42:19,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-04 21:42:19,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1433, Invalid=1537, Unknown=0, NotChecked=0, Total=2970 [2019-08-04 21:42:19,218 INFO L87 Difference]: Start difference. First operand 157 states and 158 transitions. Second operand 55 states. [2019-08-04 21:42:20,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:42:20,544 INFO L93 Difference]: Finished difference Result 163 states and 164 transitions. [2019-08-04 21:42:20,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-08-04 21:42:20,544 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 156 [2019-08-04 21:42:20,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:42:20,546 INFO L225 Difference]: With dead ends: 163 [2019-08-04 21:42:20,546 INFO L226 Difference]: Without dead ends: 163 [2019-08-04 21:42:20,547 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2652 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=4293, Invalid=7049, Unknown=0, NotChecked=0, Total=11342 [2019-08-04 21:42:20,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-08-04 21:42:20,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 159. [2019-08-04 21:42:20,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-08-04 21:42:20,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 160 transitions. [2019-08-04 21:42:20,550 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 160 transitions. Word has length 156 [2019-08-04 21:42:20,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:42:20,550 INFO L475 AbstractCegarLoop]: Abstraction has 159 states and 160 transitions. [2019-08-04 21:42:20,550 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-04 21:42:20,550 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 160 transitions. [2019-08-04 21:42:20,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-08-04 21:42:20,551 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:42:20,551 INFO L399 BasicCegarLoop]: trace histogram [52, 51, 51, 1, 1, 1, 1] [2019-08-04 21:42:20,551 INFO L418 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:42:20,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:42:20,551 INFO L82 PathProgramCache]: Analyzing trace with hash -391129250, now seen corresponding path program 101 times [2019-08-04 21:42:20,552 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:42:20,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:42:20,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 797 conjuncts, 108 conjunts are in the unsatisfiable core [2019-08-04 21:42:20,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:42:24,610 INFO L134 CoverageAnalysis]: Checked inductivity of 3978 backedges. 2652 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:42:24,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:42:24,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2019-08-04 21:42:24,611 INFO L454 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-08-04 21:42:24,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-08-04 21:42:24,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2861, Invalid=8269, Unknown=0, NotChecked=0, Total=11130 [2019-08-04 21:42:24,612 INFO L87 Difference]: Start difference. First operand 159 states and 160 transitions. Second operand 106 states. [2019-08-04 21:42:31,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:42:31,127 INFO L93 Difference]: Finished difference Result 263 states and 264 transitions. [2019-08-04 21:42:31,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-08-04 21:42:31,127 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 158 [2019-08-04 21:42:31,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:42:31,128 INFO L225 Difference]: With dead ends: 263 [2019-08-04 21:42:31,128 INFO L226 Difference]: Without dead ends: 160 [2019-08-04 21:42:31,129 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3927 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=5721, Invalid=19085, Unknown=0, NotChecked=0, Total=24806 [2019-08-04 21:42:31,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-08-04 21:42:31,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2019-08-04 21:42:31,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-08-04 21:42:31,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 161 transitions. [2019-08-04 21:42:31,148 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 161 transitions. Word has length 158 [2019-08-04 21:42:31,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:42:31,148 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 161 transitions. [2019-08-04 21:42:31,148 INFO L476 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-08-04 21:42:31,148 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 161 transitions. [2019-08-04 21:42:31,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-08-04 21:42:31,149 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:42:31,149 INFO L399 BasicCegarLoop]: trace histogram [52, 52, 51, 1, 1, 1, 1] [2019-08-04 21:42:31,150 INFO L418 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:42:31,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:42:31,150 INFO L82 PathProgramCache]: Analyzing trace with hash -211185579, now seen corresponding path program 102 times [2019-08-04 21:42:31,150 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:42:31,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:42:31,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 802 conjuncts, 108 conjunts are in the unsatisfiable core [2019-08-04 21:42:31,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:42:32,684 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:42:32,738 INFO L134 CoverageAnalysis]: Checked inductivity of 4030 backedges. 1378 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:42:32,739 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:42:32,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-04 21:42:32,739 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-04 21:42:32,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-04 21:42:32,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1487, Invalid=1593, Unknown=0, NotChecked=0, Total=3080 [2019-08-04 21:42:32,740 INFO L87 Difference]: Start difference. First operand 160 states and 161 transitions. Second operand 56 states. Received shutdown request... [2019-08-04 21:42:33,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-08-04 21:42:33,539 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-04 21:42:33,543 WARN L223 ceAbstractionStarter]: Timeout [2019-08-04 21:42:33,544 INFO L202 PluginConnector]: Adding new model seq.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 09:42:33 BoogieIcfgContainer [2019-08-04 21:42:33,544 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-04 21:42:33,546 INFO L168 Benchmark]: Toolchain (without parser) took 244713.32 ms. Allocated memory was 131.1 MB in the beginning and 736.1 MB in the end (delta: 605.0 MB). Free memory was 107.5 MB in the beginning and 146.0 MB in the end (delta: -38.5 MB). Peak memory consumption was 566.5 MB. Max. memory is 7.1 GB. [2019-08-04 21:42:33,546 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 131.1 MB. Free memory was 108.7 MB in the beginning and 108.5 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-08-04 21:42:33,547 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.82 ms. Allocated memory is still 131.1 MB. Free memory was 107.3 MB in the beginning and 105.7 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB. [2019-08-04 21:42:33,547 INFO L168 Benchmark]: Boogie Preprocessor took 26.90 ms. Allocated memory is still 131.1 MB. Free memory was 105.7 MB in the beginning and 104.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-08-04 21:42:33,548 INFO L168 Benchmark]: RCFGBuilder took 280.73 ms. Allocated memory is still 131.1 MB. Free memory was 104.4 MB in the beginning and 94.4 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2019-08-04 21:42:33,549 INFO L168 Benchmark]: TraceAbstraction took 244358.10 ms. Allocated memory was 131.1 MB in the beginning and 736.1 MB in the end (delta: 605.0 MB). Free memory was 94.0 MB in the beginning and 146.0 MB in the end (delta: -52.0 MB). Peak memory consumption was 553.0 MB. Max. memory is 7.1 GB. [2019-08-04 21:42:33,551 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.23 ms. Allocated memory is still 131.1 MB. Free memory was 108.7 MB in the beginning and 108.5 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 39.82 ms. Allocated memory is still 131.1 MB. Free memory was 107.3 MB in the beginning and 105.7 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 26.90 ms. Allocated memory is still 131.1 MB. Free memory was 105.7 MB in the beginning and 104.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 280.73 ms. Allocated memory is still 131.1 MB. Free memory was 104.4 MB in the beginning and 94.4 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 244358.10 ms. Allocated memory was 131.1 MB in the beginning and 736.1 MB in the end (delta: 605.0 MB). Free memory was 94.0 MB in the beginning and 146.0 MB in the end (delta: -52.0 MB). Peak memory consumption was 553.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 80]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 80). Cancelled while BasicCegarLoop was constructing difference of abstraction (160states) and FLOYD_HOARE automaton (currently 91 states, 56 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 92 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. TIMEOUT Result, 244.3s OverallTime, 104 OverallIterations, 52 TraceHistogramMax, 124.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 364 SDtfs, 693 SDslu, 2147 SDs, 0 SdLazy, 65980 SolverSat, 5532 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 43.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 11216 GetRequests, 4186 SyntacticMatches, 0 SemanticMatches, 7029 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117152 ImplicationChecksByTransitivity, 178.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=160occurred in iteration=103, 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, 103 MinimizatonAttempts, 204 StatesRemovedByMinimization, 51 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 3.4s SatisfiabilityAnalysisTime, 115.6s InterpolantComputationTime, 8528 NumberOfCodeBlocks, 8528 NumberOfCodeBlocksAsserted, 104 NumberOfCheckSat, 8424 ConstructedInterpolants, 0 QuantifiedInterpolants, 5254314 SizeOfPredicates, 416 NumberOfNonLiveVariables, 43368 ConjunctsInSsa, 5928 ConjunctsInUnsatCore, 104 InterpolantComputations, 2 PerfectInterpolantSequences, 71656/141934 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown