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/simple1.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-04 21:38:29,038 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-04 21:38:29,040 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-04 21:38:29,055 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-04 21:38:29,055 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-04 21:38:29,056 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-04 21:38:29,058 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-04 21:38:29,061 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-04 21:38:29,063 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-04 21:38:29,065 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-04 21:38:29,066 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-04 21:38:29,068 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-04 21:38:29,068 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-04 21:38:29,069 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-04 21:38:29,072 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-04 21:38:29,074 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-04 21:38:29,074 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-04 21:38:29,080 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-04 21:38:29,084 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-04 21:38:29,087 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-04 21:38:29,091 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-04 21:38:29,092 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-04 21:38:29,093 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-04 21:38:29,095 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-04 21:38:29,098 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-04 21:38:29,098 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-04 21:38:29,099 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-04 21:38:29,100 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-04 21:38:29,101 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-04 21:38:29,102 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-04 21:38:29,102 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-04 21:38:29,103 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-04 21:38:29,104 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-04 21:38:29,104 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-04 21:38:29,105 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-04 21:38:29,106 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-04 21:38:29,106 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-04 21:38:29,106 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-04 21:38:29,107 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-04 21:38:29,107 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-04 21:38:29,108 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-04 21:38:29,151 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-04 21:38:29,167 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-04 21:38:29,173 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-04 21:38:29,174 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-04 21:38:29,175 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-04 21:38:29,176 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/simple1.i_3.bpl [2019-08-04 21:38:29,176 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/simple1.i_3.bpl' [2019-08-04 21:38:29,221 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-04 21:38:29,223 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-04 21:38:29,224 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-04 21:38:29,224 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-04 21:38:29,224 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-04 21:38:29,241 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "simple1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:29" (1/1) ... [2019-08-04 21:38:29,251 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "simple1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:29" (1/1) ... [2019-08-04 21:38:29,257 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-04 21:38:29,258 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-04 21:38:29,258 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-04 21:38:29,258 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-04 21:38:29,269 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "simple1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:29" (1/1) ... [2019-08-04 21:38:29,270 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "simple1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:29" (1/1) ... [2019-08-04 21:38:29,271 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "simple1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:29" (1/1) ... [2019-08-04 21:38:29,271 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "simple1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:29" (1/1) ... [2019-08-04 21:38:29,274 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "simple1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:29" (1/1) ... [2019-08-04 21:38:29,276 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "simple1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:29" (1/1) ... [2019-08-04 21:38:29,277 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "simple1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:29" (1/1) ... [2019-08-04 21:38:29,278 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-04 21:38:29,279 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-04 21:38:29,279 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-04 21:38:29,279 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-04 21:38:29,280 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "simple1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:29" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-04 21:38:29,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-04 21:38:29,347 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-04 21:38:29,611 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-04 21:38:29,611 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-08-04 21:38:29,613 INFO L202 PluginConnector]: Adding new model simple1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 09:38:29 BoogieIcfgContainer [2019-08-04 21:38:29,613 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-04 21:38:29,614 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-04 21:38:29,615 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-04 21:38:29,618 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-04 21:38:29,619 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "simple1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:29" (1/2) ... [2019-08-04 21:38:29,620 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@976223a and model type simple1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 09:38:29, skipping insertion in model container [2019-08-04 21:38:29,620 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "simple1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 09:38:29" (2/2) ... [2019-08-04 21:38:29,622 INFO L109 eAbstractionObserver]: Analyzing ICFG simple1.i_3.bpl [2019-08-04 21:38:29,633 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-04 21:38:29,642 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-04 21:38:29,659 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-04 21:38:29,685 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-04 21:38:29,686 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-04 21:38:29,686 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-04 21:38:29,686 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-04 21:38:29,686 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-04 21:38:29,687 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-04 21:38:29,687 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-04 21:38:29,687 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-04 21:38:29,687 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-04 21:38:29,701 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-04 21:38:29,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-04 21:38:29,710 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:29,711 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-04 21:38:29,714 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:29,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:29,720 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2019-08-04 21:38:29,768 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:29,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:29,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-04 21:38:29,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:29,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:29,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:38:29,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-04 21:38:29,887 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-04 21:38:29,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-04 21:38:29,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-04 21:38:29,904 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-04 21:38:29,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:29,941 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-08-04 21:38:29,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-04 21:38:29,943 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-04 21:38:29,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:29,953 INFO L225 Difference]: With dead ends: 5 [2019-08-04 21:38:29,954 INFO L226 Difference]: Without dead ends: 5 [2019-08-04 21:38:29,956 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-04 21:38:29,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-04 21:38:29,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-04 21:38:29,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-04 21:38:29,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-04 21:38:29,989 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-04 21:38:29,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:29,990 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-04 21:38:29,990 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-04 21:38:29,990 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-04 21:38:29,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-04 21:38:29,991 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:29,991 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-04 21:38:29,991 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:29,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:29,992 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2019-08-04 21:38:29,993 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:30,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:30,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-04 21:38:30,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:30,127 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-04 21:38:30,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:30,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-04 21:38:30,131 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-04 21:38:30,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-04 21:38:30,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-04 21:38:30,132 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-08-04 21:38:30,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:30,202 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-04 21:38:30,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-04 21:38:30,203 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-04 21:38:30,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:30,203 INFO L225 Difference]: With dead ends: 6 [2019-08-04 21:38:30,204 INFO L226 Difference]: Without dead ends: 6 [2019-08-04 21:38:30,205 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-04 21:38:30,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-04 21:38:30,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-04 21:38:30,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-04 21:38:30,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-04 21:38:30,207 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-04 21:38:30,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:30,207 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-04 21:38:30,208 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-04 21:38:30,208 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-04 21:38:30,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-04 21:38:30,208 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:30,208 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-04 21:38:30,209 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:30,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:30,209 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2019-08-04 21:38:30,210 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:30,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:30,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-04 21:38:30,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:30,326 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-04 21:38:30,327 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:30,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-04 21:38:30,328 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-04 21:38:30,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-04 21:38:30,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-04 21:38:30,329 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-08-04 21:38:30,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:30,413 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-04 21:38:30,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-04 21:38:30,415 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-04 21:38:30,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:30,416 INFO L225 Difference]: With dead ends: 7 [2019-08-04 21:38:30,416 INFO L226 Difference]: Without dead ends: 7 [2019-08-04 21:38:30,417 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-04 21:38:30,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-04 21:38:30,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-04 21:38:30,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-04 21:38:30,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-04 21:38:30,420 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-04 21:38:30,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:30,421 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-04 21:38:30,421 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-04 21:38:30,421 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-04 21:38:30,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-04 21:38:30,422 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:30,422 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-04 21:38:30,422 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:30,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:30,422 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 3 times [2019-08-04 21:38:30,423 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:30,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:30,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-04 21:38:30,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:30,521 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-04 21:38:30,522 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:30,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-04 21:38:30,523 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-04 21:38:30,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-04 21:38:30,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-04 21:38:30,524 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-08-04 21:38:30,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:30,599 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-04 21:38:30,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-04 21:38:30,600 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-04 21:38:30,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:30,600 INFO L225 Difference]: With dead ends: 8 [2019-08-04 21:38:30,600 INFO L226 Difference]: Without dead ends: 8 [2019-08-04 21:38:30,601 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-04 21:38:30,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-04 21:38:30,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-04 21:38:30,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-04 21:38:30,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-04 21:38:30,603 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-04 21:38:30,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:30,604 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-04 21:38:30,604 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-04 21:38:30,604 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-04 21:38:30,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-04 21:38:30,604 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:30,605 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-04 21:38:30,605 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:30,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:30,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1949894467, now seen corresponding path program 4 times [2019-08-04 21:38:30,606 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:30,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:30,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-04 21:38:30,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:30,732 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-04 21:38:30,733 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:30,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-04 21:38:30,733 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-04 21:38:30,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-04 21:38:30,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:38:30,734 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-08-04 21:38:31,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:31,012 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-04 21:38:31,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-04 21:38:31,013 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-04 21:38:31,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:31,014 INFO L225 Difference]: With dead ends: 9 [2019-08-04 21:38:31,014 INFO L226 Difference]: Without dead ends: 9 [2019-08-04 21:38:31,014 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-04 21:38:31,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-04 21:38:31,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-04 21:38:31,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-04 21:38:31,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-04 21:38:31,017 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-04 21:38:31,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:31,017 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-04 21:38:31,017 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-04 21:38:31,017 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-04 21:38:31,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-04 21:38:31,018 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:31,018 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-08-04 21:38:31,018 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:31,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:31,018 INFO L82 PathProgramCache]: Analyzing trace with hash 317188140, now seen corresponding path program 5 times [2019-08-04 21:38:31,019 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:31,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:31,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-04 21:38:31,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:31,222 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-04 21:38:31,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:31,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-04 21:38:31,222 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-04 21:38:31,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-04 21:38:31,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:38:31,223 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2019-08-04 21:38:31,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:31,407 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-04 21:38:31,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-04 21:38:31,408 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-04 21:38:31,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:31,409 INFO L225 Difference]: With dead ends: 10 [2019-08-04 21:38:31,409 INFO L226 Difference]: Without dead ends: 10 [2019-08-04 21:38:31,410 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-04 21:38:31,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-04 21:38:31,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-04 21:38:31,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-04 21:38:31,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-04 21:38:31,412 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-08-04 21:38:31,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:31,414 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-04 21:38:31,414 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-04 21:38:31,414 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-04 21:38:31,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-04 21:38:31,414 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:31,415 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-08-04 21:38:31,415 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:31,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:31,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1242899555, now seen corresponding path program 6 times [2019-08-04 21:38:31,416 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:31,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:31,434 WARN L254 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-04 21:38:31,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:31,612 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-04 21:38:31,613 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:31,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-04 21:38:31,613 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-04 21:38:31,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-04 21:38:31,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:38:31,614 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2019-08-04 21:38:31,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:31,707 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-04 21:38:31,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-04 21:38:31,707 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-08-04 21:38:31,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:31,708 INFO L225 Difference]: With dead ends: 11 [2019-08-04 21:38:31,708 INFO L226 Difference]: Without dead ends: 11 [2019-08-04 21:38:31,709 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:38:31,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-04 21:38:31,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-04 21:38:31,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-04 21:38:31,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-04 21:38:31,712 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-08-04 21:38:31,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:31,712 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-04 21:38:31,713 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-04 21:38:31,713 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-04 21:38:31,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-04 21:38:31,713 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:31,713 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-08-04 21:38:31,714 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:31,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:31,714 INFO L82 PathProgramCache]: Analyzing trace with hash -124817652, now seen corresponding path program 7 times [2019-08-04 21:38:31,715 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:31,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:31,732 WARN L254 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-04 21:38:31,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:32,135 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-04 21:38:32,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:32,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-04 21:38:32,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-04 21:38:32,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-04 21:38:32,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:38:32,137 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2019-08-04 21:38:32,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:32,231 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-04 21:38:32,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-04 21:38:32,232 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-08-04 21:38:32,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:32,232 INFO L225 Difference]: With dead ends: 12 [2019-08-04 21:38:32,232 INFO L226 Difference]: Without dead ends: 12 [2019-08-04 21:38:32,233 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-04 21:38:32,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-04 21:38:32,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-04 21:38:32,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-04 21:38:32,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-04 21:38:32,237 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-08-04 21:38:32,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:32,237 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-04 21:38:32,237 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-04 21:38:32,237 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-04 21:38:32,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-04 21:38:32,238 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:32,238 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-08-04 21:38:32,238 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:32,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:32,239 INFO L82 PathProgramCache]: Analyzing trace with hash 425621891, now seen corresponding path program 8 times [2019-08-04 21:38:32,240 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:32,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:32,257 WARN L254 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-04 21:38:32,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:32,426 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-04 21:38:32,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:32,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-04 21:38:32,427 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-04 21:38:32,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-04 21:38:32,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-04 21:38:32,428 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-08-04 21:38:32,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:32,547 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-04 21:38:32,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-04 21:38:32,548 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-08-04 21:38:32,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:32,549 INFO L225 Difference]: With dead ends: 13 [2019-08-04 21:38:32,549 INFO L226 Difference]: Without dead ends: 13 [2019-08-04 21:38:32,550 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-04 21:38:32,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-04 21:38:32,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-04 21:38:32,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-04 21:38:32,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-04 21:38:32,552 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-08-04 21:38:32,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:32,553 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-04 21:38:32,553 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-04 21:38:32,553 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-04 21:38:32,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-04 21:38:32,554 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:32,554 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-08-04 21:38:32,554 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:32,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:32,555 INFO L82 PathProgramCache]: Analyzing trace with hash 309378540, now seen corresponding path program 9 times [2019-08-04 21:38:32,555 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:32,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:32,575 WARN L254 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-04 21:38:32,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:32,743 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-04 21:38:32,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:32,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-04 21:38:32,744 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-04 21:38:32,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-04 21:38:32,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-04 21:38:32,744 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2019-08-04 21:38:32,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:32,970 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-04 21:38:32,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-04 21:38:32,970 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-08-04 21:38:32,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:32,971 INFO L225 Difference]: With dead ends: 14 [2019-08-04 21:38:32,972 INFO L226 Difference]: Without dead ends: 14 [2019-08-04 21:38:32,972 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-04 21:38:32,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-04 21:38:32,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-04 21:38:32,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-04 21:38:32,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-04 21:38:32,976 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-08-04 21:38:32,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:32,976 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-04 21:38:32,976 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-04 21:38:32,976 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-04 21:38:32,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-04 21:38:32,977 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:32,977 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-08-04 21:38:32,977 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:32,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:32,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1000801955, now seen corresponding path program 10 times [2019-08-04 21:38:32,978 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:32,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:32,997 WARN L254 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-04 21:38:32,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:33,281 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-04 21:38:33,281 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:33,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-04 21:38:33,282 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-04 21:38:33,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-04 21:38:33,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-04 21:38:33,283 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2019-08-04 21:38:33,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:33,466 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-04 21:38:33,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-04 21:38:33,467 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-08-04 21:38:33,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:33,469 INFO L225 Difference]: With dead ends: 15 [2019-08-04 21:38:33,469 INFO L226 Difference]: Without dead ends: 15 [2019-08-04 21:38:33,469 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-04 21:38:33,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-04 21:38:33,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-04 21:38:33,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-04 21:38:33,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-04 21:38:33,473 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-08-04 21:38:33,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:33,474 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-04 21:38:33,474 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-04 21:38:33,474 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-04 21:38:33,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-04 21:38:33,475 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:33,475 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2019-08-04 21:38:33,475 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:33,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:33,475 INFO L82 PathProgramCache]: Analyzing trace with hash 960091340, now seen corresponding path program 11 times [2019-08-04 21:38:33,476 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:33,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:33,493 WARN L254 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-04 21:38:33,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:33,657 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-04 21:38:33,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:33,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-04 21:38:33,658 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-04 21:38:33,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-04 21:38:33,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-04 21:38:33,659 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2019-08-04 21:38:33,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:33,812 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-04 21:38:33,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-04 21:38:33,813 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-08-04 21:38:33,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:33,814 INFO L225 Difference]: With dead ends: 16 [2019-08-04 21:38:33,814 INFO L226 Difference]: Without dead ends: 16 [2019-08-04 21:38:33,815 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-04 21:38:33,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-04 21:38:33,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-04 21:38:33,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-04 21:38:33,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-04 21:38:33,818 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-08-04 21:38:33,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:33,818 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-04 21:38:33,818 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-04 21:38:33,818 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-04 21:38:33,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-04 21:38:33,819 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:33,819 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-08-04 21:38:33,819 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:33,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:33,820 INFO L82 PathProgramCache]: Analyzing trace with hash -301937725, now seen corresponding path program 12 times [2019-08-04 21:38:33,821 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:33,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:33,849 WARN L254 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-04 21:38:33,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:34,064 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-04 21:38:34,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:34,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-04 21:38:34,065 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-04 21:38:34,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-04 21:38:34,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-04 21:38:34,066 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2019-08-04 21:38:34,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:34,272 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-04 21:38:34,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-04 21:38:34,278 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-08-04 21:38:34,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:34,278 INFO L225 Difference]: With dead ends: 17 [2019-08-04 21:38:34,279 INFO L226 Difference]: Without dead ends: 17 [2019-08-04 21:38:34,279 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-04 21:38:34,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-04 21:38:34,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-04 21:38:34,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-04 21:38:34,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-04 21:38:34,285 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-08-04 21:38:34,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:34,286 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-04 21:38:34,286 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-04 21:38:34,286 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-04 21:38:34,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-04 21:38:34,287 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:34,287 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2019-08-04 21:38:34,287 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:34,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:34,288 INFO L82 PathProgramCache]: Analyzing trace with hash -770133076, now seen corresponding path program 13 times [2019-08-04 21:38:34,289 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:34,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:34,329 WARN L254 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-04 21:38:34,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:34,647 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-04 21:38:34,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:34,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-04 21:38:34,648 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-04 21:38:34,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-04 21:38:34,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-04 21:38:34,650 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2019-08-04 21:38:34,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:34,918 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-04 21:38:34,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-04 21:38:34,919 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-08-04 21:38:34,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:34,920 INFO L225 Difference]: With dead ends: 18 [2019-08-04 21:38:34,920 INFO L226 Difference]: Without dead ends: 18 [2019-08-04 21:38:34,923 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-04 21:38:34,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-04 21:38:34,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-04 21:38:34,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-04 21:38:34,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-08-04 21:38:34,925 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-08-04 21:38:34,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:34,926 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-08-04 21:38:34,926 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-04 21:38:34,926 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-08-04 21:38:34,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-04 21:38:34,927 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:34,927 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2019-08-04 21:38:34,927 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:34,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:34,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1895680227, now seen corresponding path program 14 times [2019-08-04 21:38:34,928 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:34,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:34,943 WARN L254 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-04 21:38:34,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:35,177 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-04 21:38:35,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:35,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-04 21:38:35,178 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-04 21:38:35,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-04 21:38:35,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-04 21:38:35,179 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2019-08-04 21:38:35,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:35,395 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-04 21:38:35,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-04 21:38:35,396 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-08-04 21:38:35,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:35,397 INFO L225 Difference]: With dead ends: 19 [2019-08-04 21:38:35,397 INFO L226 Difference]: Without dead ends: 19 [2019-08-04 21:38:35,398 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-04 21:38:35,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-04 21:38:35,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-04 21:38:35,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-04 21:38:35,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-04 21:38:35,401 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-08-04 21:38:35,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:35,401 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-04 21:38:35,401 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-04 21:38:35,402 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-04 21:38:35,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-04 21:38:35,402 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:35,402 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2019-08-04 21:38:35,402 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:35,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:35,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1363453300, now seen corresponding path program 15 times [2019-08-04 21:38:35,404 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:35,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:35,418 WARN L254 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-04 21:38:35,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:35,965 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-04 21:38:35,965 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:35,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-04 21:38:35,966 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-04 21:38:35,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-04 21:38:35,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-04 21:38:35,966 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2019-08-04 21:38:36,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:36,234 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-04 21:38:36,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-04 21:38:36,234 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-08-04 21:38:36,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:36,236 INFO L225 Difference]: With dead ends: 20 [2019-08-04 21:38:36,236 INFO L226 Difference]: Without dead ends: 20 [2019-08-04 21:38:36,237 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-04 21:38:36,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-04 21:38:36,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-04 21:38:36,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-04 21:38:36,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-04 21:38:36,239 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-08-04 21:38:36,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:36,240 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-04 21:38:36,240 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-04 21:38:36,240 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-04 21:38:36,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-04 21:38:36,242 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:36,242 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2019-08-04 21:38:36,242 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:36,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:36,243 INFO L82 PathProgramCache]: Analyzing trace with hash 682622467, now seen corresponding path program 16 times [2019-08-04 21:38:36,243 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:36,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:36,261 WARN L254 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-04 21:38:36,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:36,912 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-04 21:38:36,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:36,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-04 21:38:36,913 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-04 21:38:36,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-04 21:38:36,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-04 21:38:36,914 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2019-08-04 21:38:37,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:37,181 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-08-04 21:38:37,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-04 21:38:37,182 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-08-04 21:38:37,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:37,182 INFO L225 Difference]: With dead ends: 21 [2019-08-04 21:38:37,182 INFO L226 Difference]: Without dead ends: 21 [2019-08-04 21:38:37,183 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-04 21:38:37,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-04 21:38:37,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-04 21:38:37,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-04 21:38:37,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-04 21:38:37,186 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-08-04 21:38:37,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:37,186 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-04 21:38:37,186 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-04 21:38:37,186 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-04 21:38:37,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-04 21:38:37,187 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:37,187 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2019-08-04 21:38:37,187 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:37,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:37,188 INFO L82 PathProgramCache]: Analyzing trace with hash -313538196, now seen corresponding path program 17 times [2019-08-04 21:38:37,188 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:37,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:37,203 WARN L254 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-04 21:38:37,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:37,626 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-04 21:38:37,627 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:37,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-04 21:38:37,627 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-04 21:38:37,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-04 21:38:37,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-04 21:38:37,628 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2019-08-04 21:38:38,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:38,005 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-04 21:38:38,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-04 21:38:38,006 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-08-04 21:38:38,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:38,007 INFO L225 Difference]: With dead ends: 22 [2019-08-04 21:38:38,007 INFO L226 Difference]: Without dead ends: 22 [2019-08-04 21:38:38,008 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-04 21:38:38,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-04 21:38:38,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-04 21:38:38,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-04 21:38:38,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-08-04 21:38:38,012 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-08-04 21:38:38,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:38,012 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-08-04 21:38:38,012 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-04 21:38:38,012 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-08-04 21:38:38,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-04 21:38:38,012 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:38,013 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2019-08-04 21:38:38,013 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:38,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:38,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1129747677, now seen corresponding path program 18 times [2019-08-04 21:38:38,014 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:38,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:38,028 WARN L254 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-04 21:38:38,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:38,271 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-04 21:38:38,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:38,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-04 21:38:38,272 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-04 21:38:38,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-04 21:38:38,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-04 21:38:38,273 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2019-08-04 21:38:38,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:38,667 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-08-04 21:38:38,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-04 21:38:38,668 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-08-04 21:38:38,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:38,669 INFO L225 Difference]: With dead ends: 23 [2019-08-04 21:38:38,669 INFO L226 Difference]: Without dead ends: 23 [2019-08-04 21:38:38,670 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-04 21:38:38,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-04 21:38:38,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-04 21:38:38,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-04 21:38:38,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-08-04 21:38:38,675 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-08-04 21:38:38,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:38,675 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-08-04 21:38:38,675 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-04 21:38:38,675 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-08-04 21:38:38,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-04 21:38:38,676 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:38,676 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2019-08-04 21:38:38,676 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:38,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:38,677 INFO L82 PathProgramCache]: Analyzing trace with hash -662437812, now seen corresponding path program 19 times [2019-08-04 21:38:38,678 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:38,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:38,691 WARN L254 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-04 21:38:38,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:38,914 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-04 21:38:38,914 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:38,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-04 21:38:38,915 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-04 21:38:38,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-04 21:38:38,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-04 21:38:38,916 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2019-08-04 21:38:39,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:39,262 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-08-04 21:38:39,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-04 21:38:39,262 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-04 21:38:39,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:39,263 INFO L225 Difference]: With dead ends: 24 [2019-08-04 21:38:39,263 INFO L226 Difference]: Without dead ends: 24 [2019-08-04 21:38:39,264 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-04 21:38:39,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-04 21:38:39,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-04 21:38:39,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-04 21:38:39,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-08-04 21:38:39,268 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-08-04 21:38:39,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:39,268 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-08-04 21:38:39,268 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-04 21:38:39,268 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-08-04 21:38:39,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-04 21:38:39,269 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:39,269 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2019-08-04 21:38:39,269 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:39,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:39,269 INFO L82 PathProgramCache]: Analyzing trace with hash 939266115, now seen corresponding path program 20 times [2019-08-04 21:38:39,270 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:39,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:39,284 WARN L254 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-04 21:38:39,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:39,547 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-04 21:38:39,548 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:39,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-04 21:38:39,548 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-04 21:38:39,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-04 21:38:39,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-04 21:38:39,549 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2019-08-04 21:38:39,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:39,979 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-08-04 21:38:39,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-04 21:38:39,980 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-08-04 21:38:39,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:39,981 INFO L225 Difference]: With dead ends: 25 [2019-08-04 21:38:39,981 INFO L226 Difference]: Without dead ends: 25 [2019-08-04 21:38:39,982 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-04 21:38:39,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-04 21:38:39,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-04 21:38:39,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-04 21:38:39,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-08-04 21:38:39,985 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-08-04 21:38:39,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:39,986 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-08-04 21:38:39,986 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-04 21:38:39,986 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-08-04 21:38:39,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-04 21:38:39,987 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:39,987 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2019-08-04 21:38:39,987 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:39,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:39,988 INFO L82 PathProgramCache]: Analyzing trace with hash -947519700, now seen corresponding path program 21 times [2019-08-04 21:38:39,988 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:40,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:40,003 WARN L254 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-04 21:38:40,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:40,485 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-04 21:38:40,485 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:40,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-04 21:38:40,485 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-04 21:38:40,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-04 21:38:40,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-04 21:38:40,486 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2019-08-04 21:38:40,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:40,982 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-08-04 21:38:40,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-04 21:38:40,985 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-08-04 21:38:40,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:40,985 INFO L225 Difference]: With dead ends: 26 [2019-08-04 21:38:40,985 INFO L226 Difference]: Without dead ends: 26 [2019-08-04 21:38:40,985 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-04 21:38:40,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-04 21:38:40,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-08-04 21:38:40,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-04 21:38:40,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-08-04 21:38:40,988 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-08-04 21:38:40,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:40,988 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-08-04 21:38:40,988 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-04 21:38:40,988 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-08-04 21:38:40,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-04 21:38:40,989 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:40,989 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2019-08-04 21:38:40,989 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:40,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:40,989 INFO L82 PathProgramCache]: Analyzing trace with hash 691662179, now seen corresponding path program 22 times [2019-08-04 21:38:40,990 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:41,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:41,004 WARN L254 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-04 21:38:41,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:41,312 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-04 21:38:41,312 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:41,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-04 21:38:41,313 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-04 21:38:41,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-04 21:38:41,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-04 21:38:41,313 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2019-08-04 21:38:42,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:42,252 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-08-04 21:38:42,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-04 21:38:42,254 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-08-04 21:38:42,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:42,255 INFO L225 Difference]: With dead ends: 27 [2019-08-04 21:38:42,255 INFO L226 Difference]: Without dead ends: 27 [2019-08-04 21:38:42,255 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-04 21:38:42,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-04 21:38:42,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-08-04 21:38:42,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-04 21:38:42,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-08-04 21:38:42,258 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-08-04 21:38:42,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:42,258 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-08-04 21:38:42,258 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-04 21:38:42,258 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-08-04 21:38:42,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-04 21:38:42,259 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:42,259 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2019-08-04 21:38:42,259 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:42,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:42,260 INFO L82 PathProgramCache]: Analyzing trace with hash -33307124, now seen corresponding path program 23 times [2019-08-04 21:38:42,261 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:42,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:42,274 WARN L254 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-04 21:38:42,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:42,614 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-04 21:38:42,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:42,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-04 21:38:42,615 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-04 21:38:42,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-04 21:38:42,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-04 21:38:42,616 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2019-08-04 21:38:43,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:43,302 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-08-04 21:38:43,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-04 21:38:43,305 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-08-04 21:38:43,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:43,305 INFO L225 Difference]: With dead ends: 28 [2019-08-04 21:38:43,305 INFO L226 Difference]: Without dead ends: 28 [2019-08-04 21:38:43,306 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-04 21:38:43,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-04 21:38:43,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-04 21:38:43,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-04 21:38:43,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-08-04 21:38:43,311 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-08-04 21:38:43,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:43,311 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-08-04 21:38:43,311 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-04 21:38:43,311 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-08-04 21:38:43,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-04 21:38:43,312 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:43,312 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2019-08-04 21:38:43,312 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:43,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:43,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1032519037, now seen corresponding path program 24 times [2019-08-04 21:38:43,313 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:43,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:43,327 WARN L254 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-04 21:38:43,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:43,700 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-04 21:38:43,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:43,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-04 21:38:43,701 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-04 21:38:43,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-04 21:38:43,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-04 21:38:43,702 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2019-08-04 21:38:44,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:44,212 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-08-04 21:38:44,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-04 21:38:44,212 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-08-04 21:38:44,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:44,213 INFO L225 Difference]: With dead ends: 29 [2019-08-04 21:38:44,213 INFO L226 Difference]: Without dead ends: 29 [2019-08-04 21:38:44,214 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-04 21:38:44,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-04 21:38:44,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-04 21:38:44,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-04 21:38:44,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-08-04 21:38:44,217 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-08-04 21:38:44,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:44,218 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-08-04 21:38:44,218 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-04 21:38:44,218 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-08-04 21:38:44,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-04 21:38:44,218 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:44,219 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2019-08-04 21:38:44,219 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:44,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:44,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1943317268, now seen corresponding path program 25 times [2019-08-04 21:38:44,220 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:44,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:44,235 WARN L254 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-04 21:38:44,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:44,599 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-04 21:38:44,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:44,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-04 21:38:44,600 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-04 21:38:44,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-04 21:38:44,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-08-04 21:38:44,601 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2019-08-04 21:38:45,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:45,171 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-08-04 21:38:45,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-04 21:38:45,172 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2019-08-04 21:38:45,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:45,172 INFO L225 Difference]: With dead ends: 30 [2019-08-04 21:38:45,173 INFO L226 Difference]: Without dead ends: 30 [2019-08-04 21:38:45,173 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-08-04 21:38:45,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-04 21:38:45,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-08-04 21:38:45,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-04 21:38:45,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-08-04 21:38:45,176 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-08-04 21:38:45,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:45,177 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-08-04 21:38:45,177 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-04 21:38:45,177 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-08-04 21:38:45,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-04 21:38:45,177 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:45,177 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2019-08-04 21:38:45,178 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:45,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:45,178 INFO L82 PathProgramCache]: Analyzing trace with hash -113291357, now seen corresponding path program 26 times [2019-08-04 21:38:45,179 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:45,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:45,194 WARN L254 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-04 21:38:45,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:45,851 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-04 21:38:45,852 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:45,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-04 21:38:45,852 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-04 21:38:45,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-04 21:38:45,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2019-08-04 21:38:45,853 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2019-08-04 21:38:46,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:46,436 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-08-04 21:38:46,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-04 21:38:46,437 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2019-08-04 21:38:46,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:46,437 INFO L225 Difference]: With dead ends: 31 [2019-08-04 21:38:46,438 INFO L226 Difference]: Without dead ends: 31 [2019-08-04 21:38:46,438 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2019-08-04 21:38:46,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-04 21:38:46,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-04 21:38:46,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-04 21:38:46,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-08-04 21:38:46,441 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-08-04 21:38:46,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:46,441 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-08-04 21:38:46,441 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-04 21:38:46,442 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-08-04 21:38:46,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-04 21:38:46,442 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:46,442 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2019-08-04 21:38:46,442 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:46,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:46,443 INFO L82 PathProgramCache]: Analyzing trace with hash 782937036, now seen corresponding path program 27 times [2019-08-04 21:38:46,443 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:46,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:46,458 WARN L254 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-04 21:38:46,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:47,411 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-04 21:38:47,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:47,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-04 21:38:47,412 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-04 21:38:47,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-04 21:38:47,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-08-04 21:38:47,413 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2019-08-04 21:38:48,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:48,041 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-08-04 21:38:48,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-04 21:38:48,042 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2019-08-04 21:38:48,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:48,042 INFO L225 Difference]: With dead ends: 32 [2019-08-04 21:38:48,043 INFO L226 Difference]: Without dead ends: 32 [2019-08-04 21:38:48,043 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-08-04 21:38:48,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-04 21:38:48,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-08-04 21:38:48,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-04 21:38:48,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-08-04 21:38:48,047 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-08-04 21:38:48,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:48,048 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-08-04 21:38:48,048 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-04 21:38:48,048 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-08-04 21:38:48,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-04 21:38:48,048 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:48,048 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2019-08-04 21:38:48,049 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:48,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:48,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1498753853, now seen corresponding path program 28 times [2019-08-04 21:38:48,050 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:48,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:48,065 WARN L254 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-04 21:38:48,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:48,440 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-04 21:38:48,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:48,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-04 21:38:48,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-04 21:38:48,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-04 21:38:48,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2019-08-04 21:38:48,442 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2019-08-04 21:38:49,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:49,128 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-08-04 21:38:49,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-04 21:38:49,128 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2019-08-04 21:38:49,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:49,129 INFO L225 Difference]: With dead ends: 33 [2019-08-04 21:38:49,129 INFO L226 Difference]: Without dead ends: 33 [2019-08-04 21:38:49,130 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-04 21:38:49,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-04 21:38:49,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-08-04 21:38:49,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-04 21:38:49,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-08-04 21:38:49,134 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-08-04 21:38:49,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:49,134 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-08-04 21:38:49,134 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-04 21:38:49,134 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-08-04 21:38:49,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-04 21:38:49,135 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:49,135 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2019-08-04 21:38:49,135 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:49,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:49,136 INFO L82 PathProgramCache]: Analyzing trace with hash 783272620, now seen corresponding path program 29 times [2019-08-04 21:38:49,136 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:49,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:49,167 WARN L254 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-04 21:38:49,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:49,740 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-04 21:38:49,740 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:49,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-04 21:38:49,741 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-04 21:38:49,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-04 21:38:49,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-08-04 21:38:49,741 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2019-08-04 21:38:50,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:50,454 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-08-04 21:38:50,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-04 21:38:50,454 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2019-08-04 21:38:50,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:50,455 INFO L225 Difference]: With dead ends: 34 [2019-08-04 21:38:50,455 INFO L226 Difference]: Without dead ends: 34 [2019-08-04 21:38:50,456 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-08-04 21:38:50,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-04 21:38:50,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-08-04 21:38:50,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-04 21:38:50,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-08-04 21:38:50,458 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-08-04 21:38:50,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:50,459 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-08-04 21:38:50,459 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-04 21:38:50,459 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-08-04 21:38:50,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-04 21:38:50,459 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:50,460 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2019-08-04 21:38:50,460 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:50,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:50,460 INFO L82 PathProgramCache]: Analyzing trace with hash -1488350749, now seen corresponding path program 30 times [2019-08-04 21:38:50,461 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:50,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:50,478 WARN L254 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-04 21:38:50,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:51,959 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-04 21:38:51,959 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:51,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-04 21:38:51,959 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-04 21:38:51,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-04 21:38:51,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2019-08-04 21:38:51,960 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2019-08-04 21:38:52,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:52,778 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-08-04 21:38:52,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-04 21:38:52,779 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2019-08-04 21:38:52,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:52,779 INFO L225 Difference]: With dead ends: 35 [2019-08-04 21:38:52,779 INFO L226 Difference]: Without dead ends: 35 [2019-08-04 21:38:52,780 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2019-08-04 21:38:52,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-04 21:38:52,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-04 21:38:52,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-04 21:38:52,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-08-04 21:38:52,782 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-08-04 21:38:52,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:52,783 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-08-04 21:38:52,783 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-04 21:38:52,783 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-08-04 21:38:52,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-04 21:38:52,783 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:52,784 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2019-08-04 21:38:52,784 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:52,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:52,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1105768844, now seen corresponding path program 31 times [2019-08-04 21:38:52,785 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:52,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:52,801 WARN L254 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-04 21:38:52,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:53,702 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-04 21:38:53,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:53,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-04 21:38:53,703 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-04 21:38:53,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-04 21:38:53,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2019-08-04 21:38:53,704 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2019-08-04 21:38:54,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:54,518 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-08-04 21:38:54,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-04 21:38:54,518 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2019-08-04 21:38:54,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:54,519 INFO L225 Difference]: With dead ends: 36 [2019-08-04 21:38:54,519 INFO L226 Difference]: Without dead ends: 36 [2019-08-04 21:38:54,520 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-04 21:38:54,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-04 21:38:54,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-04 21:38:54,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-04 21:38:54,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-08-04 21:38:54,522 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-08-04 21:38:54,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:54,523 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-08-04 21:38:54,523 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-04 21:38:54,523 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-08-04 21:38:54,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-04 21:38:54,523 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:54,523 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2019-08-04 21:38:54,524 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:54,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:54,524 INFO L82 PathProgramCache]: Analyzing trace with hash -80902397, now seen corresponding path program 32 times [2019-08-04 21:38:54,525 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:54,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:54,541 WARN L254 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-04 21:38:54,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:55,041 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-04 21:38:55,041 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:55,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-04 21:38:55,042 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-04 21:38:55,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-04 21:38:55,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2019-08-04 21:38:55,043 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2019-08-04 21:38:55,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:55,898 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-08-04 21:38:55,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-04 21:38:55,898 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2019-08-04 21:38:55,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:55,899 INFO L225 Difference]: With dead ends: 37 [2019-08-04 21:38:55,899 INFO L226 Difference]: Without dead ends: 37 [2019-08-04 21:38:55,901 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2019-08-04 21:38:55,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-04 21:38:55,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-04 21:38:55,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-04 21:38:55,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-08-04 21:38:55,904 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-08-04 21:38:55,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:55,904 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-08-04 21:38:55,904 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-04 21:38:55,904 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-08-04 21:38:55,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-04 21:38:55,904 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:55,905 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2019-08-04 21:38:55,905 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:55,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:55,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1786994796, now seen corresponding path program 33 times [2019-08-04 21:38:55,906 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:55,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:55,924 WARN L254 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-04 21:38:55,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:56,823 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-04 21:38:56,823 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:56,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-04 21:38:56,824 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-04 21:38:56,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-04 21:38:56,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-08-04 21:38:56,825 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2019-08-04 21:38:57,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:57,896 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-08-04 21:38:57,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-04 21:38:57,896 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2019-08-04 21:38:57,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:57,897 INFO L225 Difference]: With dead ends: 38 [2019-08-04 21:38:57,897 INFO L226 Difference]: Without dead ends: 38 [2019-08-04 21:38:57,898 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-08-04 21:38:57,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-04 21:38:57,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-08-04 21:38:57,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-04 21:38:57,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-08-04 21:38:57,900 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-08-04 21:38:57,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:57,900 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-08-04 21:38:57,900 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-04 21:38:57,901 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-08-04 21:38:57,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-04 21:38:57,901 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:57,901 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2019-08-04 21:38:57,901 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:57,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:57,901 INFO L82 PathProgramCache]: Analyzing trace with hash -437734365, now seen corresponding path program 34 times [2019-08-04 21:38:57,902 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:57,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:57,919 WARN L254 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 71 conjunts are in the unsatisfiable core [2019-08-04 21:38:57,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:58,565 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-04 21:38:58,566 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:58,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-04 21:38:58,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-04 21:38:58,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-04 21:38:58,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2019-08-04 21:38:58,567 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2019-08-04 21:38:59,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:59,539 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-08-04 21:38:59,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-04 21:38:59,539 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2019-08-04 21:38:59,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:59,540 INFO L225 Difference]: With dead ends: 39 [2019-08-04 21:38:59,540 INFO L226 Difference]: Without dead ends: 39 [2019-08-04 21:38:59,541 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2019-08-04 21:38:59,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-04 21:38:59,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-08-04 21:38:59,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-04 21:38:59,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-08-04 21:38:59,544 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-08-04 21:38:59,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:59,544 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-08-04 21:38:59,544 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-04 21:38:59,544 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-08-04 21:38:59,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-04 21:38:59,545 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:59,545 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2019-08-04 21:38:59,545 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:59,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:59,545 INFO L82 PathProgramCache]: Analyzing trace with hash -684861620, now seen corresponding path program 35 times [2019-08-04 21:38:59,546 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:59,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:59,563 WARN L254 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 73 conjunts are in the unsatisfiable core [2019-08-04 21:38:59,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:01,222 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-04 21:39:01,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:01,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-04 21:39:01,223 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-04 21:39:01,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-04 21:39:01,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-08-04 21:39:01,223 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2019-08-04 21:39:02,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:02,320 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-08-04 21:39:02,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-04 21:39:02,321 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2019-08-04 21:39:02,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:02,322 INFO L225 Difference]: With dead ends: 40 [2019-08-04 21:39:02,322 INFO L226 Difference]: Without dead ends: 40 [2019-08-04 21:39:02,323 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-08-04 21:39:02,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-04 21:39:02,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-08-04 21:39:02,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-04 21:39:02,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-08-04 21:39:02,325 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-08-04 21:39:02,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:02,325 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-08-04 21:39:02,325 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-04 21:39:02,325 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-08-04 21:39:02,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-04 21:39:02,326 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:02,326 INFO L399 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2019-08-04 21:39:02,326 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:02,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:02,326 INFO L82 PathProgramCache]: Analyzing trace with hash 244128067, now seen corresponding path program 36 times [2019-08-04 21:39:02,327 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:02,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:02,344 WARN L254 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-04 21:39:02,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:02,938 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-04 21:39:02,939 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:02,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-04 21:39:02,939 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-04 21:39:02,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-04 21:39:02,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2019-08-04 21:39:02,940 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2019-08-04 21:39:04,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:04,019 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-08-04 21:39:04,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-04 21:39:04,019 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2019-08-04 21:39:04,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:04,020 INFO L225 Difference]: With dead ends: 41 [2019-08-04 21:39:04,020 INFO L226 Difference]: Without dead ends: 41 [2019-08-04 21:39:04,021 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-04 21:39:04,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-04 21:39:04,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-08-04 21:39:04,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-04 21:39:04,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-08-04 21:39:04,024 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-08-04 21:39:04,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:04,024 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-08-04 21:39:04,024 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-04 21:39:04,024 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-08-04 21:39:04,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-04 21:39:04,024 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:04,025 INFO L399 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2019-08-04 21:39:04,025 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:04,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:04,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1021962708, now seen corresponding path program 37 times [2019-08-04 21:39:04,026 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:04,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:04,043 WARN L254 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 77 conjunts are in the unsatisfiable core [2019-08-04 21:39:04,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:04,689 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-04 21:39:04,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:04,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-04 21:39:04,690 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-04 21:39:04,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-04 21:39:04,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-08-04 21:39:04,691 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2019-08-04 21:39:05,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:05,831 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-08-04 21:39:05,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-04 21:39:05,831 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2019-08-04 21:39:05,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:05,832 INFO L225 Difference]: With dead ends: 42 [2019-08-04 21:39:05,832 INFO L226 Difference]: Without dead ends: 42 [2019-08-04 21:39:05,833 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-08-04 21:39:05,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-04 21:39:05,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-08-04 21:39:05,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-04 21:39:05,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-08-04 21:39:05,836 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-08-04 21:39:05,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:05,836 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-08-04 21:39:05,836 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-04 21:39:05,836 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-08-04 21:39:05,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-04 21:39:05,837 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:05,837 INFO L399 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2019-08-04 21:39:05,837 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:05,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:05,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1616071069, now seen corresponding path program 38 times [2019-08-04 21:39:05,838 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:05,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:05,870 WARN L254 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 79 conjunts are in the unsatisfiable core [2019-08-04 21:39:05,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:06,537 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-04 21:39:06,537 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:06,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-04 21:39:06,538 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-04 21:39:06,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-04 21:39:06,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2019-08-04 21:39:06,538 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2019-08-04 21:39:07,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:07,837 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-08-04 21:39:07,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-04 21:39:07,838 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2019-08-04 21:39:07,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:07,838 INFO L225 Difference]: With dead ends: 43 [2019-08-04 21:39:07,839 INFO L226 Difference]: Without dead ends: 43 [2019-08-04 21:39:07,840 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2019-08-04 21:39:07,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-04 21:39:07,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-04 21:39:07,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-04 21:39:07,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-08-04 21:39:07,842 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-08-04 21:39:07,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:07,842 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-08-04 21:39:07,843 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-04 21:39:07,843 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-08-04 21:39:07,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-04 21:39:07,843 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:07,843 INFO L399 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2019-08-04 21:39:07,844 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:07,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:07,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1441406220, now seen corresponding path program 39 times [2019-08-04 21:39:07,845 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:07,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:07,864 WARN L254 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 81 conjunts are in the unsatisfiable core [2019-08-04 21:39:07,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:08,553 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-04 21:39:08,553 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:08,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-04 21:39:08,554 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-04 21:39:08,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-04 21:39:08,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-08-04 21:39:08,554 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2019-08-04 21:39:09,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:09,805 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-08-04 21:39:09,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-04 21:39:09,805 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2019-08-04 21:39:09,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:09,806 INFO L225 Difference]: With dead ends: 44 [2019-08-04 21:39:09,806 INFO L226 Difference]: Without dead ends: 44 [2019-08-04 21:39:09,807 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-04 21:39:09,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-04 21:39:09,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-08-04 21:39:09,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-04 21:39:09,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-08-04 21:39:09,809 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-08-04 21:39:09,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:09,810 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-08-04 21:39:09,810 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-04 21:39:09,810 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-08-04 21:39:09,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-04 21:39:09,810 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:09,811 INFO L399 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2019-08-04 21:39:09,811 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:09,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:09,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1733921667, now seen corresponding path program 40 times [2019-08-04 21:39:09,811 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:09,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:09,830 WARN L254 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 83 conjunts are in the unsatisfiable core [2019-08-04 21:39:09,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:10,624 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-04 21:39:10,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:10,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-04 21:39:10,625 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-04 21:39:10,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-04 21:39:10,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2019-08-04 21:39:10,625 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2019-08-04 21:39:11,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:11,958 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-08-04 21:39:11,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-04 21:39:11,958 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2019-08-04 21:39:11,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:11,959 INFO L225 Difference]: With dead ends: 45 [2019-08-04 21:39:11,959 INFO L226 Difference]: Without dead ends: 45 [2019-08-04 21:39:11,960 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-04 21:39:11,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-04 21:39:11,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-04 21:39:11,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-04 21:39:11,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-08-04 21:39:11,962 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-08-04 21:39:11,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:11,962 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-08-04 21:39:11,963 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-04 21:39:11,963 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-08-04 21:39:11,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-04 21:39:11,963 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:11,963 INFO L399 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2019-08-04 21:39:11,964 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:11,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:11,964 INFO L82 PathProgramCache]: Analyzing trace with hash -2083001364, now seen corresponding path program 41 times [2019-08-04 21:39:11,965 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:11,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:11,985 WARN L254 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 85 conjunts are in the unsatisfiable core [2019-08-04 21:39:11,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:13,037 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-04 21:39:13,037 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:13,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-04 21:39:13,037 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-04 21:39:13,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-04 21:39:13,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2019-08-04 21:39:13,039 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2019-08-04 21:39:14,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:14,413 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-08-04 21:39:14,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-04 21:39:14,414 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2019-08-04 21:39:14,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:14,414 INFO L225 Difference]: With dead ends: 46 [2019-08-04 21:39:14,414 INFO L226 Difference]: Without dead ends: 46 [2019-08-04 21:39:14,415 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-04 21:39:14,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-04 21:39:14,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-08-04 21:39:14,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-04 21:39:14,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-08-04 21:39:14,417 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-08-04 21:39:14,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:14,418 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-08-04 21:39:14,418 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-04 21:39:14,418 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-08-04 21:39:14,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-04 21:39:14,418 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:14,418 INFO L399 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2019-08-04 21:39:14,419 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:14,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:14,419 INFO L82 PathProgramCache]: Analyzing trace with hash -148531037, now seen corresponding path program 42 times [2019-08-04 21:39:14,420 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:14,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:14,440 WARN L254 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-04 21:39:14,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:15,262 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-04 21:39:15,263 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:15,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-04 21:39:15,263 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-04 21:39:15,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-04 21:39:15,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-08-04 21:39:15,264 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2019-08-04 21:39:16,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:16,713 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-08-04 21:39:16,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-04 21:39:16,714 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2019-08-04 21:39:16,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:16,714 INFO L225 Difference]: With dead ends: 47 [2019-08-04 21:39:16,714 INFO L226 Difference]: Without dead ends: 47 [2019-08-04 21:39:16,716 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-08-04 21:39:16,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-04 21:39:16,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-08-04 21:39:16,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-04 21:39:16,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-08-04 21:39:16,718 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-08-04 21:39:16,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:16,718 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-08-04 21:39:16,718 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-04 21:39:16,718 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-08-04 21:39:16,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-04 21:39:16,719 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:16,719 INFO L399 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2019-08-04 21:39:16,719 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:16,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:16,719 INFO L82 PathProgramCache]: Analyzing trace with hash -309493044, now seen corresponding path program 43 times [2019-08-04 21:39:16,720 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:16,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:16,740 WARN L254 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-04 21:39:16,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:18,266 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-04 21:39:18,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:18,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-04 21:39:18,266 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-04 21:39:18,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-04 21:39:18,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2019-08-04 21:39:18,267 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2019-08-04 21:39:19,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:19,780 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-08-04 21:39:19,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-04 21:39:19,781 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2019-08-04 21:39:19,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:19,781 INFO L225 Difference]: With dead ends: 48 [2019-08-04 21:39:19,782 INFO L226 Difference]: Without dead ends: 48 [2019-08-04 21:39:19,782 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2019-08-04 21:39:19,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-04 21:39:19,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-08-04 21:39:19,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-04 21:39:19,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-08-04 21:39:19,784 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2019-08-04 21:39:19,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:19,785 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-08-04 21:39:19,785 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-04 21:39:19,785 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-08-04 21:39:19,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-04 21:39:19,785 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:19,786 INFO L399 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2019-08-04 21:39:19,786 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:19,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:19,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1004347965, now seen corresponding path program 44 times [2019-08-04 21:39:19,787 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:19,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:19,806 WARN L254 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 91 conjunts are in the unsatisfiable core [2019-08-04 21:39:19,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:20,885 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-04 21:39:20,885 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:20,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-04 21:39:20,885 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-04 21:39:20,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-04 21:39:20,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2019-08-04 21:39:20,886 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2019-08-04 21:39:22,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:22,495 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-08-04 21:39:22,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-04 21:39:22,495 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2019-08-04 21:39:22,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:22,496 INFO L225 Difference]: With dead ends: 49 [2019-08-04 21:39:22,496 INFO L226 Difference]: Without dead ends: 49 [2019-08-04 21:39:22,497 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2019-08-04 21:39:22,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-04 21:39:22,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-08-04 21:39:22,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-04 21:39:22,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-08-04 21:39:22,500 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2019-08-04 21:39:22,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:22,500 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-08-04 21:39:22,500 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-04 21:39:22,500 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-08-04 21:39:22,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-04 21:39:22,500 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:22,501 INFO L399 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2019-08-04 21:39:22,501 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:22,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:22,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1070014036, now seen corresponding path program 45 times [2019-08-04 21:39:22,502 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:22,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:22,521 WARN L254 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 93 conjunts are in the unsatisfiable core [2019-08-04 21:39:22,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:23,766 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-04 21:39:23,767 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:23,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-04 21:39:23,767 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-04 21:39:23,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-04 21:39:23,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2019-08-04 21:39:23,768 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2019-08-04 21:39:25,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:25,406 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-08-04 21:39:25,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-04 21:39:25,406 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2019-08-04 21:39:25,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:25,407 INFO L225 Difference]: With dead ends: 50 [2019-08-04 21:39:25,407 INFO L226 Difference]: Without dead ends: 50 [2019-08-04 21:39:25,408 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2019-08-04 21:39:25,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-04 21:39:25,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-08-04 21:39:25,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-04 21:39:25,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-08-04 21:39:25,410 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2019-08-04 21:39:25,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:25,410 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-08-04 21:39:25,410 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-04 21:39:25,411 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-08-04 21:39:25,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-04 21:39:25,411 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:25,411 INFO L399 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2019-08-04 21:39:25,411 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:25,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:25,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1189305059, now seen corresponding path program 46 times [2019-08-04 21:39:25,412 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:25,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:25,433 WARN L254 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 95 conjunts are in the unsatisfiable core [2019-08-04 21:39:25,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:26,394 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-04 21:39:26,395 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:26,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-04 21:39:26,395 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-04 21:39:26,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-04 21:39:26,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2019-08-04 21:39:26,396 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2019-08-04 21:39:28,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:28,256 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-08-04 21:39:28,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-04 21:39:28,259 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2019-08-04 21:39:28,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:28,260 INFO L225 Difference]: With dead ends: 51 [2019-08-04 21:39:28,260 INFO L226 Difference]: Without dead ends: 51 [2019-08-04 21:39:28,261 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2019-08-04 21:39:28,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-04 21:39:28,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-08-04 21:39:28,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-04 21:39:28,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-08-04 21:39:28,262 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-08-04 21:39:28,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:28,263 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-08-04 21:39:28,263 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-04 21:39:28,263 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-08-04 21:39:28,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-04 21:39:28,263 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:28,264 INFO L399 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2019-08-04 21:39:28,264 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:28,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:28,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1786247028, now seen corresponding path program 47 times [2019-08-04 21:39:28,265 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:28,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:28,287 WARN L254 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 97 conjunts are in the unsatisfiable core [2019-08-04 21:39:28,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:29,559 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-04 21:39:29,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:29,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-04 21:39:29,560 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-04 21:39:29,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-04 21:39:29,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2019-08-04 21:39:29,560 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2019-08-04 21:39:31,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:31,336 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-08-04 21:39:31,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-04 21:39:31,337 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2019-08-04 21:39:31,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:31,338 INFO L225 Difference]: With dead ends: 52 [2019-08-04 21:39:31,338 INFO L226 Difference]: Without dead ends: 52 [2019-08-04 21:39:31,339 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2019-08-04 21:39:31,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-04 21:39:31,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-04 21:39:31,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-04 21:39:31,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-08-04 21:39:31,342 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2019-08-04 21:39:31,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:31,342 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-08-04 21:39:31,342 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-04 21:39:31,343 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-08-04 21:39:31,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-04 21:39:31,343 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:31,343 INFO L399 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2019-08-04 21:39:31,344 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:31,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:31,344 INFO L82 PathProgramCache]: Analyzing trace with hash 460918787, now seen corresponding path program 48 times [2019-08-04 21:39:31,345 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:31,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:31,367 WARN L254 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 99 conjunts are in the unsatisfiable core [2019-08-04 21:39:31,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:32,349 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-04 21:39:32,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:32,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-04 21:39:32,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-04 21:39:32,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-04 21:39:32,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2019-08-04 21:39:32,351 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2019-08-04 21:39:34,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:34,338 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-08-04 21:39:34,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-04 21:39:34,339 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2019-08-04 21:39:34,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:34,339 INFO L225 Difference]: With dead ends: 53 [2019-08-04 21:39:34,339 INFO L226 Difference]: Without dead ends: 53 [2019-08-04 21:39:34,340 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2019-08-04 21:39:34,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-04 21:39:34,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-08-04 21:39:34,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-04 21:39:34,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-08-04 21:39:34,343 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2019-08-04 21:39:34,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:34,343 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-08-04 21:39:34,343 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-04 21:39:34,344 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-08-04 21:39:34,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-04 21:39:34,344 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:34,344 INFO L399 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2019-08-04 21:39:34,344 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:34,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:34,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1403582316, now seen corresponding path program 49 times [2019-08-04 21:39:34,345 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:34,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:34,371 WARN L254 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 101 conjunts are in the unsatisfiable core [2019-08-04 21:39:34,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:35,817 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-04 21:39:35,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:35,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-04 21:39:35,818 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-04 21:39:35,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-04 21:39:35,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2019-08-04 21:39:35,818 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2019-08-04 21:39:37,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:37,749 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-08-04 21:39:37,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-04 21:39:37,750 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2019-08-04 21:39:37,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:37,751 INFO L225 Difference]: With dead ends: 54 [2019-08-04 21:39:37,751 INFO L226 Difference]: Without dead ends: 54 [2019-08-04 21:39:37,752 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2019-08-04 21:39:37,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-04 21:39:37,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-08-04 21:39:37,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-04 21:39:37,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-08-04 21:39:37,753 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2019-08-04 21:39:37,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:37,753 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-08-04 21:39:37,754 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-04 21:39:37,754 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-08-04 21:39:37,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-04 21:39:37,754 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:37,754 INFO L399 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2019-08-04 21:39:37,754 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:37,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:37,755 INFO L82 PathProgramCache]: Analyzing trace with hash 561380643, now seen corresponding path program 50 times [2019-08-04 21:39:37,755 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:37,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:37,778 WARN L254 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 103 conjunts are in the unsatisfiable core [2019-08-04 21:39:37,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:39,008 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-04 21:39:39,008 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:39,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-04 21:39:39,009 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-04 21:39:39,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-04 21:39:39,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2019-08-04 21:39:39,010 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2019-08-04 21:39:41,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:41,025 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-08-04 21:39:41,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-04 21:39:41,025 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2019-08-04 21:39:41,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:41,026 INFO L225 Difference]: With dead ends: 55 [2019-08-04 21:39:41,026 INFO L226 Difference]: Without dead ends: 55 [2019-08-04 21:39:41,027 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2019-08-04 21:39:41,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-04 21:39:41,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-08-04 21:39:41,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-04 21:39:41,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-08-04 21:39:41,029 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2019-08-04 21:39:41,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:41,030 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-08-04 21:39:41,030 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-04 21:39:41,030 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-08-04 21:39:41,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-04 21:39:41,031 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:41,031 INFO L399 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2019-08-04 21:39:41,031 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:41,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:41,031 INFO L82 PathProgramCache]: Analyzing trace with hash 222932556, now seen corresponding path program 51 times [2019-08-04 21:39:41,032 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:41,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:41,056 WARN L254 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 105 conjunts are in the unsatisfiable core [2019-08-04 21:39:41,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:42,148 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-04 21:39:42,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:42,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-04 21:39:42,149 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-04 21:39:42,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-04 21:39:42,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-08-04 21:39:42,149 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2019-08-04 21:39:44,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:44,371 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-08-04 21:39:44,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-04 21:39:44,371 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2019-08-04 21:39:44,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:44,372 INFO L225 Difference]: With dead ends: 56 [2019-08-04 21:39:44,372 INFO L226 Difference]: Without dead ends: 56 [2019-08-04 21:39:44,373 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-04 21:39:44,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-04 21:39:44,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-08-04 21:39:44,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-04 21:39:44,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-08-04 21:39:44,375 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2019-08-04 21:39:44,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:44,375 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-08-04 21:39:44,375 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-04 21:39:44,375 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-08-04 21:39:44,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-04 21:39:44,375 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:44,376 INFO L399 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2019-08-04 21:39:44,376 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:44,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:44,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1679023549, now seen corresponding path program 52 times [2019-08-04 21:39:44,377 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:44,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:44,395 WARN L254 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 107 conjunts are in the unsatisfiable core [2019-08-04 21:39:44,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:45,476 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-04 21:39:45,476 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:45,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-04 21:39:45,476 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-04 21:39:45,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-04 21:39:45,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-08-04 21:39:45,477 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2019-08-04 21:39:47,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:47,635 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-08-04 21:39:47,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-04 21:39:47,635 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2019-08-04 21:39:47,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:47,636 INFO L225 Difference]: With dead ends: 57 [2019-08-04 21:39:47,636 INFO L226 Difference]: Without dead ends: 57 [2019-08-04 21:39:47,637 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-08-04 21:39:47,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-04 21:39:47,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-08-04 21:39:47,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-04 21:39:47,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-08-04 21:39:47,640 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2019-08-04 21:39:47,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:47,640 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-08-04 21:39:47,640 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-04 21:39:47,640 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-08-04 21:39:47,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-04 21:39:47,641 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:47,641 INFO L399 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2019-08-04 21:39:47,641 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:47,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:47,641 INFO L82 PathProgramCache]: Analyzing trace with hash -510120660, now seen corresponding path program 53 times [2019-08-04 21:39:47,642 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:47,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:47,668 WARN L254 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 109 conjunts are in the unsatisfiable core [2019-08-04 21:39:47,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:49,027 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-04 21:39:49,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:49,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-04 21:39:49,028 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-04 21:39:49,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-04 21:39:49,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-08-04 21:39:49,029 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2019-08-04 21:39:51,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:51,267 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-08-04 21:39:51,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-04 21:39:51,267 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2019-08-04 21:39:51,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:51,268 INFO L225 Difference]: With dead ends: 58 [2019-08-04 21:39:51,268 INFO L226 Difference]: Without dead ends: 58 [2019-08-04 21:39:51,269 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-08-04 21:39:51,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-04 21:39:51,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-08-04 21:39:51,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-04 21:39:51,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-08-04 21:39:51,271 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2019-08-04 21:39:51,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:51,271 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-08-04 21:39:51,271 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-04 21:39:51,271 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-08-04 21:39:51,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-04 21:39:51,272 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:51,272 INFO L399 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2019-08-04 21:39:51,272 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:51,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:51,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1366130531, now seen corresponding path program 54 times [2019-08-04 21:39:51,273 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:51,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:51,300 WARN L254 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 111 conjunts are in the unsatisfiable core [2019-08-04 21:39:51,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:52,583 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-04 21:39:52,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:52,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-04 21:39:52,584 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-04 21:39:52,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-04 21:39:52,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2019-08-04 21:39:52,584 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2019-08-04 21:39:55,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:55,065 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-08-04 21:39:55,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-04 21:39:55,065 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2019-08-04 21:39:55,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:55,066 INFO L225 Difference]: With dead ends: 59 [2019-08-04 21:39:55,066 INFO L226 Difference]: Without dead ends: 59 [2019-08-04 21:39:55,067 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2019-08-04 21:39:55,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-04 21:39:55,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-08-04 21:39:55,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-04 21:39:55,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-08-04 21:39:55,069 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2019-08-04 21:39:55,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:55,069 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-08-04 21:39:55,069 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-04 21:39:55,069 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-08-04 21:39:55,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-04 21:39:55,070 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:55,070 INFO L399 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2019-08-04 21:39:55,070 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:55,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:55,070 INFO L82 PathProgramCache]: Analyzing trace with hash -599624692, now seen corresponding path program 55 times [2019-08-04 21:39:55,071 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:55,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:55,099 WARN L254 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 113 conjunts are in the unsatisfiable core [2019-08-04 21:39:55,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:56,354 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-04 21:39:56,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:56,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-04 21:39:56,354 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-04 21:39:56,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-04 21:39:56,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2019-08-04 21:39:56,355 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2019-08-04 21:39:58,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:58,854 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-08-04 21:39:58,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-04 21:39:58,856 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2019-08-04 21:39:58,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:58,857 INFO L225 Difference]: With dead ends: 60 [2019-08-04 21:39:58,857 INFO L226 Difference]: Without dead ends: 60 [2019-08-04 21:39:58,857 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2019-08-04 21:39:58,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-04 21:39:58,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-08-04 21:39:58,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-04 21:39:58,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-08-04 21:39:58,859 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2019-08-04 21:39:58,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:58,859 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-08-04 21:39:58,859 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-04 21:39:58,859 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-08-04 21:39:58,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-04 21:39:58,860 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:58,860 INFO L399 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2019-08-04 21:39:58,860 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:58,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:58,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1408494461, now seen corresponding path program 56 times [2019-08-04 21:39:58,861 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:58,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:58,889 WARN L254 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 115 conjunts are in the unsatisfiable core [2019-08-04 21:39:58,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:40:00,184 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-04 21:40:00,185 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:40:00,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-04 21:40:00,185 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-04 21:40:00,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-04 21:40:00,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2019-08-04 21:40:00,186 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2019-08-04 21:40:02,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:40:02,666 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-08-04 21:40:02,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-04 21:40:02,667 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2019-08-04 21:40:02,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:40:02,667 INFO L225 Difference]: With dead ends: 61 [2019-08-04 21:40:02,667 INFO L226 Difference]: Without dead ends: 61 [2019-08-04 21:40:02,668 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-04 21:40:02,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-04 21:40:02,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-08-04 21:40:02,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-04 21:40:02,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-08-04 21:40:02,671 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2019-08-04 21:40:02,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:40:02,671 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-08-04 21:40:02,671 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-04 21:40:02,671 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-08-04 21:40:02,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-04 21:40:02,672 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:40:02,672 INFO L399 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2019-08-04 21:40:02,672 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:40:02,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:40:02,672 INFO L82 PathProgramCache]: Analyzing trace with hash -713653524, now seen corresponding path program 57 times [2019-08-04 21:40:02,673 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:40:02,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:40:02,701 WARN L254 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 117 conjunts are in the unsatisfiable core [2019-08-04 21:40:02,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:40:04,239 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-04 21:40:04,239 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:40:04,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-04 21:40:04,239 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-04 21:40:04,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-04 21:40:04,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2019-08-04 21:40:04,240 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2019-08-04 21:40:06,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:40:06,819 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-08-04 21:40:06,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-04 21:40:06,819 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2019-08-04 21:40:06,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:40:06,820 INFO L225 Difference]: With dead ends: 62 [2019-08-04 21:40:06,820 INFO L226 Difference]: Without dead ends: 62 [2019-08-04 21:40:06,821 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2019-08-04 21:40:06,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-04 21:40:06,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-08-04 21:40:06,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-04 21:40:06,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-08-04 21:40:06,823 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2019-08-04 21:40:06,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:40:06,823 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-08-04 21:40:06,823 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-04 21:40:06,823 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-08-04 21:40:06,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-04 21:40:06,824 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:40:06,824 INFO L399 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2019-08-04 21:40:06,824 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:40:06,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:40:06,824 INFO L82 PathProgramCache]: Analyzing trace with hash -648420957, now seen corresponding path program 58 times [2019-08-04 21:40:06,825 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:40:06,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:40:06,849 WARN L254 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 119 conjunts are in the unsatisfiable core [2019-08-04 21:40:06,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:40:08,305 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-04 21:40:08,305 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:40:08,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-04 21:40:08,305 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-04 21:40:08,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-04 21:40:08,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2019-08-04 21:40:08,306 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2019-08-04 21:40:11,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:40:11,119 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-08-04 21:40:11,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-04 21:40:11,119 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2019-08-04 21:40:11,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:40:11,120 INFO L225 Difference]: With dead ends: 63 [2019-08-04 21:40:11,120 INFO L226 Difference]: Without dead ends: 63 [2019-08-04 21:40:11,121 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2019-08-04 21:40:11,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-04 21:40:11,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-08-04 21:40:11,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-04 21:40:11,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-08-04 21:40:11,123 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2019-08-04 21:40:11,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:40:11,123 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-08-04 21:40:11,123 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-04 21:40:11,123 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-08-04 21:40:11,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-04 21:40:11,124 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:40:11,124 INFO L399 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2019-08-04 21:40:11,124 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:40:11,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:40:11,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1373788620, now seen corresponding path program 59 times [2019-08-04 21:40:11,125 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:40:11,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:40:11,149 WARN L254 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 121 conjunts are in the unsatisfiable core [2019-08-04 21:40:11,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:40:12,603 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-04 21:40:12,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:40:12,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-04 21:40:12,604 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-04 21:40:12,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-04 21:40:12,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2019-08-04 21:40:12,605 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2019-08-04 21:40:15,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:40:15,456 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-08-04 21:40:15,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-04 21:40:15,457 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2019-08-04 21:40:15,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:40:15,458 INFO L225 Difference]: With dead ends: 64 [2019-08-04 21:40:15,458 INFO L226 Difference]: Without dead ends: 64 [2019-08-04 21:40:15,458 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2019-08-04 21:40:15,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-04 21:40:15,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-08-04 21:40:15,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-04 21:40:15,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-08-04 21:40:15,460 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2019-08-04 21:40:15,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:40:15,460 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-08-04 21:40:15,461 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-04 21:40:15,461 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-08-04 21:40:15,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-04 21:40:15,461 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:40:15,461 INFO L399 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2019-08-04 21:40:15,461 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:40:15,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:40:15,462 INFO L82 PathProgramCache]: Analyzing trace with hash -362223933, now seen corresponding path program 60 times [2019-08-04 21:40:15,462 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:40:15,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:40:15,491 WARN L254 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 123 conjunts are in the unsatisfiable core [2019-08-04 21:40:15,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:40:16,983 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-04 21:40:16,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:40:16,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-04 21:40:16,984 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-04 21:40:16,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-04 21:40:16,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2019-08-04 21:40:16,985 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2019-08-04 21:40:20,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:40:20,021 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-08-04 21:40:20,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-04 21:40:20,022 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2019-08-04 21:40:20,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:40:20,023 INFO L225 Difference]: With dead ends: 65 [2019-08-04 21:40:20,023 INFO L226 Difference]: Without dead ends: 65 [2019-08-04 21:40:20,023 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2019-08-04 21:40:20,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-04 21:40:20,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-08-04 21:40:20,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-04 21:40:20,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-08-04 21:40:20,025 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2019-08-04 21:40:20,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:40:20,026 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-08-04 21:40:20,026 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-04 21:40:20,026 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-08-04 21:40:20,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-04 21:40:20,026 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:40:20,027 INFO L399 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2019-08-04 21:40:20,027 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:40:20,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:40:20,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1655961772, now seen corresponding path program 61 times [2019-08-04 21:40:20,028 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:40:20,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:40:20,050 WARN L254 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 125 conjunts are in the unsatisfiable core [2019-08-04 21:40:20,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:40:21,517 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-04 21:40:21,518 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:40:21,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-04 21:40:21,518 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-04 21:40:21,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-04 21:40:21,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2019-08-04 21:40:21,519 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2019-08-04 21:40:24,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:40:24,611 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-08-04 21:40:24,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-04 21:40:24,611 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2019-08-04 21:40:24,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:40:24,612 INFO L225 Difference]: With dead ends: 66 [2019-08-04 21:40:24,612 INFO L226 Difference]: Without dead ends: 66 [2019-08-04 21:40:24,612 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2019-08-04 21:40:24,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-04 21:40:24,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-08-04 21:40:24,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-04 21:40:24,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-08-04 21:40:24,614 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2019-08-04 21:40:24,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:40:24,615 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-08-04 21:40:24,615 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-04 21:40:24,615 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-08-04 21:40:24,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-08-04 21:40:24,615 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:40:24,615 INFO L399 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2019-08-04 21:40:24,616 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:40:24,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:40:24,616 INFO L82 PathProgramCache]: Analyzing trace with hash -204790813, now seen corresponding path program 62 times [2019-08-04 21:40:24,616 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:40:24,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:40:24,650 WARN L254 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 127 conjunts are in the unsatisfiable core [2019-08-04 21:40:24,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:40:26,733 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-04 21:40:26,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:40:26,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-04 21:40:26,734 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-04 21:40:26,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-04 21:40:26,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2019-08-04 21:40:26,735 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2019-08-04 21:40:29,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:40:29,913 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-08-04 21:40:29,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-04 21:40:29,914 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2019-08-04 21:40:29,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:40:29,915 INFO L225 Difference]: With dead ends: 67 [2019-08-04 21:40:29,915 INFO L226 Difference]: Without dead ends: 67 [2019-08-04 21:40:29,915 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2019-08-04 21:40:29,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-04 21:40:29,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-08-04 21:40:29,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-04 21:40:29,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-08-04 21:40:29,918 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2019-08-04 21:40:29,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:40:29,918 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-08-04 21:40:29,918 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-04 21:40:29,918 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-08-04 21:40:29,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-04 21:40:29,919 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:40:29,919 INFO L399 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2019-08-04 21:40:29,919 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:40:29,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:40:29,919 INFO L82 PathProgramCache]: Analyzing trace with hash -2053546100, now seen corresponding path program 63 times [2019-08-04 21:40:29,920 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:40:29,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:40:29,952 WARN L254 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 129 conjunts are in the unsatisfiable core [2019-08-04 21:40:29,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:40:31,519 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-04 21:40:31,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:40:31,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-04 21:40:31,520 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-04 21:40:31,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-04 21:40:31,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2019-08-04 21:40:31,520 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2019-08-04 21:40:34,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:40:34,804 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-08-04 21:40:34,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-04 21:40:34,804 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2019-08-04 21:40:34,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:40:34,805 INFO L225 Difference]: With dead ends: 68 [2019-08-04 21:40:34,805 INFO L226 Difference]: Without dead ends: 68 [2019-08-04 21:40:34,806 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2019-08-04 21:40:34,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-04 21:40:34,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-08-04 21:40:34,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-04 21:40:34,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-08-04 21:40:34,809 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2019-08-04 21:40:34,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:40:34,809 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-08-04 21:40:34,809 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-04 21:40:34,810 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-08-04 21:40:34,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-04 21:40:34,810 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:40:34,810 INFO L399 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2019-08-04 21:40:34,810 INFO L418 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:40:34,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:40:34,811 INFO L82 PathProgramCache]: Analyzing trace with hash 764582147, now seen corresponding path program 64 times [2019-08-04 21:40:34,811 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:40:34,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:40:34,854 WARN L254 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 131 conjunts are in the unsatisfiable core [2019-08-04 21:40:34,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:40:36,566 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-04 21:40:36,566 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:40:36,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-04 21:40:36,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-04 21:40:36,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-04 21:40:36,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2019-08-04 21:40:36,567 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2019-08-04 21:40:39,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:40:39,980 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-08-04 21:40:39,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-04 21:40:39,980 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2019-08-04 21:40:39,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:40:39,981 INFO L225 Difference]: With dead ends: 69 [2019-08-04 21:40:39,981 INFO L226 Difference]: Without dead ends: 69 [2019-08-04 21:40:39,981 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-04 21:40:39,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-04 21:40:39,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-08-04 21:40:39,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-04 21:40:39,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-08-04 21:40:39,983 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2019-08-04 21:40:39,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:40:39,984 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-08-04 21:40:39,984 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-04 21:40:39,984 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-08-04 21:40:39,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-04 21:40:39,984 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:40:39,985 INFO L399 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2019-08-04 21:40:39,985 INFO L418 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:40:39,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:40:39,985 INFO L82 PathProgramCache]: Analyzing trace with hash -2067755412, now seen corresponding path program 65 times [2019-08-04 21:40:39,985 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:40:40,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:40:40,010 WARN L254 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 133 conjunts are in the unsatisfiable core [2019-08-04 21:40:40,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:40:41,721 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-04 21:40:41,722 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:40:41,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-04 21:40:41,722 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-04 21:40:41,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-04 21:40:41,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2019-08-04 21:40:41,723 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2019-08-04 21:40:45,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:40:45,216 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-08-04 21:40:45,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-04 21:40:45,217 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2019-08-04 21:40:45,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:40:45,218 INFO L225 Difference]: With dead ends: 70 [2019-08-04 21:40:45,218 INFO L226 Difference]: Without dead ends: 70 [2019-08-04 21:40:45,218 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-04 21:40:45,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-04 21:40:45,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-08-04 21:40:45,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-04 21:40:45,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-08-04 21:40:45,220 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2019-08-04 21:40:45,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:40:45,220 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-08-04 21:40:45,221 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-04 21:40:45,221 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-08-04 21:40:45,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-04 21:40:45,221 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:40:45,221 INFO L399 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2019-08-04 21:40:45,221 INFO L418 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:40:45,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:40:45,222 INFO L82 PathProgramCache]: Analyzing trace with hash 324093475, now seen corresponding path program 66 times [2019-08-04 21:40:45,222 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:40:45,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:40:45,252 WARN L254 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 135 conjunts are in the unsatisfiable core [2019-08-04 21:40:45,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:40:47,046 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-04 21:40:47,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:40:47,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-04 21:40:47,047 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-04 21:40:47,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-04 21:40:47,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2019-08-04 21:40:47,048 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2019-08-04 21:40:50,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:40:50,666 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-08-04 21:40:50,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-04 21:40:50,666 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2019-08-04 21:40:50,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:40:50,667 INFO L225 Difference]: With dead ends: 71 [2019-08-04 21:40:50,667 INFO L226 Difference]: Without dead ends: 71 [2019-08-04 21:40:50,668 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2019-08-04 21:40:50,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-04 21:40:50,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-08-04 21:40:50,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-04 21:40:50,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-08-04 21:40:50,670 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2019-08-04 21:40:50,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:40:50,671 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-08-04 21:40:50,671 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-04 21:40:50,671 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-08-04 21:40:50,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-04 21:40:50,672 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:40:50,672 INFO L399 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2019-08-04 21:40:50,673 INFO L418 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:40:50,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:40:50,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1456964940, now seen corresponding path program 67 times [2019-08-04 21:40:50,674 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:40:50,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:40:50,715 WARN L254 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 137 conjunts are in the unsatisfiable core [2019-08-04 21:40:50,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:40:52,559 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-04 21:40:52,560 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:40:52,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-04 21:40:52,560 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-04 21:40:52,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-04 21:40:52,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2019-08-04 21:40:52,561 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2019-08-04 21:40:56,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:40:56,233 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-08-04 21:40:56,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-04 21:40:56,234 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2019-08-04 21:40:56,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:40:56,234 INFO L225 Difference]: With dead ends: 72 [2019-08-04 21:40:56,235 INFO L226 Difference]: Without dead ends: 72 [2019-08-04 21:40:56,235 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2019-08-04 21:40:56,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-04 21:40:56,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-08-04 21:40:56,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-08-04 21:40:56,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-08-04 21:40:56,237 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2019-08-04 21:40:56,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:40:56,238 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-08-04 21:40:56,238 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-04 21:40:56,238 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-08-04 21:40:56,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-04 21:40:56,238 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:40:56,239 INFO L399 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2019-08-04 21:40:56,239 INFO L418 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:40:56,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:40:56,239 INFO L82 PathProgramCache]: Analyzing trace with hash -2078725309, now seen corresponding path program 68 times [2019-08-04 21:40:56,240 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:40:56,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:40:56,273 WARN L254 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 139 conjunts are in the unsatisfiable core [2019-08-04 21:40:56,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:40:58,128 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-04 21:40:58,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:40:58,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-04 21:40:58,129 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-04 21:40:58,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-04 21:40:58,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2019-08-04 21:40:58,129 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2019-08-04 21:41:01,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:41:01,897 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-08-04 21:41:01,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-04 21:41:01,898 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2019-08-04 21:41:01,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:41:01,898 INFO L225 Difference]: With dead ends: 73 [2019-08-04 21:41:01,898 INFO L226 Difference]: Without dead ends: 73 [2019-08-04 21:41:01,899 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2019-08-04 21:41:01,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-04 21:41:01,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-08-04 21:41:01,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-04 21:41:01,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-08-04 21:41:01,900 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2019-08-04 21:41:01,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:41:01,900 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-08-04 21:41:01,901 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-04 21:41:01,901 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-08-04 21:41:01,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-04 21:41:01,901 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:41:01,902 INFO L399 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2019-08-04 21:41:01,902 INFO L418 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:41:01,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:41:01,903 INFO L82 PathProgramCache]: Analyzing trace with hash -15973332, now seen corresponding path program 69 times [2019-08-04 21:41:01,903 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:41:01,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:41:01,940 WARN L254 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 141 conjunts are in the unsatisfiable core [2019-08-04 21:41:01,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:41:03,855 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-04 21:41:03,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:41:03,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-04 21:41:03,855 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-04 21:41:03,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-04 21:41:03,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2019-08-04 21:41:03,856 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2019-08-04 21:41:07,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:41:07,758 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-08-04 21:41:07,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-04 21:41:07,759 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2019-08-04 21:41:07,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:41:07,760 INFO L225 Difference]: With dead ends: 74 [2019-08-04 21:41:07,760 INFO L226 Difference]: Without dead ends: 74 [2019-08-04 21:41:07,761 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2019-08-04 21:41:07,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-04 21:41:07,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-08-04 21:41:07,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-04 21:41:07,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-08-04 21:41:07,764 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2019-08-04 21:41:07,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:41:07,764 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-08-04 21:41:07,764 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-04 21:41:07,764 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-08-04 21:41:07,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-08-04 21:41:07,765 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:41:07,765 INFO L399 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2019-08-04 21:41:07,765 INFO L418 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:41:07,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:41:07,766 INFO L82 PathProgramCache]: Analyzing trace with hash -495171485, now seen corresponding path program 70 times [2019-08-04 21:41:07,766 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:41:07,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:41:07,817 WARN L254 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 143 conjunts are in the unsatisfiable core [2019-08-04 21:41:07,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:41:09,999 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-04 21:41:10,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:41:10,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-04 21:41:10,000 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-08-04 21:41:10,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-08-04 21:41:10,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2019-08-04 21:41:10,001 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2019-08-04 21:41:13,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:41:13,963 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-08-04 21:41:13,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-04 21:41:13,963 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2019-08-04 21:41:13,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:41:13,964 INFO L225 Difference]: With dead ends: 75 [2019-08-04 21:41:13,964 INFO L226 Difference]: Without dead ends: 75 [2019-08-04 21:41:13,965 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-04 21:41:13,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-04 21:41:13,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-08-04 21:41:13,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-04 21:41:13,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-08-04 21:41:13,968 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2019-08-04 21:41:13,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:41:13,968 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-08-04 21:41:13,968 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-08-04 21:41:13,968 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-08-04 21:41:13,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-04 21:41:13,969 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:41:13,969 INFO L399 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2019-08-04 21:41:13,969 INFO L418 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:41:13,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:41:13,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1829554956, now seen corresponding path program 71 times [2019-08-04 21:41:13,970 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:41:14,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:41:14,018 WARN L254 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 145 conjunts are in the unsatisfiable core [2019-08-04 21:41:14,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:41:16,582 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-04 21:41:16,582 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:41:16,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-04 21:41:16,583 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-04 21:41:16,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-04 21:41:16,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2019-08-04 21:41:16,584 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2019-08-04 21:41:20,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:41:20,729 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-08-04 21:41:20,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-04 21:41:20,730 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2019-08-04 21:41:20,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:41:20,731 INFO L225 Difference]: With dead ends: 76 [2019-08-04 21:41:20,731 INFO L226 Difference]: Without dead ends: 76 [2019-08-04 21:41:20,732 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2019-08-04 21:41:20,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-04 21:41:20,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-08-04 21:41:20,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-04 21:41:20,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-08-04 21:41:20,734 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2019-08-04 21:41:20,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:41:20,734 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-08-04 21:41:20,734 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-04 21:41:20,735 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-08-04 21:41:20,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-04 21:41:20,735 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:41:20,735 INFO L399 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2019-08-04 21:41:20,735 INFO L418 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:41:20,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:41:20,736 INFO L82 PathProgramCache]: Analyzing trace with hash 881630595, now seen corresponding path program 72 times [2019-08-04 21:41:20,736 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:41:20,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:41:20,784 WARN L254 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 147 conjunts are in the unsatisfiable core [2019-08-04 21:41:20,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:41:23,012 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-04 21:41:23,012 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:41:23,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-04 21:41:23,013 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-04 21:41:23,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-04 21:41:23,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2019-08-04 21:41:23,013 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2019-08-04 21:41:27,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:41:27,173 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-08-04 21:41:27,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-04 21:41:27,173 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2019-08-04 21:41:27,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:41:27,174 INFO L225 Difference]: With dead ends: 77 [2019-08-04 21:41:27,174 INFO L226 Difference]: Without dead ends: 77 [2019-08-04 21:41:27,175 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-04 21:41:27,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-04 21:41:27,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-08-04 21:41:27,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-04 21:41:27,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-08-04 21:41:27,177 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2019-08-04 21:41:27,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:41:27,177 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-08-04 21:41:27,178 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-04 21:41:27,178 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-08-04 21:41:27,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-04 21:41:27,178 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:41:27,178 INFO L399 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2019-08-04 21:41:27,178 INFO L418 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:41:27,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:41:27,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1560746476, now seen corresponding path program 73 times [2019-08-04 21:41:27,179 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:41:27,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:41:27,214 WARN L254 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 149 conjunts are in the unsatisfiable core [2019-08-04 21:41:27,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:41:29,290 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-04 21:41:29,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:41:29,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-04 21:41:29,291 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-04 21:41:29,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-04 21:41:29,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2019-08-04 21:41:29,291 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2019-08-04 21:41:33,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:41:33,614 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-08-04 21:41:33,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-04 21:41:33,614 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2019-08-04 21:41:33,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:41:33,615 INFO L225 Difference]: With dead ends: 78 [2019-08-04 21:41:33,615 INFO L226 Difference]: Without dead ends: 78 [2019-08-04 21:41:33,616 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2019-08-04 21:41:33,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-04 21:41:33,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-08-04 21:41:33,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-08-04 21:41:33,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-08-04 21:41:33,618 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2019-08-04 21:41:33,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:41:33,618 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-08-04 21:41:33,618 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-04 21:41:33,619 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-08-04 21:41:33,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-04 21:41:33,619 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:41:33,619 INFO L399 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2019-08-04 21:41:33,620 INFO L418 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:41:33,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:41:33,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1138502307, now seen corresponding path program 74 times [2019-08-04 21:41:33,620 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:41:33,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:41:33,654 WARN L254 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 151 conjunts are in the unsatisfiable core [2019-08-04 21:41:33,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:41:36,097 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-04 21:41:36,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:41:36,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-08-04 21:41:36,097 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-08-04 21:41:36,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-08-04 21:41:36,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2019-08-04 21:41:36,098 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2019-08-04 21:41:40,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:41:40,349 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-08-04 21:41:40,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-04 21:41:40,350 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2019-08-04 21:41:40,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:41:40,351 INFO L225 Difference]: With dead ends: 79 [2019-08-04 21:41:40,351 INFO L226 Difference]: Without dead ends: 79 [2019-08-04 21:41:40,351 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2019-08-04 21:41:40,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-04 21:41:40,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-08-04 21:41:40,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-04 21:41:40,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-08-04 21:41:40,353 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2019-08-04 21:41:40,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:41:40,354 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-08-04 21:41:40,354 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-08-04 21:41:40,354 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-08-04 21:41:40,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-04 21:41:40,355 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:41:40,355 INFO L399 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2019-08-04 21:41:40,355 INFO L418 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:41:40,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:41:40,355 INFO L82 PathProgramCache]: Analyzing trace with hash 933834956, now seen corresponding path program 75 times [2019-08-04 21:41:40,356 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:41:40,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:41:40,398 WARN L254 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 153 conjunts are in the unsatisfiable core [2019-08-04 21:41:40,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:41:42,868 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-04 21:41:42,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:41:42,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-04 21:41:42,868 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-04 21:41:42,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-04 21:41:42,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2019-08-04 21:41:42,869 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2019-08-04 21:41:47,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:41:47,285 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-08-04 21:41:47,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-04 21:41:47,286 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2019-08-04 21:41:47,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:41:47,287 INFO L225 Difference]: With dead ends: 80 [2019-08-04 21:41:47,287 INFO L226 Difference]: Without dead ends: 80 [2019-08-04 21:41:47,287 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2019-08-04 21:41:47,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-04 21:41:47,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-08-04 21:41:47,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-08-04 21:41:47,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-08-04 21:41:47,289 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2019-08-04 21:41:47,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:41:47,290 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-08-04 21:41:47,290 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-04 21:41:47,290 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-08-04 21:41:47,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-08-04 21:41:47,290 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:41:47,291 INFO L399 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2019-08-04 21:41:47,291 INFO L418 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:41:47,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:41:47,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1115885629, now seen corresponding path program 76 times [2019-08-04 21:41:47,292 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:41:47,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:41:47,335 WARN L254 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 155 conjunts are in the unsatisfiable core [2019-08-04 21:41:47,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:41:49,620 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-04 21:41:49,620 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:41:49,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-08-04 21:41:49,620 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-08-04 21:41:49,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-08-04 21:41:49,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2019-08-04 21:41:49,621 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2019-08-04 21:41:54,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:41:54,237 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-08-04 21:41:54,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-08-04 21:41:54,238 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2019-08-04 21:41:54,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:41:54,239 INFO L225 Difference]: With dead ends: 81 [2019-08-04 21:41:54,239 INFO L226 Difference]: Without dead ends: 81 [2019-08-04 21:41:54,240 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2019-08-04 21:41:54,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-08-04 21:41:54,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-08-04 21:41:54,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-04 21:41:54,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-08-04 21:41:54,242 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2019-08-04 21:41:54,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:41:54,242 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-08-04 21:41:54,242 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-08-04 21:41:54,242 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-08-04 21:41:54,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-08-04 21:41:54,243 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:41:54,243 INFO L399 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2019-08-04 21:41:54,243 INFO L418 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:41:54,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:41:54,243 INFO L82 PathProgramCache]: Analyzing trace with hash -232714324, now seen corresponding path program 77 times [2019-08-04 21:41:54,244 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:41:54,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:41:54,289 WARN L254 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 157 conjunts are in the unsatisfiable core [2019-08-04 21:41:54,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:41:56,939 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-04 21:41:56,939 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:41:56,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-08-04 21:41:56,940 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-08-04 21:41:56,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-08-04 21:41:56,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2019-08-04 21:41:56,941 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. [2019-08-04 21:42:02,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:42:02,182 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-08-04 21:42:02,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-08-04 21:42:02,182 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2019-08-04 21:42:02,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:42:02,183 INFO L225 Difference]: With dead ends: 82 [2019-08-04 21:42:02,183 INFO L226 Difference]: Without dead ends: 82 [2019-08-04 21:42:02,184 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2019-08-04 21:42:02,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-04 21:42:02,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-08-04 21:42:02,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-08-04 21:42:02,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-08-04 21:42:02,186 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2019-08-04 21:42:02,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:42:02,187 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-08-04 21:42:02,187 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-08-04 21:42:02,187 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-08-04 21:42:02,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-08-04 21:42:02,187 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:42:02,187 INFO L399 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2019-08-04 21:42:02,188 INFO L418 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:42:02,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:42:02,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1375792355, now seen corresponding path program 78 times [2019-08-04 21:42:02,189 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:42:02,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:42:02,230 WARN L254 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 159 conjunts are in the unsatisfiable core [2019-08-04 21:42:02,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:42:04,691 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-04 21:42:04,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:42:04,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2019-08-04 21:42:04,692 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-08-04 21:42:04,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-08-04 21:42:04,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2019-08-04 21:42:04,693 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 81 states. [2019-08-04 21:42:09,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:42:09,571 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-08-04 21:42:09,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-08-04 21:42:09,572 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 81 [2019-08-04 21:42:09,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:42:09,573 INFO L225 Difference]: With dead ends: 83 [2019-08-04 21:42:09,573 INFO L226 Difference]: Without dead ends: 83 [2019-08-04 21:42:09,573 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2019-08-04 21:42:09,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-08-04 21:42:09,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-08-04 21:42:09,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-04 21:42:09,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-08-04 21:42:09,576 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2019-08-04 21:42:09,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:42:09,577 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2019-08-04 21:42:09,577 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-08-04 21:42:09,577 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-08-04 21:42:09,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-08-04 21:42:09,577 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:42:09,578 INFO L399 BasicCegarLoop]: trace histogram [79, 1, 1, 1] [2019-08-04 21:42:09,578 INFO L418 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:42:09,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:42:09,578 INFO L82 PathProgramCache]: Analyzing trace with hash -300108148, now seen corresponding path program 79 times [2019-08-04 21:42:09,579 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:42:09,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:42:09,638 WARN L254 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 161 conjunts are in the unsatisfiable core [2019-08-04 21:42:09,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:42:12,433 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-04 21:42:12,433 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:42:12,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2019-08-04 21:42:12,433 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-08-04 21:42:12,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-08-04 21:42:12,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2019-08-04 21:42:12,434 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 82 states. [2019-08-04 21:42:17,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:42:17,358 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-08-04 21:42:17,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-08-04 21:42:17,358 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 82 [2019-08-04 21:42:17,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:42:17,359 INFO L225 Difference]: With dead ends: 84 [2019-08-04 21:42:17,359 INFO L226 Difference]: Without dead ends: 84 [2019-08-04 21:42:17,359 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2019-08-04 21:42:17,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-08-04 21:42:17,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-08-04 21:42:17,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-08-04 21:42:17,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2019-08-04 21:42:17,362 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2019-08-04 21:42:17,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:42:17,362 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2019-08-04 21:42:17,362 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-08-04 21:42:17,362 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-08-04 21:42:17,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-08-04 21:42:17,363 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:42:17,363 INFO L399 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2019-08-04 21:42:17,363 INFO L418 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:42:17,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:42:17,364 INFO L82 PathProgramCache]: Analyzing trace with hash -713416189, now seen corresponding path program 80 times [2019-08-04 21:42:17,364 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:42:17,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:42:17,410 WARN L254 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 163 conjunts are in the unsatisfiable core [2019-08-04 21:42:17,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:42:20,575 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-04 21:42:20,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:42:20,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2019-08-04 21:42:20,576 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-08-04 21:42:20,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-08-04 21:42:20,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2019-08-04 21:42:20,577 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 83 states. [2019-08-04 21:42:25,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:42:25,644 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-08-04 21:42:25,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-08-04 21:42:25,645 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2019-08-04 21:42:25,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:42:25,646 INFO L225 Difference]: With dead ends: 85 [2019-08-04 21:42:25,646 INFO L226 Difference]: Without dead ends: 85 [2019-08-04 21:42:25,646 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2019-08-04 21:42:25,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-08-04 21:42:25,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-08-04 21:42:25,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-04 21:42:25,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-08-04 21:42:25,649 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2019-08-04 21:42:25,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:42:25,649 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-08-04 21:42:25,649 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-08-04 21:42:25,649 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-08-04 21:42:25,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-08-04 21:42:25,650 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:42:25,650 INFO L399 BasicCegarLoop]: trace histogram [81, 1, 1, 1] [2019-08-04 21:42:25,650 INFO L418 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:42:25,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:42:25,651 INFO L82 PathProgramCache]: Analyzing trace with hash -641063572, now seen corresponding path program 81 times [2019-08-04 21:42:25,651 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:42:25,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:42:25,694 WARN L254 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 165 conjunts are in the unsatisfiable core [2019-08-04 21:42:25,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:42:28,438 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-04 21:42:28,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:42:28,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2019-08-04 21:42:28,439 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-08-04 21:42:28,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-08-04 21:42:28,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=6807, Unknown=0, NotChecked=0, Total=6972 [2019-08-04 21:42:28,439 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 84 states. [2019-08-04 21:42:33,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:42:33,651 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-08-04 21:42:33,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-08-04 21:42:33,651 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 84 [2019-08-04 21:42:33,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:42:33,652 INFO L225 Difference]: With dead ends: 86 [2019-08-04 21:42:33,652 INFO L226 Difference]: Without dead ends: 86 [2019-08-04 21:42:33,653 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=165, Invalid=6807, Unknown=0, NotChecked=0, Total=6972 [2019-08-04 21:42:33,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-08-04 21:42:33,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-08-04 21:42:33,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-08-04 21:42:33,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-08-04 21:42:33,655 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2019-08-04 21:42:33,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:42:33,655 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-08-04 21:42:33,655 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-08-04 21:42:33,656 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-08-04 21:42:33,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-04 21:42:33,656 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:42:33,656 INFO L399 BasicCegarLoop]: trace histogram [82, 1, 1, 1] [2019-08-04 21:42:33,656 INFO L418 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:42:33,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:42:33,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1601867555, now seen corresponding path program 82 times [2019-08-04 21:42:33,657 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:42:33,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:42:33,698 WARN L254 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 167 conjunts are in the unsatisfiable core [2019-08-04 21:42:33,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:42:37,712 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-04 21:42:37,712 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:42:37,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2019-08-04 21:42:37,713 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-08-04 21:42:37,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-08-04 21:42:37,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=6973, Unknown=0, NotChecked=0, Total=7140 [2019-08-04 21:42:37,713 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 85 states. Received shutdown request... [2019-08-04 21:42:38,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-04 21:42:38,673 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-04 21:42:38,680 WARN L223 ceAbstractionStarter]: Timeout [2019-08-04 21:42:38,680 INFO L202 PluginConnector]: Adding new model simple1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 09:42:38 BoogieIcfgContainer [2019-08-04 21:42:38,680 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-04 21:42:38,683 INFO L168 Benchmark]: Toolchain (without parser) took 249459.08 ms. Allocated memory was 133.2 MB in the beginning and 190.3 MB in the end (delta: 57.1 MB). Free memory was 109.4 MB in the beginning and 19.3 MB in the end (delta: 90.1 MB). Peak memory consumption was 147.3 MB. Max. memory is 7.1 GB. [2019-08-04 21:42:38,683 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 133.2 MB. Free memory was 110.6 MB in the beginning and 110.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-08-04 21:42:38,684 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.02 ms. Allocated memory is still 133.2 MB. Free memory was 109.2 MB in the beginning and 107.7 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB. [2019-08-04 21:42:38,684 INFO L168 Benchmark]: Boogie Preprocessor took 20.38 ms. Allocated memory is still 133.2 MB. Free memory was 107.7 MB in the beginning and 106.5 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-08-04 21:42:38,685 INFO L168 Benchmark]: RCFGBuilder took 334.39 ms. Allocated memory is still 133.2 MB. Free memory was 106.3 MB in the beginning and 97.2 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. [2019-08-04 21:42:38,686 INFO L168 Benchmark]: TraceAbstraction took 249065.82 ms. Allocated memory was 133.2 MB in the beginning and 190.3 MB in the end (delta: 57.1 MB). Free memory was 96.9 MB in the beginning and 19.3 MB in the end (delta: 77.7 MB). Peak memory consumption was 134.8 MB. Max. memory is 7.1 GB. [2019-08-04 21:42:38,688 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.20 ms. Allocated memory is still 133.2 MB. Free memory was 110.6 MB in the beginning and 110.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 34.02 ms. Allocated memory is still 133.2 MB. Free memory was 109.2 MB in the beginning and 107.7 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 20.38 ms. Allocated memory is still 133.2 MB. Free memory was 107.7 MB in the beginning and 106.5 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 334.39 ms. Allocated memory is still 133.2 MB. Free memory was 106.3 MB in the beginning and 97.2 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 249065.82 ms. Allocated memory was 133.2 MB in the beginning and 190.3 MB in the end (delta: 57.1 MB). Free memory was 96.9 MB in the beginning and 19.3 MB in the end (delta: 77.7 MB). Peak memory consumption was 134.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 30]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 30). Cancelled while BasicCegarLoop was constructing difference of abstraction (86states) and FLOYD_HOARE automaton (currently 18 states, 85 states before enhancement),while ReachableStatesComputation was computing reachable states (16 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. TIMEOUT Result, 249.0s OverallTime, 83 OverallIterations, 82 TraceHistogramMax, 152.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 247 SDtfs, 0 SDslu, 3403 SDs, 0 SdLazy, 195298 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 124.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3569 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 3486 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 92.9s 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.5s SatisfiabilityAnalysisTime, 94.4s InterpolantComputationTime, 3652 NumberOfCodeBlocks, 3652 NumberOfCodeBlocksAsserted, 83 NumberOfCheckSat, 3569 ConstructedInterpolants, 0 QuantifiedInterpolants, 596189 SizeOfPredicates, 83 NumberOfNonLiveVariables, 11205 ConjunctsInSsa, 7055 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