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/phases1.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:24:26,949 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:24:26,951 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:24:26,965 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:24:26,966 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:24:26,967 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:24:26,968 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:24:26,970 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:24:26,971 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:24:26,972 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:24:26,973 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:24:26,974 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:24:26,974 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:24:26,975 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:24:26,976 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:24:26,977 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:24:26,978 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:24:26,979 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:24:26,980 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:24:26,983 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:24:26,984 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:24:26,985 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:24:26,987 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:24:26,987 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:24:26,990 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:24:26,990 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:24:26,990 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:24:26,991 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:24:26,992 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:24:26,993 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:24:26,993 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:24:26,994 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:24:26,995 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:24:26,996 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:24:26,997 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:24:26,997 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:24:26,998 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:24:26,998 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:24:26,998 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:24:26,999 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:24:27,000 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:24:27,033 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:24:27,047 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:24:27,050 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:24:27,052 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:24:27,052 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:24:27,053 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/phases1.i_3.bpl [2019-08-05 10:24:27,054 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/phases1.i_3.bpl' [2019-08-05 10:24:27,088 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:24:27,090 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:24:27,090 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:24:27,091 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:24:27,091 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:24:27,111 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "phases1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:24:27" (1/1) ... [2019-08-05 10:24:27,120 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "phases1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:24:27" (1/1) ... [2019-08-05 10:24:27,132 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:24:27,133 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:24:27,134 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:24:27,134 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:24:27,144 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "phases1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:24:27" (1/1) ... [2019-08-05 10:24:27,145 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "phases1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:24:27" (1/1) ... [2019-08-05 10:24:27,147 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "phases1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:24:27" (1/1) ... [2019-08-05 10:24:27,147 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "phases1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:24:27" (1/1) ... [2019-08-05 10:24:27,151 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "phases1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:24:27" (1/1) ... [2019-08-05 10:24:27,153 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "phases1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:24:27" (1/1) ... [2019-08-05 10:24:27,155 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "phases1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:24:27" (1/1) ... [2019-08-05 10:24:27,157 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:24:27,158 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:24:27,158 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:24:27,158 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:24:27,162 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "phases1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:24:27" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 10:24:27,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 10:24:27,232 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 10:24:27,464 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 10:24:27,465 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-08-05 10:24:27,466 INFO L202 PluginConnector]: Adding new model phases1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:24:27 BoogieIcfgContainer [2019-08-05 10:24:27,466 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:24:27,468 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:24:27,468 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:24:27,474 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:24:27,475 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "phases1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:24:27" (1/2) ... [2019-08-05 10:24:27,476 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f76dd34 and model type phases1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:24:27, skipping insertion in model container [2019-08-05 10:24:27,476 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "phases1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:24:27" (2/2) ... [2019-08-05 10:24:27,478 INFO L109 eAbstractionObserver]: Analyzing ICFG phases1.i_3.bpl [2019-08-05 10:24:27,489 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:24:27,499 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:24:27,516 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:24:27,543 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:24:27,543 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:24:27,544 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:24:27,544 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:24:27,544 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:24:27,544 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:24:27,544 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:24:27,544 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:24:27,545 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:24:27,556 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-05 10:24:27,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 10:24:27,564 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:27,565 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 10:24:27,569 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:27,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:27,577 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2019-08-05 10:24:27,620 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:27,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:27,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:24:27,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:27,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:24:27,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:24:27,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:24:27,718 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:24:27,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:24:27,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:24:27,731 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-05 10:24:27,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:27,762 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-08-05 10:24:27,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:24:27,766 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 10:24:27,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:27,775 INFO L225 Difference]: With dead ends: 5 [2019-08-05 10:24:27,776 INFO L226 Difference]: Without dead ends: 5 [2019-08-05 10:24:27,778 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:24:27,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-05 10:24:27,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-05 10:24:27,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-05 10:24:27,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-05 10:24:27,812 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-05 10:24:27,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:27,812 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-05 10:24:27,813 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:24:27,813 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-05 10:24:27,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:24:27,814 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:27,814 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:24:27,814 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:27,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:27,815 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2019-08-05 10:24:27,816 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:27,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:27,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:24:27,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:27,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:24:27,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:27,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:24:27,968 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:24:27,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:24:27,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:24:27,970 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-08-05 10:24:28,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:28,043 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 10:24:28,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:24:28,044 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 10:24:28,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:28,045 INFO L225 Difference]: With dead ends: 6 [2019-08-05 10:24:28,045 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 10:24:28,047 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:24:28,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 10:24:28,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 10:24:28,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 10:24:28,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 10:24:28,050 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-05 10:24:28,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:28,050 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 10:24:28,050 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:24:28,051 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 10:24:28,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:24:28,051 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:28,051 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-05 10:24:28,052 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:28,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:28,052 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2019-08-05 10:24:28,054 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:28,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:28,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:24:28,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:28,141 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:24:28,142 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:28,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:24:28,142 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:24:28,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:24:28,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:24:28,144 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-08-05 10:24:28,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:28,199 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 10:24:28,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:24:28,201 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-05 10:24:28,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:28,201 INFO L225 Difference]: With dead ends: 7 [2019-08-05 10:24:28,202 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 10:24:28,203 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:24:28,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 10:24:28,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 10:24:28,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:24:28,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 10:24:28,207 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-05 10:24:28,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:28,208 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 10:24:28,208 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:24:28,208 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 10:24:28,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:24:28,209 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:28,209 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-05 10:24:28,210 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:28,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:28,210 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 3 times [2019-08-05 10:24:28,211 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:28,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:28,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:24:28,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:28,366 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:24:28,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:28,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:24:28,367 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:24:28,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:24:28,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:24:28,368 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-08-05 10:24:28,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:28,454 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 10:24:28,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:24:28,454 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-05 10:24:28,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:28,455 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:24:28,455 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:24:28,456 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:24:28,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:24:28,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 10:24:28,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:24:28,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 10:24:28,459 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-05 10:24:28,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:28,459 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 10:24:28,459 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:24:28,459 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 10:24:28,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:24:28,460 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:28,460 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-05 10:24:28,460 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:28,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:28,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1949894467, now seen corresponding path program 4 times [2019-08-05 10:24:28,462 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:28,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:28,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:24:28,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:28,621 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:24:28,621 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:28,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:24:28,622 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:24:28,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:24:28,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:24:28,623 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-08-05 10:24:28,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:28,788 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 10:24:28,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:24:28,789 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-05 10:24:28,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:28,790 INFO L225 Difference]: With dead ends: 9 [2019-08-05 10:24:28,790 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 10:24:28,790 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:24:28,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 10:24:28,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 10:24:28,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:24:28,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 10:24:28,793 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-05 10:24:28,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:28,793 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 10:24:28,793 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:24:28,793 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 10:24:28,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:24:28,794 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:28,794 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-08-05 10:24:28,794 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:28,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:28,795 INFO L82 PathProgramCache]: Analyzing trace with hash 317188140, now seen corresponding path program 5 times [2019-08-05 10:24:28,796 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:28,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:28,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:24:28,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:28,973 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:24:28,974 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:28,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:24:28,975 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:24:28,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:24:28,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:24:28,976 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2019-08-05 10:24:29,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:29,158 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 10:24:29,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:24:29,159 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:24:29,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:29,160 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:24:29,160 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:24:29,161 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:24:29,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:24:29,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 10:24:29,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:24:29,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 10:24:29,164 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-08-05 10:24:29,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:29,164 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 10:24:29,164 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:24:29,164 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 10:24:29,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:24:29,165 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:29,165 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-08-05 10:24:29,166 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:29,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:29,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1242899555, now seen corresponding path program 6 times [2019-08-05 10:24:29,167 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:29,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:29,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 10:24:29,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:29,290 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:24:29,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:29,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:24:29,291 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:24:29,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:24:29,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:24:29,292 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2019-08-05 10:24:29,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:29,375 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 10:24:29,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:24:29,376 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-08-05 10:24:29,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:29,377 INFO L225 Difference]: With dead ends: 11 [2019-08-05 10:24:29,378 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 10:24:29,378 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:24:29,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 10:24:29,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 10:24:29,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:24:29,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 10:24:29,381 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-08-05 10:24:29,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:29,381 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 10:24:29,381 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:24:29,381 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 10:24:29,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:24:29,382 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:29,382 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-08-05 10:24:29,382 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:29,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:29,382 INFO L82 PathProgramCache]: Analyzing trace with hash -124817652, now seen corresponding path program 7 times [2019-08-05 10:24:29,383 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:29,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:29,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:24:29,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:29,790 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:24:29,790 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:29,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:24:29,791 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:24:29,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:24:29,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:24:29,792 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2019-08-05 10:24:29,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:29,881 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 10:24:29,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:24:29,882 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-08-05 10:24:29,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:29,882 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:24:29,883 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:24:29,883 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:24:29,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:24:29,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 10:24:29,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:24:29,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 10:24:29,886 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-08-05 10:24:29,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:29,887 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 10:24:29,887 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:24:29,887 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 10:24:29,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:24:29,887 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:29,888 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-08-05 10:24:29,888 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:29,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:29,888 INFO L82 PathProgramCache]: Analyzing trace with hash 425621891, now seen corresponding path program 8 times [2019-08-05 10:24:29,889 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:29,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:29,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 10:24:29,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:30,171 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:24:30,171 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:30,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:24:30,172 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:24:30,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:24:30,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:24:30,172 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-08-05 10:24:30,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:30,285 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-05 10:24:30,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:24:30,287 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-08-05 10:24:30,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:30,288 INFO L225 Difference]: With dead ends: 13 [2019-08-05 10:24:30,288 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 10:24:30,289 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:24:30,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 10:24:30,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 10:24:30,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:24:30,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-05 10:24:30,292 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-08-05 10:24:30,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:30,292 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-05 10:24:30,292 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:24:30,292 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-05 10:24:30,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:24:30,293 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:30,293 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-08-05 10:24:30,293 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:30,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:30,294 INFO L82 PathProgramCache]: Analyzing trace with hash 309378540, now seen corresponding path program 9 times [2019-08-05 10:24:30,295 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:30,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:30,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:24:30,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:30,472 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:24:30,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:30,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:24:30,473 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:24:30,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:24:30,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:24:30,474 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2019-08-05 10:24:30,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:30,652 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-05 10:24:30,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:24:30,652 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-08-05 10:24:30,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:30,653 INFO L225 Difference]: With dead ends: 14 [2019-08-05 10:24:30,653 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 10:24:30,654 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:24:30,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 10:24:30,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 10:24:30,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 10:24:30,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-05 10:24:30,656 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-08-05 10:24:30,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:30,656 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-05 10:24:30,656 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:24:30,657 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-05 10:24:30,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:24:30,657 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:30,657 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-08-05 10:24:30,657 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:30,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:30,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1000801955, now seen corresponding path program 10 times [2019-08-05 10:24:30,658 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:30,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:30,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 10:24:30,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:30,909 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:24:30,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:30,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:24:30,910 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:24:30,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:24:30,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:24:30,911 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2019-08-05 10:24:31,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:31,075 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-05 10:24:31,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:24:31,083 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-08-05 10:24:31,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:31,084 INFO L225 Difference]: With dead ends: 15 [2019-08-05 10:24:31,084 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 10:24:31,084 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:24:31,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 10:24:31,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 10:24:31,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 10:24:31,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-05 10:24:31,086 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-08-05 10:24:31,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:31,086 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-05 10:24:31,086 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:24:31,086 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-05 10:24:31,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:24:31,087 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:31,087 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2019-08-05 10:24:31,087 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:31,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:31,088 INFO L82 PathProgramCache]: Analyzing trace with hash 960091340, now seen corresponding path program 11 times [2019-08-05 10:24:31,088 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:31,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:31,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 10:24:31,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:31,270 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:24:31,271 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:31,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:24:31,271 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:24:31,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:24:31,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:24:31,272 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2019-08-05 10:24:31,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:31,494 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-05 10:24:31,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:24:31,494 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-08-05 10:24:31,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:31,495 INFO L225 Difference]: With dead ends: 16 [2019-08-05 10:24:31,495 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 10:24:31,496 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:24:31,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 10:24:31,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 10:24:31,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 10:24:31,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-05 10:24:31,499 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-08-05 10:24:31,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:31,499 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-05 10:24:31,499 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:24:31,500 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-05 10:24:31,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:24:31,500 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:31,500 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-08-05 10:24:31,500 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:31,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:31,501 INFO L82 PathProgramCache]: Analyzing trace with hash -301937725, now seen corresponding path program 12 times [2019-08-05 10:24:31,502 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:31,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:31,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 10:24:31,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:31,869 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:24:31,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:31,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:24:31,870 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:24:31,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:24:31,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:24:31,871 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2019-08-05 10:24:32,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:32,048 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-05 10:24:32,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:24:32,056 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-08-05 10:24:32,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:32,057 INFO L225 Difference]: With dead ends: 17 [2019-08-05 10:24:32,057 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 10:24:32,058 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:24:32,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 10:24:32,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 10:24:32,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:24:32,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-05 10:24:32,061 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-08-05 10:24:32,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:32,061 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-05 10:24:32,061 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:24:32,061 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-05 10:24:32,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:24:32,062 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:32,062 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2019-08-05 10:24:32,062 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:32,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:32,063 INFO L82 PathProgramCache]: Analyzing trace with hash -770133076, now seen corresponding path program 13 times [2019-08-05 10:24:32,064 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:32,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:32,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 10:24:32,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:32,415 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:24:32,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:32,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:24:32,416 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:24:32,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:24:32,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:24:32,417 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2019-08-05 10:24:32,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:32,670 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-05 10:24:32,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:24:32,670 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-08-05 10:24:32,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:32,671 INFO L225 Difference]: With dead ends: 18 [2019-08-05 10:24:32,671 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 10:24:32,672 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:24:32,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 10:24:32,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-05 10:24:32,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 10:24:32,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-08-05 10:24:32,675 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-08-05 10:24:32,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:32,675 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-08-05 10:24:32,676 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:24:32,676 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-08-05 10:24:32,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:24:32,676 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:32,676 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2019-08-05 10:24:32,677 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:32,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:32,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1895680227, now seen corresponding path program 14 times [2019-08-05 10:24:32,678 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:32,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:32,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 10:24:32,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:32,857 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:24:32,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:32,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:24:32,858 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:24:32,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:24:32,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:24:32,859 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2019-08-05 10:24:33,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:33,064 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-05 10:24:33,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:24:33,064 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-08-05 10:24:33,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:33,065 INFO L225 Difference]: With dead ends: 19 [2019-08-05 10:24:33,065 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 10:24:33,066 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:24:33,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 10:24:33,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 10:24:33,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:24:33,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-05 10:24:33,069 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-08-05 10:24:33,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:33,070 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-05 10:24:33,070 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:24:33,070 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-05 10:24:33,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:24:33,070 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:33,071 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2019-08-05 10:24:33,071 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:33,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:33,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1363453300, now seen corresponding path program 15 times [2019-08-05 10:24:33,072 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:33,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:33,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 10:24:33,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:33,684 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:24:33,684 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:33,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:24:33,684 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:24:33,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:24:33,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:24:33,685 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2019-08-05 10:24:34,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:34,329 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-05 10:24:34,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:24:34,330 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-08-05 10:24:34,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:34,331 INFO L225 Difference]: With dead ends: 20 [2019-08-05 10:24:34,331 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 10:24:34,332 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:24:34,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 10:24:34,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 10:24:34,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 10:24:34,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-05 10:24:34,335 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-08-05 10:24:34,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:34,336 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-05 10:24:34,336 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:24:34,336 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-05 10:24:34,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:24:34,336 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:34,337 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2019-08-05 10:24:34,337 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:34,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:34,337 INFO L82 PathProgramCache]: Analyzing trace with hash 682622467, now seen corresponding path program 16 times [2019-08-05 10:24:34,338 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:34,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:34,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 10:24:34,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:34,816 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:24:34,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:34,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:24:34,817 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:24:34,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:24:34,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:24:34,818 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2019-08-05 10:24:35,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:35,090 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-08-05 10:24:35,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:24:35,091 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-08-05 10:24:35,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:35,091 INFO L225 Difference]: With dead ends: 21 [2019-08-05 10:24:35,092 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 10:24:35,092 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:24:35,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 10:24:35,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-05 10:24:35,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 10:24:35,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-05 10:24:35,095 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-08-05 10:24:35,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:35,095 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-05 10:24:35,095 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:24:35,095 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-05 10:24:35,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:24:35,096 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:35,096 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2019-08-05 10:24:35,096 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:35,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:35,097 INFO L82 PathProgramCache]: Analyzing trace with hash -313538196, now seen corresponding path program 17 times [2019-08-05 10:24:35,097 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:35,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:35,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 10:24:35,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:35,359 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:24:35,359 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:35,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:24:35,359 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:24:35,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:24:35,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:24:35,360 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2019-08-05 10:24:35,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:35,737 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-05 10:24:35,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:24:35,738 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-08-05 10:24:35,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:35,739 INFO L225 Difference]: With dead ends: 22 [2019-08-05 10:24:35,739 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 10:24:35,739 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:24:35,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 10:24:35,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-05 10:24:35,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 10:24:35,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-08-05 10:24:35,742 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-08-05 10:24:35,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:35,742 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-08-05 10:24:35,743 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:24:35,743 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-08-05 10:24:35,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:24:35,743 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:35,743 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2019-08-05 10:24:35,744 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:35,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:35,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1129747677, now seen corresponding path program 18 times [2019-08-05 10:24:35,745 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:35,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:35,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 10:24:35,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:36,030 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:24:36,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:36,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:24:36,031 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:24:36,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:24:36,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:24:36,031 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2019-08-05 10:24:36,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:36,593 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-08-05 10:24:36,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:24:36,593 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-08-05 10:24:36,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:36,594 INFO L225 Difference]: With dead ends: 23 [2019-08-05 10:24:36,594 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 10:24:36,595 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:24:36,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 10:24:36,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-05 10:24:36,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 10:24:36,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-08-05 10:24:36,599 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-08-05 10:24:36,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:36,599 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-08-05 10:24:36,599 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:24:36,599 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-08-05 10:24:36,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:24:36,600 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:36,600 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2019-08-05 10:24:36,600 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:36,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:36,601 INFO L82 PathProgramCache]: Analyzing trace with hash -662437812, now seen corresponding path program 19 times [2019-08-05 10:24:36,601 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:36,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:36,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 10:24:36,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:36,949 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:24:36,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:36,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:24:36,949 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:24:36,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:24:36,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:24:36,950 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2019-08-05 10:24:37,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:37,310 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-08-05 10:24:37,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:24:37,311 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-05 10:24:37,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:37,311 INFO L225 Difference]: With dead ends: 24 [2019-08-05 10:24:37,312 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 10:24:37,312 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:24:37,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 10:24:37,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-05 10:24:37,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 10:24:37,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-08-05 10:24:37,316 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-08-05 10:24:37,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:37,316 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-08-05 10:24:37,316 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:24:37,316 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-08-05 10:24:37,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:24:37,317 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:37,317 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2019-08-05 10:24:37,317 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:37,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:37,318 INFO L82 PathProgramCache]: Analyzing trace with hash 939266115, now seen corresponding path program 20 times [2019-08-05 10:24:37,319 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:37,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:37,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 10:24:37,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:37,584 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:24:37,585 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:37,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:24:37,585 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:24:37,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:24:37,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:24:37,586 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2019-08-05 10:24:37,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:37,949 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-08-05 10:24:37,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:24:37,949 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-08-05 10:24:37,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:37,950 INFO L225 Difference]: With dead ends: 25 [2019-08-05 10:24:37,950 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 10:24:37,951 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:24:37,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 10:24:37,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-05 10:24:37,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 10:24:37,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-08-05 10:24:37,954 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-08-05 10:24:37,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:37,954 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-08-05 10:24:37,955 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:24:37,955 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-08-05 10:24:37,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:24:37,955 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:37,955 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2019-08-05 10:24:37,956 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:37,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:37,956 INFO L82 PathProgramCache]: Analyzing trace with hash -947519700, now seen corresponding path program 21 times [2019-08-05 10:24:37,957 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:37,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:37,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-05 10:24:37,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:38,250 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:24:38,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:38,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:24:38,251 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:24:38,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:24:38,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:24:38,252 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2019-08-05 10:24:38,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:38,701 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-08-05 10:24:38,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:24:38,703 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-08-05 10:24:38,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:38,704 INFO L225 Difference]: With dead ends: 26 [2019-08-05 10:24:38,704 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 10:24:38,705 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:24:38,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 10:24:38,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-08-05 10:24:38,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 10:24:38,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-08-05 10:24:38,708 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-08-05 10:24:38,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:38,708 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-08-05 10:24:38,708 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:24:38,708 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-08-05 10:24:38,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:24:38,709 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:38,709 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2019-08-05 10:24:38,709 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:38,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:38,710 INFO L82 PathProgramCache]: Analyzing trace with hash 691662179, now seen corresponding path program 22 times [2019-08-05 10:24:38,710 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:38,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:38,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 10:24:38,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:39,024 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:24:39,025 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:39,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:24:39,025 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:24:39,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:24:39,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:24:39,026 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2019-08-05 10:24:39,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:39,848 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-08-05 10:24:39,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:24:39,850 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-08-05 10:24:39,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:39,850 INFO L225 Difference]: With dead ends: 27 [2019-08-05 10:24:39,850 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 10:24:39,851 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:24:39,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 10:24:39,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-08-05 10:24:39,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 10:24:39,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-08-05 10:24:39,853 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-08-05 10:24:39,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:39,853 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-08-05 10:24:39,854 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:24:39,854 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-08-05 10:24:39,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:24:39,854 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:39,854 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2019-08-05 10:24:39,855 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:39,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:39,855 INFO L82 PathProgramCache]: Analyzing trace with hash -33307124, now seen corresponding path program 23 times [2019-08-05 10:24:39,856 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:39,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:39,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 10:24:39,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:40,411 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:24:40,412 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:40,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:24:40,412 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:24:40,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:24:40,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:24:40,413 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2019-08-05 10:24:41,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:41,080 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-08-05 10:24:41,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:24:41,084 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-08-05 10:24:41,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:41,084 INFO L225 Difference]: With dead ends: 28 [2019-08-05 10:24:41,084 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 10:24:41,085 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:24:41,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 10:24:41,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-05 10:24:41,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:24:41,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-08-05 10:24:41,091 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-08-05 10:24:41,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:41,091 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-08-05 10:24:41,092 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:24:41,092 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-08-05 10:24:41,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:24:41,092 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:41,092 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2019-08-05 10:24:41,093 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:41,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:41,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1032519037, now seen corresponding path program 24 times [2019-08-05 10:24:41,094 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:41,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:41,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-05 10:24:41,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:41,590 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:24:41,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:41,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:24:41,591 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:24:41,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:24:41,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:24:41,592 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2019-08-05 10:24:42,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:42,239 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-08-05 10:24:42,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:24:42,239 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-08-05 10:24:42,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:42,240 INFO L225 Difference]: With dead ends: 29 [2019-08-05 10:24:42,240 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 10:24:42,241 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:24:42,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 10:24:42,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-05 10:24:42,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 10:24:42,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-08-05 10:24:42,244 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-08-05 10:24:42,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:42,244 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-08-05 10:24:42,245 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:24:42,245 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-08-05 10:24:42,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:24:42,245 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:42,245 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2019-08-05 10:24:42,246 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:42,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:42,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1943317268, now seen corresponding path program 25 times [2019-08-05 10:24:42,247 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:42,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:42,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 10:24:42,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:43,508 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:24:43,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:43,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 10:24:43,509 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:24:43,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:24:43,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:24:43,510 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2019-08-05 10:24:44,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:44,043 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-08-05 10:24:44,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:24:44,044 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2019-08-05 10:24:44,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:44,045 INFO L225 Difference]: With dead ends: 30 [2019-08-05 10:24:44,045 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 10:24:44,045 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:24:44,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 10:24:44,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-08-05 10:24:44,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 10:24:44,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-08-05 10:24:44,049 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-08-05 10:24:44,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:44,049 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-08-05 10:24:44,049 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:24:44,049 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-08-05 10:24:44,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:24:44,049 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:44,049 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2019-08-05 10:24:44,050 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:44,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:44,050 INFO L82 PathProgramCache]: Analyzing trace with hash -113291357, now seen corresponding path program 26 times [2019-08-05 10:24:44,051 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:44,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:44,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-05 10:24:44,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:44,463 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:24:44,464 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:44,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 10:24:44,465 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 10:24:44,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 10:24:44,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:24:44,466 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2019-08-05 10:24:45,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:45,018 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-08-05 10:24:45,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:24:45,019 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2019-08-05 10:24:45,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:45,019 INFO L225 Difference]: With dead ends: 31 [2019-08-05 10:24:45,019 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 10:24:45,020 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:24:45,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 10:24:45,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-05 10:24:45,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 10:24:45,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-08-05 10:24:45,023 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-08-05 10:24:45,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:45,024 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-08-05 10:24:45,024 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 10:24:45,024 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-08-05 10:24:45,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:24:45,024 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:45,025 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2019-08-05 10:24:45,025 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:45,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:45,025 INFO L82 PathProgramCache]: Analyzing trace with hash 782937036, now seen corresponding path program 27 times [2019-08-05 10:24:45,026 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:45,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:45,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-05 10:24:45,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:45,505 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:24:45,505 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:45,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 10:24:45,506 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:24:45,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:24:45,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:24:45,507 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2019-08-05 10:24:46,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:46,120 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-08-05 10:24:46,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 10:24:46,121 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2019-08-05 10:24:46,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:46,121 INFO L225 Difference]: With dead ends: 32 [2019-08-05 10:24:46,122 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 10:24:46,122 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:24:46,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 10:24:46,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-08-05 10:24:46,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 10:24:46,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-08-05 10:24:46,126 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-08-05 10:24:46,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:46,127 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-08-05 10:24:46,127 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:24:46,127 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-08-05 10:24:46,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 10:24:46,127 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:46,127 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2019-08-05 10:24:46,128 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:46,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:46,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1498753853, now seen corresponding path program 28 times [2019-08-05 10:24:46,129 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:46,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:46,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-05 10:24:46,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:46,525 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:24:46,526 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:46,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 10:24:46,526 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 10:24:46,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 10:24:46,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:24:46,527 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2019-08-05 10:24:47,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:47,313 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-08-05 10:24:47,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 10:24:47,313 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2019-08-05 10:24:47,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:47,314 INFO L225 Difference]: With dead ends: 33 [2019-08-05 10:24:47,314 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 10:24:47,315 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:24:47,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 10:24:47,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-08-05 10:24:47,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 10:24:47,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-08-05 10:24:47,318 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-08-05 10:24:47,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:47,318 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-08-05 10:24:47,318 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 10:24:47,318 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-08-05 10:24:47,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:24:47,319 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:47,319 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2019-08-05 10:24:47,319 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:47,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:47,320 INFO L82 PathProgramCache]: Analyzing trace with hash 783272620, now seen corresponding path program 29 times [2019-08-05 10:24:47,320 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:47,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:47,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-05 10:24:47,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:47,955 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:24:47,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:47,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 10:24:47,956 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:24:47,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:24:47,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:24:47,957 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2019-08-05 10:24:48,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:48,668 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-08-05 10:24:48,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:24:48,668 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2019-08-05 10:24:48,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:48,669 INFO L225 Difference]: With dead ends: 34 [2019-08-05 10:24:48,669 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 10:24:48,670 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:24:48,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 10:24:48,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-08-05 10:24:48,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 10:24:48,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-08-05 10:24:48,673 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-08-05 10:24:48,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:48,674 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-08-05 10:24:48,674 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:24:48,674 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-08-05 10:24:48,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 10:24:48,675 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:48,675 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2019-08-05 10:24:48,675 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:48,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:48,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1488350749, now seen corresponding path program 30 times [2019-08-05 10:24:48,676 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:48,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:48,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-05 10:24:48,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:49,162 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:24:49,162 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:49,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:24:49,163 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 10:24:49,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 10:24:49,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:24:49,164 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2019-08-05 10:24:49,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:49,928 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-08-05 10:24:49,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 10:24:49,929 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2019-08-05 10:24:49,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:49,930 INFO L225 Difference]: With dead ends: 35 [2019-08-05 10:24:49,930 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 10:24:49,931 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:24:49,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 10:24:49,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-05 10:24:49,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 10:24:49,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-08-05 10:24:49,933 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-08-05 10:24:49,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:49,934 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-08-05 10:24:49,934 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 10:24:49,934 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-08-05 10:24:49,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 10:24:49,934 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:49,934 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2019-08-05 10:24:49,935 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:49,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:49,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1105768844, now seen corresponding path program 31 times [2019-08-05 10:24:49,936 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:49,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:49,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-05 10:24:49,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:50,850 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:24:50,850 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:50,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:24:50,851 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:24:50,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:24:50,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:24:50,852 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2019-08-05 10:24:51,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:51,619 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-08-05 10:24:51,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:24:51,620 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2019-08-05 10:24:51,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:51,621 INFO L225 Difference]: With dead ends: 36 [2019-08-05 10:24:51,621 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 10:24:51,622 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:24:51,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 10:24:51,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-05 10:24:51,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:24:51,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-08-05 10:24:51,625 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-08-05 10:24:51,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:51,625 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-08-05 10:24:51,625 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:24:51,625 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-08-05 10:24:51,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:24:51,626 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:51,626 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2019-08-05 10:24:51,626 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:51,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:51,626 INFO L82 PathProgramCache]: Analyzing trace with hash -80902397, now seen corresponding path program 32 times [2019-08-05 10:24:51,627 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:51,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:51,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-05 10:24:51,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:52,456 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:24:52,456 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:52,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 10:24:52,457 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:24:52,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:24:52,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:24:52,458 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2019-08-05 10:24:53,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:53,271 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-08-05 10:24:53,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 10:24:53,272 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2019-08-05 10:24:53,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:53,272 INFO L225 Difference]: With dead ends: 37 [2019-08-05 10:24:53,273 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 10:24:53,274 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:24:53,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 10:24:53,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-05 10:24:53,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 10:24:53,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-08-05 10:24:53,276 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-08-05 10:24:53,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:53,277 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-08-05 10:24:53,277 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:24:53,277 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-08-05 10:24:53,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 10:24:53,277 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:53,277 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2019-08-05 10:24:53,280 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:53,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:53,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1786994796, now seen corresponding path program 33 times [2019-08-05 10:24:53,281 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:53,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:53,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-05 10:24:53,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:54,088 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:24:54,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:54,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:24:54,089 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 10:24:54,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 10:24:54,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:24:54,090 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2019-08-05 10:24:55,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:55,012 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-08-05 10:24:55,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 10:24:55,012 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2019-08-05 10:24:55,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:55,013 INFO L225 Difference]: With dead ends: 38 [2019-08-05 10:24:55,013 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 10:24:55,014 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:24:55,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 10:24:55,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-08-05 10:24:55,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 10:24:55,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-08-05 10:24:55,017 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-08-05 10:24:55,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:55,017 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-08-05 10:24:55,017 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 10:24:55,017 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-08-05 10:24:55,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 10:24:55,018 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:55,018 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2019-08-05 10:24:55,018 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:55,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:55,018 INFO L82 PathProgramCache]: Analyzing trace with hash -437734365, now seen corresponding path program 34 times [2019-08-05 10:24:55,019 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:55,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:55,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 72 conjunts are in the unsatisfiable core [2019-08-05 10:24:55,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:56,689 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:24:56,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:56,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 10:24:56,690 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 10:24:56,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 10:24:56,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:24:56,691 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2019-08-05 10:24:57,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:57,761 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-08-05 10:24:57,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 10:24:57,762 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2019-08-05 10:24:57,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:57,762 INFO L225 Difference]: With dead ends: 39 [2019-08-05 10:24:57,762 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 10:24:57,763 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:24:57,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 10:24:57,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-08-05 10:24:57,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 10:24:57,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-08-05 10:24:57,766 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-08-05 10:24:57,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:57,766 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-08-05 10:24:57,766 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 10:24:57,766 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-08-05 10:24:57,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 10:24:57,767 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:57,767 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2019-08-05 10:24:57,767 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:57,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:57,768 INFO L82 PathProgramCache]: Analyzing trace with hash -684861620, now seen corresponding path program 35 times [2019-08-05 10:24:57,768 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:57,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:57,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-05 10:24:57,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:58,884 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:24:58,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:58,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:24:58,885 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 10:24:58,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 10:24:58,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:24:58,886 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2019-08-05 10:24:59,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:59,849 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-08-05 10:24:59,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 10:24:59,850 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2019-08-05 10:24:59,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:59,850 INFO L225 Difference]: With dead ends: 40 [2019-08-05 10:24:59,851 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 10:24:59,852 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:24:59,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 10:24:59,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-08-05 10:24:59,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:24:59,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-08-05 10:24:59,854 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-08-05 10:24:59,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:59,854 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-08-05 10:24:59,854 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 10:24:59,854 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-08-05 10:24:59,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 10:24:59,855 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:59,855 INFO L399 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2019-08-05 10:24:59,855 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:59,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:59,855 INFO L82 PathProgramCache]: Analyzing trace with hash 244128067, now seen corresponding path program 36 times [2019-08-05 10:24:59,856 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:59,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:59,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-05 10:24:59,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:00,484 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:25:00,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:25:00,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 10:25:00,484 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 10:25:00,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 10:25:00,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:25:00,487 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2019-08-05 10:25:01,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:01,589 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-08-05 10:25:01,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 10:25:01,590 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2019-08-05 10:25:01,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:01,590 INFO L225 Difference]: With dead ends: 41 [2019-08-05 10:25:01,590 INFO L226 Difference]: Without dead ends: 41 [2019-08-05 10:25:01,591 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:25:01,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-05 10:25:01,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-08-05 10:25:01,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 10:25:01,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-08-05 10:25:01,594 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-08-05 10:25:01,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:01,594 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-08-05 10:25:01,594 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 10:25:01,594 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-08-05 10:25:01,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 10:25:01,595 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:01,595 INFO L399 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2019-08-05 10:25:01,595 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:01,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:01,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1021962708, now seen corresponding path program 37 times [2019-08-05 10:25:01,596 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:01,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:01,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 78 conjunts are in the unsatisfiable core [2019-08-05 10:25:01,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:02,912 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:25:02,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:25:02,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 10:25:02,913 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 10:25:02,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 10:25:02,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:25:02,914 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2019-08-05 10:25:04,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:04,036 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-08-05 10:25:04,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 10:25:04,037 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2019-08-05 10:25:04,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:04,037 INFO L225 Difference]: With dead ends: 42 [2019-08-05 10:25:04,038 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 10:25:04,039 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:25:04,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 10:25:04,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-08-05 10:25:04,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:25:04,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-08-05 10:25:04,041 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-08-05 10:25:04,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:04,041 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-08-05 10:25:04,041 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 10:25:04,042 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-08-05 10:25:04,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 10:25:04,042 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:04,042 INFO L399 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2019-08-05 10:25:04,043 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:04,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:04,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1616071069, now seen corresponding path program 38 times [2019-08-05 10:25:04,044 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:04,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:04,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 80 conjunts are in the unsatisfiable core [2019-08-05 10:25:04,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:04,859 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:25:04,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:25:04,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 10:25:04,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 10:25:04,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 10:25:04,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:25:04,861 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2019-08-05 10:25:05,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:05,992 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-08-05 10:25:05,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 10:25:05,993 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2019-08-05 10:25:05,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:05,994 INFO L225 Difference]: With dead ends: 43 [2019-08-05 10:25:05,994 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 10:25:05,995 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:25:05,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 10:25:05,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-05 10:25:05,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 10:25:05,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-08-05 10:25:05,997 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-08-05 10:25:05,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:05,998 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-08-05 10:25:05,998 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 10:25:05,998 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-08-05 10:25:05,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 10:25:05,998 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:05,998 INFO L399 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2019-08-05 10:25:05,999 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:05,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:05,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1441406220, now seen corresponding path program 39 times [2019-08-05 10:25:06,000 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:06,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:06,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 82 conjunts are in the unsatisfiable core [2019-08-05 10:25:06,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:06,668 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:25:06,668 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:25:06,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 10:25:06,669 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:25:06,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:25:06,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:25:06,670 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2019-08-05 10:25:08,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:08,047 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-08-05 10:25:08,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 10:25:08,047 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2019-08-05 10:25:08,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:08,048 INFO L225 Difference]: With dead ends: 44 [2019-08-05 10:25:08,048 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 10:25:08,049 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:25:08,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 10:25:08,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-08-05 10:25:08,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:25:08,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-08-05 10:25:08,052 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-08-05 10:25:08,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:08,052 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-08-05 10:25:08,052 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:25:08,053 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-08-05 10:25:08,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 10:25:08,053 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:08,053 INFO L399 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2019-08-05 10:25:08,053 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:08,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:08,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1733921667, now seen corresponding path program 40 times [2019-08-05 10:25:08,054 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:08,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:08,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 84 conjunts are in the unsatisfiable core [2019-08-05 10:25:08,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:08,809 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:25:08,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:25:08,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 10:25:08,809 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 10:25:08,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 10:25:08,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:25:08,810 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2019-08-05 10:25:10,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:10,140 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-08-05 10:25:10,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 10:25:10,141 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2019-08-05 10:25:10,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:10,141 INFO L225 Difference]: With dead ends: 45 [2019-08-05 10:25:10,142 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 10:25:10,143 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:25:10,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 10:25:10,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-05 10:25:10,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 10:25:10,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-08-05 10:25:10,145 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-08-05 10:25:10,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:10,145 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-08-05 10:25:10,145 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 10:25:10,145 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-08-05 10:25:10,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 10:25:10,146 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:10,146 INFO L399 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2019-08-05 10:25:10,146 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:10,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:10,146 INFO L82 PathProgramCache]: Analyzing trace with hash -2083001364, now seen corresponding path program 41 times [2019-08-05 10:25:10,147 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:10,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:10,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 86 conjunts are in the unsatisfiable core [2019-08-05 10:25:10,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:11,257 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:25:11,257 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:25:11,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 10:25:11,257 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 10:25:11,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 10:25:11,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:25:11,259 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2019-08-05 10:25:12,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:12,719 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-08-05 10:25:12,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:25:12,719 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2019-08-05 10:25:12,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:12,720 INFO L225 Difference]: With dead ends: 46 [2019-08-05 10:25:12,720 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 10:25:12,721 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:25:12,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 10:25:12,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-08-05 10:25:12,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:25:12,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-08-05 10:25:12,723 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-08-05 10:25:12,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:12,723 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-08-05 10:25:12,723 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 10:25:12,723 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-08-05 10:25:12,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 10:25:12,724 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:12,724 INFO L399 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2019-08-05 10:25:12,724 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:12,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:12,724 INFO L82 PathProgramCache]: Analyzing trace with hash -148531037, now seen corresponding path program 42 times [2019-08-05 10:25:12,725 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:12,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:12,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 88 conjunts are in the unsatisfiable core [2019-08-05 10:25:12,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:13,978 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:25:13,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:25:13,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 10:25:13,979 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 10:25:13,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 10:25:13,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:25:13,980 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2019-08-05 10:25:15,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:15,353 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-08-05 10:25:15,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 10:25:15,353 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2019-08-05 10:25:15,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:15,354 INFO L225 Difference]: With dead ends: 47 [2019-08-05 10:25:15,354 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 10:25:15,355 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:25:15,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 10:25:15,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-08-05 10:25:15,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 10:25:15,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-08-05 10:25:15,358 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-08-05 10:25:15,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:15,358 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-08-05 10:25:15,358 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 10:25:15,359 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-08-05 10:25:15,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 10:25:15,359 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:15,359 INFO L399 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2019-08-05 10:25:15,359 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:15,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:15,359 INFO L82 PathProgramCache]: Analyzing trace with hash -309493044, now seen corresponding path program 43 times [2019-08-05 10:25:15,360 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:15,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:15,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 90 conjunts are in the unsatisfiable core [2019-08-05 10:25:15,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:16,191 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:25:16,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:25:16,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 10:25:16,192 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:25:16,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:25:16,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:25:16,193 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2019-08-05 10:25:17,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:17,819 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-08-05 10:25:17,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 10:25:17,820 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2019-08-05 10:25:17,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:17,820 INFO L225 Difference]: With dead ends: 48 [2019-08-05 10:25:17,821 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 10:25:17,821 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:25:17,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 10:25:17,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-08-05 10:25:17,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:25:17,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-08-05 10:25:17,823 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2019-08-05 10:25:17,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:17,824 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-08-05 10:25:17,824 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:25:17,824 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-08-05 10:25:17,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 10:25:17,824 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:17,824 INFO L399 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2019-08-05 10:25:17,825 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:17,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:17,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1004347965, now seen corresponding path program 44 times [2019-08-05 10:25:17,826 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:17,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:17,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 92 conjunts are in the unsatisfiable core [2019-08-05 10:25:17,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:19,228 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:25:19,228 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:25:19,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 10:25:19,229 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 10:25:19,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 10:25:19,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:25:19,229 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2019-08-05 10:25:20,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:20,727 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-08-05 10:25:20,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 10:25:20,728 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2019-08-05 10:25:20,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:20,729 INFO L225 Difference]: With dead ends: 49 [2019-08-05 10:25:20,729 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 10:25:20,729 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:25:20,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 10:25:20,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-08-05 10:25:20,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 10:25:20,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-08-05 10:25:20,732 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2019-08-05 10:25:20,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:20,732 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-08-05 10:25:20,732 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 10:25:20,732 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-08-05 10:25:20,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 10:25:20,733 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:20,733 INFO L399 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2019-08-05 10:25:20,733 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:20,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:20,734 INFO L82 PathProgramCache]: Analyzing trace with hash -1070014036, now seen corresponding path program 45 times [2019-08-05 10:25:20,734 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:20,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:20,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 94 conjunts are in the unsatisfiable core [2019-08-05 10:25:20,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:21,640 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:25:21,640 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:25:21,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 10:25:21,640 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 10:25:21,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 10:25:21,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:25:21,641 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2019-08-05 10:25:23,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:23,366 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-08-05 10:25:23,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 10:25:23,367 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2019-08-05 10:25:23,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:23,367 INFO L225 Difference]: With dead ends: 50 [2019-08-05 10:25:23,367 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 10:25:23,368 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:25:23,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 10:25:23,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-08-05 10:25:23,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 10:25:23,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-08-05 10:25:23,370 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2019-08-05 10:25:23,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:23,370 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-08-05 10:25:23,370 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 10:25:23,370 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-08-05 10:25:23,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-05 10:25:23,371 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:23,371 INFO L399 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2019-08-05 10:25:23,371 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:23,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:23,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1189305059, now seen corresponding path program 46 times [2019-08-05 10:25:23,372 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:23,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:23,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 96 conjunts are in the unsatisfiable core [2019-08-05 10:25:23,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:24,621 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:25:24,621 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:25:24,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 10:25:24,621 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 10:25:24,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 10:25:24,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:25:24,622 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2019-08-05 10:25:26,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:26,336 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-08-05 10:25:26,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 10:25:26,342 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2019-08-05 10:25:26,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:26,343 INFO L225 Difference]: With dead ends: 51 [2019-08-05 10:25:26,343 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:25:26,344 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:25:26,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:25:26,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-08-05 10:25:26,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 10:25:26,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-08-05 10:25:26,345 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-08-05 10:25:26,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:26,345 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-08-05 10:25:26,346 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 10:25:26,346 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-08-05 10:25:26,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 10:25:26,346 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:26,346 INFO L399 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2019-08-05 10:25:26,347 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:26,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:26,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1786247028, now seen corresponding path program 47 times [2019-08-05 10:25:26,347 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:26,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:26,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 98 conjunts are in the unsatisfiable core [2019-08-05 10:25:26,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:27,766 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:25:27,766 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:25:27,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 10:25:27,766 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 10:25:27,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 10:25:27,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:25:27,767 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2019-08-05 10:25:29,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:29,576 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-08-05 10:25:29,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 10:25:29,577 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2019-08-05 10:25:29,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:29,577 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:25:29,578 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 10:25:29,578 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:25:29,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 10:25:29,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-05 10:25:29,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:25:29,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-08-05 10:25:29,581 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2019-08-05 10:25:29,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:29,581 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-08-05 10:25:29,581 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 10:25:29,581 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-08-05 10:25:29,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 10:25:29,582 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:29,582 INFO L399 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2019-08-05 10:25:29,582 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:29,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:29,582 INFO L82 PathProgramCache]: Analyzing trace with hash 460918787, now seen corresponding path program 48 times [2019-08-05 10:25:29,583 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:29,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:29,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 100 conjunts are in the unsatisfiable core [2019-08-05 10:25:29,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:30,638 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:25:30,638 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:25:30,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 10:25:30,639 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 10:25:30,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 10:25:30,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:25:30,639 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2019-08-05 10:25:32,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:32,463 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-08-05 10:25:32,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 10:25:32,464 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2019-08-05 10:25:32,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:32,465 INFO L225 Difference]: With dead ends: 53 [2019-08-05 10:25:32,465 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 10:25:32,466 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:25:32,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 10:25:32,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-08-05 10:25:32,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 10:25:32,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-08-05 10:25:32,468 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2019-08-05 10:25:32,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:32,469 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-08-05 10:25:32,469 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 10:25:32,469 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-08-05 10:25:32,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 10:25:32,469 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:32,469 INFO L399 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2019-08-05 10:25:32,469 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:32,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:32,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1403582316, now seen corresponding path program 49 times [2019-08-05 10:25:32,470 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:32,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:32,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 102 conjunts are in the unsatisfiable core [2019-08-05 10:25:32,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:33,820 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:25:33,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:25:33,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 10:25:33,820 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 10:25:33,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 10:25:33,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:25:33,821 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2019-08-05 10:25:35,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:35,686 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-08-05 10:25:35,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 10:25:35,687 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2019-08-05 10:25:35,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:35,688 INFO L225 Difference]: With dead ends: 54 [2019-08-05 10:25:35,688 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:25:35,688 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:25:35,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:25:35,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-08-05 10:25:35,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-05 10:25:35,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-08-05 10:25:35,690 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2019-08-05 10:25:35,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:35,691 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-08-05 10:25:35,691 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 10:25:35,691 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-08-05 10:25:35,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 10:25:35,691 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:35,691 INFO L399 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2019-08-05 10:25:35,692 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:35,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:35,692 INFO L82 PathProgramCache]: Analyzing trace with hash 561380643, now seen corresponding path program 50 times [2019-08-05 10:25:35,693 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:35,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:35,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 104 conjunts are in the unsatisfiable core [2019-08-05 10:25:35,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:36,771 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:25:36,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:25:36,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 10:25:36,772 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 10:25:36,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 10:25:36,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:25:36,773 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2019-08-05 10:25:38,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:38,845 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-08-05 10:25:38,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 10:25:38,846 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2019-08-05 10:25:38,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:38,847 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:25:38,847 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 10:25:38,848 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:25:38,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 10:25:38,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-08-05 10:25:38,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 10:25:38,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-08-05 10:25:38,849 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2019-08-05 10:25:38,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:38,849 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-08-05 10:25:38,850 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 10:25:38,850 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-08-05 10:25:38,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 10:25:38,850 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:38,850 INFO L399 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2019-08-05 10:25:38,850 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:38,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:38,851 INFO L82 PathProgramCache]: Analyzing trace with hash 222932556, now seen corresponding path program 51 times [2019-08-05 10:25:38,851 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:38,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:38,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 106 conjunts are in the unsatisfiable core [2019-08-05 10:25:38,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:39,918 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:25:39,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:25:39,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 10:25:39,918 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 10:25:39,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 10:25:39,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:25:39,919 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2019-08-05 10:25:42,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:42,020 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-08-05 10:25:42,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 10:25:42,021 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2019-08-05 10:25:42,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:42,021 INFO L225 Difference]: With dead ends: 56 [2019-08-05 10:25:42,021 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 10:25:42,022 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:25:42,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 10:25:42,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-08-05 10:25:42,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-05 10:25:42,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-08-05 10:25:42,024 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2019-08-05 10:25:42,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:42,025 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-08-05 10:25:42,025 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 10:25:42,025 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-08-05 10:25:42,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-05 10:25:42,026 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:42,026 INFO L399 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2019-08-05 10:25:42,026 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:42,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:42,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1679023549, now seen corresponding path program 52 times [2019-08-05 10:25:42,027 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:42,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:42,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 108 conjunts are in the unsatisfiable core [2019-08-05 10:25:42,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:43,572 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:25:43,572 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:25:43,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 10:25:43,572 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 10:25:43,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 10:25:43,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:25:43,573 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2019-08-05 10:25:45,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:45,620 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-08-05 10:25:45,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 10:25:45,621 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2019-08-05 10:25:45,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:45,622 INFO L225 Difference]: With dead ends: 57 [2019-08-05 10:25:45,622 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 10:25:45,623 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:25:45,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 10:25:45,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-08-05 10:25:45,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 10:25:45,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-08-05 10:25:45,626 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2019-08-05 10:25:45,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:45,626 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-08-05 10:25:45,626 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 10:25:45,626 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-08-05 10:25:45,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-05 10:25:45,627 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:45,627 INFO L399 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2019-08-05 10:25:45,627 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:45,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:45,627 INFO L82 PathProgramCache]: Analyzing trace with hash -510120660, now seen corresponding path program 53 times [2019-08-05 10:25:45,628 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:45,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:45,657 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 110 conjunts are in the unsatisfiable core [2019-08-05 10:25:45,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:46,826 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:25:46,826 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:25:46,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 10:25:46,827 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 10:25:46,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 10:25:46,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:25:46,827 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2019-08-05 10:25:49,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:49,084 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-08-05 10:25:49,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 10:25:49,085 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2019-08-05 10:25:49,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:49,086 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:25:49,086 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 10:25:49,087 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:25:49,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 10:25:49,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-08-05 10:25:49,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-05 10:25:49,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-08-05 10:25:49,089 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2019-08-05 10:25:49,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:49,089 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-08-05 10:25:49,089 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 10:25:49,089 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-08-05 10:25:49,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-05 10:25:49,090 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:49,090 INFO L399 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2019-08-05 10:25:49,090 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:49,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:49,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1366130531, now seen corresponding path program 54 times [2019-08-05 10:25:49,091 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:49,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:49,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 112 conjunts are in the unsatisfiable core [2019-08-05 10:25:49,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:50,275 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:25:50,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:25:50,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 10:25:50,276 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 10:25:50,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 10:25:50,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:25:50,276 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2019-08-05 10:25:52,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:52,513 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-08-05 10:25:52,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 10:25:52,513 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2019-08-05 10:25:52,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:52,514 INFO L225 Difference]: With dead ends: 59 [2019-08-05 10:25:52,514 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 10:25:52,515 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:25:52,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 10:25:52,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-08-05 10:25:52,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 10:25:52,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-08-05 10:25:52,517 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2019-08-05 10:25:52,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:52,517 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-08-05 10:25:52,517 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 10:25:52,517 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-08-05 10:25:52,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 10:25:52,518 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:52,518 INFO L399 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2019-08-05 10:25:52,518 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:52,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:52,518 INFO L82 PathProgramCache]: Analyzing trace with hash -599624692, now seen corresponding path program 55 times [2019-08-05 10:25:52,519 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:52,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:52,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 114 conjunts are in the unsatisfiable core [2019-08-05 10:25:52,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:54,094 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:25:54,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:25:54,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 10:25:54,095 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 10:25:54,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 10:25:54,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:25:54,095 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2019-08-05 10:25:56,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:56,394 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-08-05 10:25:56,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 10:25:56,394 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2019-08-05 10:25:56,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:56,395 INFO L225 Difference]: With dead ends: 60 [2019-08-05 10:25:56,396 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:25:56,396 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:25:56,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:25:56,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-08-05 10:25:56,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-05 10:25:56,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-08-05 10:25:56,399 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2019-08-05 10:25:56,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:56,399 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-08-05 10:25:56,399 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 10:25:56,399 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-08-05 10:25:56,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-05 10:25:56,400 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:56,400 INFO L399 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2019-08-05 10:25:56,400 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:56,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:56,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1408494461, now seen corresponding path program 56 times [2019-08-05 10:25:56,401 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:56,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:56,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 116 conjunts are in the unsatisfiable core [2019-08-05 10:25:56,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:57,699 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:25:57,699 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:25:57,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 10:25:57,699 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 10:25:57,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 10:25:57,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:25:57,700 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2019-08-05 10:26:00,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:00,289 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-08-05 10:26:00,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 10:26:00,290 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2019-08-05 10:26:00,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:00,291 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:26:00,291 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 10:26:00,292 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:26:00,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 10:26:00,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-08-05 10:26:00,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 10:26:00,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-08-05 10:26:00,294 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2019-08-05 10:26:00,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:00,294 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-08-05 10:26:00,294 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 10:26:00,294 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-08-05 10:26:00,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 10:26:00,295 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:00,295 INFO L399 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2019-08-05 10:26:00,295 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:00,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:00,296 INFO L82 PathProgramCache]: Analyzing trace with hash -713653524, now seen corresponding path program 57 times [2019-08-05 10:26:00,296 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:00,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:00,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 118 conjunts are in the unsatisfiable core [2019-08-05 10:26:00,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:01,706 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:26:01,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:01,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 10:26:01,707 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 10:26:01,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 10:26:01,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:26:01,707 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2019-08-05 10:26:04,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:04,562 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-08-05 10:26:04,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 10:26:04,563 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2019-08-05 10:26:04,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:04,563 INFO L225 Difference]: With dead ends: 62 [2019-08-05 10:26:04,563 INFO L226 Difference]: Without dead ends: 62 [2019-08-05 10:26:04,564 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:26:04,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-05 10:26:04,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-08-05 10:26:04,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-05 10:26:04,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-08-05 10:26:04,566 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2019-08-05 10:26:04,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:04,567 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-08-05 10:26:04,567 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 10:26:04,567 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-08-05 10:26:04,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 10:26:04,567 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:04,567 INFO L399 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2019-08-05 10:26:04,568 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:04,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:04,568 INFO L82 PathProgramCache]: Analyzing trace with hash -648420957, now seen corresponding path program 58 times [2019-08-05 10:26:04,569 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:04,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:04,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 120 conjunts are in the unsatisfiable core [2019-08-05 10:26:04,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:06,220 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:26:06,220 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:06,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-05 10:26:06,221 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-05 10:26:06,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-05 10:26:06,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:26:06,221 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2019-08-05 10:26:09,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:09,058 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-08-05 10:26:09,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 10:26:09,059 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2019-08-05 10:26:09,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:09,060 INFO L225 Difference]: With dead ends: 63 [2019-08-05 10:26:09,060 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:26:09,060 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:26:09,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:26:09,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-08-05 10:26:09,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 10:26:09,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-08-05 10:26:09,063 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2019-08-05 10:26:09,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:09,063 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-08-05 10:26:09,064 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-05 10:26:09,064 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-08-05 10:26:09,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-05 10:26:09,064 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:09,064 INFO L399 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2019-08-05 10:26:09,064 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:09,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:09,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1373788620, now seen corresponding path program 59 times [2019-08-05 10:26:09,065 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:09,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:09,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 122 conjunts are in the unsatisfiable core [2019-08-05 10:26:09,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:10,490 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:26:10,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:10,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-05 10:26:10,491 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-05 10:26:10,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-05 10:26:10,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:26:10,491 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2019-08-05 10:26:13,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:13,263 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-08-05 10:26:13,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 10:26:13,264 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2019-08-05 10:26:13,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:13,265 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:26:13,265 INFO L226 Difference]: Without dead ends: 64 [2019-08-05 10:26:13,265 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:26:13,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-05 10:26:13,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-08-05 10:26:13,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-05 10:26:13,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-08-05 10:26:13,267 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2019-08-05 10:26:13,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:13,267 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-08-05 10:26:13,267 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-05 10:26:13,268 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-08-05 10:26:13,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-05 10:26:13,268 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:13,268 INFO L399 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2019-08-05 10:26:13,268 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:13,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:13,268 INFO L82 PathProgramCache]: Analyzing trace with hash -362223933, now seen corresponding path program 60 times [2019-08-05 10:26:13,269 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:13,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:13,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 124 conjunts are in the unsatisfiable core [2019-08-05 10:26:13,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:15,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:26:15,069 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:15,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-05 10:26:15,070 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-05 10:26:15,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-05 10:26:15,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:26:15,070 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2019-08-05 10:26:17,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:17,923 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-08-05 10:26:17,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 10:26:17,924 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2019-08-05 10:26:17,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:17,925 INFO L225 Difference]: With dead ends: 65 [2019-08-05 10:26:17,925 INFO L226 Difference]: Without dead ends: 65 [2019-08-05 10:26:17,925 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:26:17,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-05 10:26:17,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-08-05 10:26:17,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 10:26:17,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-08-05 10:26:17,928 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2019-08-05 10:26:17,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:17,928 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-08-05 10:26:17,928 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-05 10:26:17,928 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-08-05 10:26:17,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-05 10:26:17,928 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:17,929 INFO L399 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2019-08-05 10:26:17,929 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:17,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:17,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1655961772, now seen corresponding path program 61 times [2019-08-05 10:26:17,930 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:17,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:17,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 126 conjunts are in the unsatisfiable core [2019-08-05 10:26:17,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:19,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:26:19,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:19,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-05 10:26:19,651 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-05 10:26:19,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-05 10:26:19,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:26:19,652 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2019-08-05 10:26:22,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:22,948 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-08-05 10:26:22,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-05 10:26:22,949 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2019-08-05 10:26:22,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:22,949 INFO L225 Difference]: With dead ends: 66 [2019-08-05 10:26:22,950 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:26:22,950 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:26:22,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:26:22,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-08-05 10:26:22,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-05 10:26:22,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-08-05 10:26:22,952 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2019-08-05 10:26:22,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:22,952 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-08-05 10:26:22,952 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-05 10:26:22,953 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-08-05 10:26:22,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-08-05 10:26:22,953 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:22,953 INFO L399 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2019-08-05 10:26:22,954 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:22,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:22,954 INFO L82 PathProgramCache]: Analyzing trace with hash -204790813, now seen corresponding path program 62 times [2019-08-05 10:26:22,954 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:22,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:22,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 128 conjunts are in the unsatisfiable core [2019-08-05 10:26:22,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:24,655 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:26:24,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:24,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-05 10:26:24,656 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-05 10:26:24,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-05 10:26:24,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:26:24,657 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2019-08-05 10:26:27,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:27,629 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-08-05 10:26:27,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-05 10:26:27,629 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2019-08-05 10:26:27,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:27,630 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:26:27,630 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 10:26:27,631 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:26:27,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 10:26:27,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-08-05 10:26:27,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 10:26:27,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-08-05 10:26:27,634 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2019-08-05 10:26:27,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:27,634 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-08-05 10:26:27,634 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-05 10:26:27,634 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-08-05 10:26:27,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-05 10:26:27,635 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:27,635 INFO L399 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2019-08-05 10:26:27,635 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:27,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:27,635 INFO L82 PathProgramCache]: Analyzing trace with hash -2053546100, now seen corresponding path program 63 times [2019-08-05 10:26:27,636 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:27,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:27,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 130 conjunts are in the unsatisfiable core [2019-08-05 10:26:27,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:29,533 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:26:29,534 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:29,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-05 10:26:29,534 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-05 10:26:29,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-05 10:26:29,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:26:29,535 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2019-08-05 10:26:32,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:32,599 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-08-05 10:26:32,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 10:26:32,600 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2019-08-05 10:26:32,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:32,601 INFO L225 Difference]: With dead ends: 68 [2019-08-05 10:26:32,601 INFO L226 Difference]: Without dead ends: 68 [2019-08-05 10:26:32,602 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:26:32,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-05 10:26:32,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-08-05 10:26:32,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-05 10:26:32,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-08-05 10:26:32,604 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2019-08-05 10:26:32,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:32,605 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-08-05 10:26:32,605 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-05 10:26:32,605 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-08-05 10:26:32,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-05 10:26:32,605 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:32,606 INFO L399 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2019-08-05 10:26:32,606 INFO L418 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:32,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:32,606 INFO L82 PathProgramCache]: Analyzing trace with hash 764582147, now seen corresponding path program 64 times [2019-08-05 10:26:32,607 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:32,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:32,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 132 conjunts are in the unsatisfiable core [2019-08-05 10:26:32,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:34,277 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:26:34,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:34,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-05 10:26:34,278 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-05 10:26:34,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-05 10:26:34,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:26:34,279 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2019-08-05 10:26:37,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:37,586 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-08-05 10:26:37,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 10:26:37,587 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2019-08-05 10:26:37,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:37,587 INFO L225 Difference]: With dead ends: 69 [2019-08-05 10:26:37,588 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:26:37,588 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:26:37,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:26:37,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-08-05 10:26:37,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 10:26:37,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-08-05 10:26:37,590 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2019-08-05 10:26:37,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:37,591 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-08-05 10:26:37,591 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-05 10:26:37,591 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-08-05 10:26:37,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 10:26:37,591 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:37,591 INFO L399 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2019-08-05 10:26:37,592 INFO L418 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:37,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:37,592 INFO L82 PathProgramCache]: Analyzing trace with hash -2067755412, now seen corresponding path program 65 times [2019-08-05 10:26:37,592 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:37,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:37,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 134 conjunts are in the unsatisfiable core [2019-08-05 10:26:37,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:39,279 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:26:39,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:39,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-05 10:26:39,280 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-05 10:26:39,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-05 10:26:39,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:26:39,281 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2019-08-05 10:26:42,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:42,703 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-08-05 10:26:42,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-05 10:26:42,703 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2019-08-05 10:26:42,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:42,704 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:26:42,704 INFO L226 Difference]: Without dead ends: 70 [2019-08-05 10:26:42,705 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:26:42,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-05 10:26:42,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-08-05 10:26:42,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-05 10:26:42,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-08-05 10:26:42,707 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2019-08-05 10:26:42,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:42,708 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-08-05 10:26:42,708 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-05 10:26:42,708 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-08-05 10:26:42,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 10:26:42,708 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:42,709 INFO L399 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2019-08-05 10:26:42,709 INFO L418 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:42,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:42,709 INFO L82 PathProgramCache]: Analyzing trace with hash 324093475, now seen corresponding path program 66 times [2019-08-05 10:26:42,710 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:42,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:42,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 136 conjunts are in the unsatisfiable core [2019-08-05 10:26:42,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:44,422 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:26:44,422 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:44,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-05 10:26:44,423 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-05 10:26:44,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-05 10:26:44,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:26:44,424 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2019-08-05 10:26:47,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:47,936 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-08-05 10:26:47,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-05 10:26:47,937 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2019-08-05 10:26:47,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:47,938 INFO L225 Difference]: With dead ends: 71 [2019-08-05 10:26:47,938 INFO L226 Difference]: Without dead ends: 71 [2019-08-05 10:26:47,938 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:26:47,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-05 10:26:47,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-08-05 10:26:47,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 10:26:47,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-08-05 10:26:47,940 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2019-08-05 10:26:47,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:47,941 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-08-05 10:26:47,941 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-05 10:26:47,941 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-08-05 10:26:47,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 10:26:47,941 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:47,941 INFO L399 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2019-08-05 10:26:47,941 INFO L418 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:47,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:47,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1456964940, now seen corresponding path program 67 times [2019-08-05 10:26:47,942 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:47,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:47,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 138 conjunts are in the unsatisfiable core [2019-08-05 10:26:47,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:49,929 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:26:49,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:49,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-05 10:26:49,930 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-05 10:26:49,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-05 10:26:49,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:26:49,931 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2019-08-05 10:26:53,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:53,338 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-08-05 10:26:53,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-05 10:26:53,338 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2019-08-05 10:26:53,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:53,339 INFO L225 Difference]: With dead ends: 72 [2019-08-05 10:26:53,339 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 10:26:53,340 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:26:53,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 10:26:53,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-08-05 10:26:53,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-08-05 10:26:53,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-08-05 10:26:53,342 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2019-08-05 10:26:53,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:53,342 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-08-05 10:26:53,342 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-05 10:26:53,342 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-08-05 10:26:53,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-05 10:26:53,343 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:53,343 INFO L399 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2019-08-05 10:26:53,343 INFO L418 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:53,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:53,343 INFO L82 PathProgramCache]: Analyzing trace with hash -2078725309, now seen corresponding path program 68 times [2019-08-05 10:26:53,344 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:53,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:53,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 140 conjunts are in the unsatisfiable core [2019-08-05 10:26:53,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:55,499 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:26:55,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:55,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-05 10:26:55,500 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-05 10:26:55,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-05 10:26:55,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:26:55,501 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2019-08-05 10:26:59,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:59,031 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-08-05 10:26:59,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-05 10:26:59,032 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2019-08-05 10:26:59,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:59,033 INFO L225 Difference]: With dead ends: 73 [2019-08-05 10:26:59,033 INFO L226 Difference]: Without dead ends: 73 [2019-08-05 10:26:59,033 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:26:59,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-05 10:26:59,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-08-05 10:26:59,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 10:26:59,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-08-05 10:26:59,035 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2019-08-05 10:26:59,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:59,036 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-08-05 10:26:59,036 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-05 10:26:59,036 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-08-05 10:26:59,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-05 10:26:59,036 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:59,037 INFO L399 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2019-08-05 10:26:59,037 INFO L418 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:59,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:59,037 INFO L82 PathProgramCache]: Analyzing trace with hash -15973332, now seen corresponding path program 69 times [2019-08-05 10:26:59,038 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:59,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:59,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 142 conjunts are in the unsatisfiable core [2019-08-05 10:26:59,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:01,265 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:27:01,265 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:01,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-05 10:27:01,266 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-05 10:27:01,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-05 10:27:01,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:27:01,266 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2019-08-05 10:27:04,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:04,881 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-08-05 10:27:04,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-05 10:27:04,882 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2019-08-05 10:27:04,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:04,883 INFO L225 Difference]: With dead ends: 74 [2019-08-05 10:27:04,883 INFO L226 Difference]: Without dead ends: 74 [2019-08-05 10:27:04,884 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:27:04,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-05 10:27:04,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-08-05 10:27:04,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-05 10:27:04,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-08-05 10:27:04,886 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2019-08-05 10:27:04,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:04,886 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-08-05 10:27:04,886 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-05 10:27:04,887 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-08-05 10:27:04,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-08-05 10:27:04,887 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:04,887 INFO L399 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2019-08-05 10:27:04,888 INFO L418 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:04,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:04,888 INFO L82 PathProgramCache]: Analyzing trace with hash -495171485, now seen corresponding path program 70 times [2019-08-05 10:27:04,888 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:04,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:04,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 144 conjunts are in the unsatisfiable core [2019-08-05 10:27:04,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:07,160 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:27:07,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:07,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-05 10:27:07,161 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-08-05 10:27:07,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-08-05 10:27:07,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:27:07,162 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2019-08-05 10:27:10,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:10,942 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-08-05 10:27:10,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-05 10:27:10,942 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2019-08-05 10:27:10,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:10,943 INFO L225 Difference]: With dead ends: 75 [2019-08-05 10:27:10,944 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 10:27:10,944 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:27:10,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 10:27:10,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-08-05 10:27:10,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 10:27:10,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-08-05 10:27:10,947 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2019-08-05 10:27:10,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:10,947 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-08-05 10:27:10,947 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-08-05 10:27:10,947 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-08-05 10:27:10,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-05 10:27:10,948 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:10,948 INFO L399 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2019-08-05 10:27:10,948 INFO L418 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:10,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:10,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1829554956, now seen corresponding path program 71 times [2019-08-05 10:27:10,949 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:10,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:11,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 146 conjunts are in the unsatisfiable core [2019-08-05 10:27:11,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:13,350 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:27:13,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:13,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-05 10:27:13,351 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-05 10:27:13,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-05 10:27:13,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:27:13,352 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2019-08-05 10:27:17,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:17,308 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-08-05 10:27:17,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-05 10:27:17,308 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2019-08-05 10:27:17,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:17,309 INFO L225 Difference]: With dead ends: 76 [2019-08-05 10:27:17,309 INFO L226 Difference]: Without dead ends: 76 [2019-08-05 10:27:17,310 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:27:17,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-05 10:27:17,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-08-05 10:27:17,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-05 10:27:17,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-08-05 10:27:17,312 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2019-08-05 10:27:17,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:17,312 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-08-05 10:27:17,313 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-05 10:27:17,313 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-08-05 10:27:17,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-05 10:27:17,313 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:17,313 INFO L399 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2019-08-05 10:27:17,314 INFO L418 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:17,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:17,314 INFO L82 PathProgramCache]: Analyzing trace with hash 881630595, now seen corresponding path program 72 times [2019-08-05 10:27:17,314 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:17,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:17,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 148 conjunts are in the unsatisfiable core [2019-08-05 10:27:17,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:19,598 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:27:19,598 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:19,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-05 10:27:19,598 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-05 10:27:19,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-05 10:27:19,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:27:19,599 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2019-08-05 10:27:23,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:23,625 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-08-05 10:27:23,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-05 10:27:23,625 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2019-08-05 10:27:23,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:23,626 INFO L225 Difference]: With dead ends: 77 [2019-08-05 10:27:23,626 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 10:27:23,627 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:27:23,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 10:27:23,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-08-05 10:27:23,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 10:27:23,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-08-05 10:27:23,629 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2019-08-05 10:27:23,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:23,630 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-08-05 10:27:23,630 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-05 10:27:23,630 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-08-05 10:27:23,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-05 10:27:23,630 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:23,630 INFO L399 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2019-08-05 10:27:23,630 INFO L418 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:23,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:23,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1560746476, now seen corresponding path program 73 times [2019-08-05 10:27:23,631 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:23,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:23,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 150 conjunts are in the unsatisfiable core [2019-08-05 10:27:23,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:26,043 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:27:26,043 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:26,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-05 10:27:26,044 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-05 10:27:26,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-05 10:27:26,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:27:26,044 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2019-08-05 10:27:30,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:30,048 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-08-05 10:27:30,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-05 10:27:30,048 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2019-08-05 10:27:30,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:30,049 INFO L225 Difference]: With dead ends: 78 [2019-08-05 10:27:30,049 INFO L226 Difference]: Without dead ends: 78 [2019-08-05 10:27:30,050 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:27:30,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-05 10:27:30,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-08-05 10:27:30,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-08-05 10:27:30,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-08-05 10:27:30,052 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2019-08-05 10:27:30,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:30,052 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-08-05 10:27:30,052 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-05 10:27:30,052 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-08-05 10:27:30,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 10:27:30,053 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:30,053 INFO L399 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2019-08-05 10:27:30,053 INFO L418 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:30,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:30,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1138502307, now seen corresponding path program 74 times [2019-08-05 10:27:30,054 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:30,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:30,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 152 conjunts are in the unsatisfiable core [2019-08-05 10:27:30,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:32,443 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:27:32,443 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:32,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-08-05 10:27:32,444 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-08-05 10:27:32,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-08-05 10:27:32,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:27:32,444 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2019-08-05 10:27:36,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:36,759 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-08-05 10:27:36,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-05 10:27:36,759 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2019-08-05 10:27:36,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:36,760 INFO L225 Difference]: With dead ends: 79 [2019-08-05 10:27:36,760 INFO L226 Difference]: Without dead ends: 79 [2019-08-05 10:27:36,761 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:27:36,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-05 10:27:36,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-08-05 10:27:36,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 10:27:36,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-08-05 10:27:36,763 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2019-08-05 10:27:36,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:36,763 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-08-05 10:27:36,764 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-08-05 10:27:36,764 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-08-05 10:27:36,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-05 10:27:36,764 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:36,764 INFO L399 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2019-08-05 10:27:36,765 INFO L418 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:36,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:36,765 INFO L82 PathProgramCache]: Analyzing trace with hash 933834956, now seen corresponding path program 75 times [2019-08-05 10:27:36,765 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:36,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:36,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 154 conjunts are in the unsatisfiable core [2019-08-05 10:27:36,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:39,002 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:27:39,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:39,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-05 10:27:39,002 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-05 10:27:39,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-05 10:27:39,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:27:39,003 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2019-08-05 10:27:43,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:43,456 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-08-05 10:27:43,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-05 10:27:43,457 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2019-08-05 10:27:43,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:43,458 INFO L225 Difference]: With dead ends: 80 [2019-08-05 10:27:43,458 INFO L226 Difference]: Without dead ends: 80 [2019-08-05 10:27:43,458 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:27:43,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-05 10:27:43,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-08-05 10:27:43,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-08-05 10:27:43,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-08-05 10:27:43,461 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2019-08-05 10:27:43,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:43,461 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-08-05 10:27:43,461 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-05 10:27:43,461 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-08-05 10:27:43,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-08-05 10:27:43,462 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:43,462 INFO L399 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2019-08-05 10:27:43,462 INFO L418 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:43,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:43,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1115885629, now seen corresponding path program 76 times [2019-08-05 10:27:43,463 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:43,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:43,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 156 conjunts are in the unsatisfiable core [2019-08-05 10:27:43,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:46,771 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:27:46,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:46,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-08-05 10:27:46,771 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-08-05 10:27:46,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-08-05 10:27:46,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:27:46,772 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2019-08-05 10:27:51,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:51,175 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-08-05 10:27:51,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-08-05 10:27:51,175 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2019-08-05 10:27:51,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:51,176 INFO L225 Difference]: With dead ends: 81 [2019-08-05 10:27:51,176 INFO L226 Difference]: Without dead ends: 81 [2019-08-05 10:27:51,177 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:27:51,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-08-05 10:27:51,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-08-05 10:27:51,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 10:27:51,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-08-05 10:27:51,179 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2019-08-05 10:27:51,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:51,179 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-08-05 10:27:51,180 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-08-05 10:27:51,180 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-08-05 10:27:51,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-08-05 10:27:51,180 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:51,180 INFO L399 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2019-08-05 10:27:51,180 INFO L418 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:51,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:51,180 INFO L82 PathProgramCache]: Analyzing trace with hash -232714324, now seen corresponding path program 77 times [2019-08-05 10:27:51,181 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:51,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:51,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 158 conjunts are in the unsatisfiable core [2019-08-05 10:27:51,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:53,620 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:27:53,620 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:53,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-08-05 10:27:53,620 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-08-05 10:27:53,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-08-05 10:27:53,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:27:53,621 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. [2019-08-05 10:27:58,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:58,741 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-08-05 10:27:58,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-08-05 10:27:58,741 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2019-08-05 10:27:58,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:58,742 INFO L225 Difference]: With dead ends: 82 [2019-08-05 10:27:58,742 INFO L226 Difference]: Without dead ends: 82 [2019-08-05 10:27:58,743 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:27:58,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-05 10:27:58,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-08-05 10:27:58,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-08-05 10:27:58,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-08-05 10:27:58,746 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2019-08-05 10:27:58,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:58,746 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-08-05 10:27:58,746 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-08-05 10:27:58,746 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-08-05 10:27:58,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-08-05 10:27:58,747 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:58,747 INFO L399 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2019-08-05 10:27:58,747 INFO L418 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:58,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:58,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1375792355, now seen corresponding path program 78 times [2019-08-05 10:27:58,748 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:58,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:58,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 160 conjunts are in the unsatisfiable core [2019-08-05 10:27:58,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:28:01,141 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:28:01,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:28:01,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2019-08-05 10:28:01,142 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-08-05 10:28:01,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-08-05 10:28:01,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:28:01,142 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 81 states. [2019-08-05 10:28:05,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:28:05,883 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-08-05 10:28:05,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-08-05 10:28:05,884 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 81 [2019-08-05 10:28:05,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:28:05,885 INFO L225 Difference]: With dead ends: 83 [2019-08-05 10:28:05,885 INFO L226 Difference]: Without dead ends: 83 [2019-08-05 10:28:05,885 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:28:05,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-08-05 10:28:05,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-08-05 10:28:05,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-05 10:28:05,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-08-05 10:28:05,888 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2019-08-05 10:28:05,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:28:05,888 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2019-08-05 10:28:05,888 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-08-05 10:28:05,888 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-08-05 10:28:05,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-08-05 10:28:05,889 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:28:05,889 INFO L399 BasicCegarLoop]: trace histogram [79, 1, 1, 1] [2019-08-05 10:28:05,889 INFO L418 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:28:05,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:28:05,889 INFO L82 PathProgramCache]: Analyzing trace with hash -300108148, now seen corresponding path program 79 times [2019-08-05 10:28:05,890 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:28:05,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:28:05,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 162 conjunts are in the unsatisfiable core [2019-08-05 10:28:05,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:28:08,802 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:28:08,802 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:28:08,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2019-08-05 10:28:08,803 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-08-05 10:28:08,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-08-05 10:28:08,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 10:28:08,803 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 82 states. [2019-08-05 10:28:13,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:28:13,715 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-08-05 10:28:13,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-08-05 10:28:13,716 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 82 [2019-08-05 10:28:13,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:28:13,717 INFO L225 Difference]: With dead ends: 84 [2019-08-05 10:28:13,717 INFO L226 Difference]: Without dead ends: 84 [2019-08-05 10:28:13,718 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 10:28:13,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-08-05 10:28:13,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-08-05 10:28:13,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-08-05 10:28:13,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2019-08-05 10:28:13,720 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2019-08-05 10:28:13,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:28:13,720 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2019-08-05 10:28:13,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-08-05 10:28:13,720 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-08-05 10:28:13,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-08-05 10:28:13,721 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:28:13,721 INFO L399 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2019-08-05 10:28:13,721 INFO L418 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:28:13,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:28:13,721 INFO L82 PathProgramCache]: Analyzing trace with hash -713416189, now seen corresponding path program 80 times [2019-08-05 10:28:13,722 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:28:13,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:28:13,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 164 conjunts are in the unsatisfiable core [2019-08-05 10:28:13,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:28:17,276 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:28:17,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:28:17,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2019-08-05 10:28:17,277 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-08-05 10:28:17,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-08-05 10:28:17,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:28:17,277 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 83 states. [2019-08-05 10:28:22,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:28:22,238 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-08-05 10:28:22,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-08-05 10:28:22,239 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2019-08-05 10:28:22,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:28:22,239 INFO L225 Difference]: With dead ends: 85 [2019-08-05 10:28:22,239 INFO L226 Difference]: Without dead ends: 85 [2019-08-05 10:28:22,240 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:28:22,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-08-05 10:28:22,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-08-05 10:28:22,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-05 10:28:22,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-08-05 10:28:22,242 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2019-08-05 10:28:22,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:28:22,242 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-08-05 10:28:22,242 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-08-05 10:28:22,242 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-08-05 10:28:22,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-08-05 10:28:22,243 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:28:22,243 INFO L399 BasicCegarLoop]: trace histogram [81, 1, 1, 1] [2019-08-05 10:28:22,243 INFO L418 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:28:22,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:28:22,243 INFO L82 PathProgramCache]: Analyzing trace with hash -641063572, now seen corresponding path program 81 times [2019-08-05 10:28:22,244 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:28:22,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:28:22,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 166 conjunts are in the unsatisfiable core [2019-08-05 10:28:22,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:28:24,885 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:28:24,885 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:28:24,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2019-08-05 10:28:24,886 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-08-05 10:28:24,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-08-05 10:28:24,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=6807, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 10:28:24,886 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 84 states. [2019-08-05 10:28:29,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:28:29,981 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-08-05 10:28:29,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-08-05 10:28:29,981 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 84 [2019-08-05 10:28:29,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:28:29,982 INFO L225 Difference]: With dead ends: 86 [2019-08-05 10:28:29,982 INFO L226 Difference]: Without dead ends: 86 [2019-08-05 10:28:29,983 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=165, Invalid=6807, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 10:28:29,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-08-05 10:28:29,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-08-05 10:28:29,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-08-05 10:28:29,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-08-05 10:28:29,985 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2019-08-05 10:28:29,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:28:29,986 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-08-05 10:28:29,986 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-08-05 10:28:29,986 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-08-05 10:28:29,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 10:28:29,987 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:28:29,987 INFO L399 BasicCegarLoop]: trace histogram [82, 1, 1, 1] [2019-08-05 10:28:29,987 INFO L418 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:28:29,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:28:29,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1601867555, now seen corresponding path program 82 times [2019-08-05 10:28:29,988 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:28:30,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:28:30,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 168 conjunts are in the unsatisfiable core [2019-08-05 10:28:30,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:28:33,343 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:28:33,343 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:28:33,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2019-08-05 10:28:33,344 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-08-05 10:28:33,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-08-05 10:28:33,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=6973, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 10:28:33,344 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 85 states. Received shutdown request... [2019-08-05 10:28:35,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 10:28:35,641 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 10:28:35,648 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 10:28:35,648 INFO L202 PluginConnector]: Adding new model phases1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:28:35 BoogieIcfgContainer [2019-08-05 10:28:35,648 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:28:35,650 INFO L168 Benchmark]: Toolchain (without parser) took 248560.33 ms. Allocated memory was 141.0 MB in the beginning and 191.9 MB in the end (delta: 50.9 MB). Free memory was 110.6 MB in the beginning and 128.0 MB in the end (delta: -17.4 MB). Peak memory consumption was 33.5 MB. Max. memory is 7.1 GB. [2019-08-05 10:28:35,651 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 141.0 MB. Free memory was 111.8 MB in the beginning and 111.6 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-08-05 10:28:35,652 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.66 ms. Allocated memory is still 141.0 MB. Free memory was 110.4 MB in the beginning and 108.8 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. [2019-08-05 10:28:35,652 INFO L168 Benchmark]: Boogie Preprocessor took 23.88 ms. Allocated memory is still 141.0 MB. Free memory was 108.8 MB in the beginning and 107.7 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:28:35,653 INFO L168 Benchmark]: RCFGBuilder took 308.11 ms. Allocated memory is still 141.0 MB. Free memory was 107.7 MB in the beginning and 98.3 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. [2019-08-05 10:28:35,654 INFO L168 Benchmark]: TraceAbstraction took 248180.02 ms. Allocated memory was 141.0 MB in the beginning and 191.9 MB in the end (delta: 50.9 MB). Free memory was 98.1 MB in the beginning and 128.0 MB in the end (delta: -29.8 MB). Peak memory consumption was 21.0 MB. Max. memory is 7.1 GB. [2019-08-05 10:28:35,657 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.22 ms. Allocated memory is still 141.0 MB. Free memory was 111.8 MB in the beginning and 111.6 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 42.66 ms. Allocated memory is still 141.0 MB. Free memory was 110.4 MB in the beginning and 108.8 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.88 ms. Allocated memory is still 141.0 MB. Free memory was 108.8 MB in the beginning and 107.7 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 308.11 ms. Allocated memory is still 141.0 MB. Free memory was 107.7 MB in the beginning and 98.3 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 248180.02 ms. Allocated memory was 141.0 MB in the beginning and 191.9 MB in the end (delta: 50.9 MB). Free memory was 98.1 MB in the beginning and 128.0 MB in the end (delta: -29.8 MB). Peak memory consumption was 21.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 34]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 34). Cancelled while BasicCegarLoop was constructing difference of abstraction (86states) and FLOYD_HOARE automaton (currently 40 states, 85 states before enhancement),while ReachableStatesComputation was computing reachable states (38 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. TIMEOUT Result, 248.1s OverallTime, 83 OverallIterations, 82 TraceHistogramMax, 150.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 247 SDtfs, 0 SDslu, 3403 SDs, 0 SdLazy, 197124 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 123.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3569 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 3486 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 94.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=86occurred in iteration=82, 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, 82 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 95.5s InterpolantComputationTime, 3652 NumberOfCodeBlocks, 3652 NumberOfCodeBlocksAsserted, 83 NumberOfCheckSat, 3569 ConstructedInterpolants, 0 QuantifiedInterpolants, 596189 SizeOfPredicates, 166 NumberOfNonLiveVariables, 14608 ConjunctsInSsa, 7138 ConjunctsInUnsatCore, 83 InterpolantComputations, 1 PerfectInterpolantSequences, 0/95284 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown